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

• Correa Espinal, Alexander ^[1] ; Rodriguez Velásquez, Elkin ^[1] ; Gómez Montoya, Rodrigo A. ^[2] ; Hernandez Vahos, José D. ^[1]
  1. [1] Universidad Nacional de Colombia

     Universidad Nacional de Colombia

     Colombia

     
  2. [2] Politécnico Colombiano Jaime Isaza Cadavid Bogotá
• Localización: TECCIENCIA, ISSN-e 2422-3670, ISSN 1909-3667, Vol. 8, Nº. 15, 2013 (Ejemplar dedicado a: TECCIENCIA (Jul-Dec 2013)), págs. 43-48
• Idioma: español
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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.