Efficient preparation of orders in a distributor coffee company using tabu search

Alexander Correa Espinal, Elkin Rodriguez Velásquez, Rodrigo A. Gómez Montoya, José D. Hernandez Vahos


The article aims to develop a tabu search metaheuristic to solve the routing Travelling Salesman Problem (TSP) in the order picking process to obtain minimum distances when collecting products from the storage positions. The tabu search metaheuristic was implemented in the order picking of a coffee trading company in Antioquia, allowing the reduction of distance, time and cost of 44%, what amounts to a cost savings of $ 825000 a month and 825 minutes a month compared to a FLCL (Farthest Location -Closest Location) routing strategy, currently being used by the company, which allows to increase the efficiency of this operation.


Efficiency; Metaheuristic; Picking; Routing; Taboo search

Full Text:



J.Bartholdi y S.Hackman, Warehouse& Distribution Science,The Supply Chain and Logistics Institute, Georgia & Estados Unidos (2011).

E.Frazelle y S.Sojo, Logística de Almacenamiento y Manejo de Materiales de Clase Mundial,Grupo Editorial Norma,Bogotá & Colombia (2006).

H. Min,“Application of a decision support system to strategic warehousing decisions,”International Journal of Physical Distribution & Logistics Management,Vol. 39, pp. 270-281,2009.

J.P Van Den Berg, Integral Warehouse Management, Lulu.com, Amsterdam& Holanda (2007).

S. Henn,S.Koch, K.Doerner, C.Strauss, and G.Wäscher,G, “Metaheuristics for the order batching problem in manual order picking systems,”, Vol. 3, pp 1-24, 2010.

R.Koster and E.Poort, “Routing orderpickers in a warehouse: a comparison between optimal and heuristic solutions,” IIE transactions, vol. 30, pp. 469–480, 2010.

C.Theys, O.Bräysy, W.Dullaert, and B.Raa,”Using a TSP heuristic for routing order pickers in warehouses,” European Journal of Operational Research Vol. 200, pp. 755-763, 2010.

O.Kulak, Y.Sahin, and M.Taner,”Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms, ”Flexible services and manufacturing journal, Vol. 24,

pp. 52–80, 2012.

S.Henn, and G.Wäscher,”Tabu search heuristics for the order batching problem in manual order picking systems,” European Journal of Operational Research,Vol. 222, pp. 484-494, 2012.

C.Tsai, J. Liou, and T.Huang,”Using a multiple- GA - method to solve the batch picking problem: considering travel distance and order due time,”International Journal of Production Research, Vol. 46, pp. 6533-6555, 2008.

DOI: http://dx.doi.org/10.18180/tecciencia.2013.15.5


  • There are currently no refbacks.

Copyright (c) 2014 TECCIENCIA