Modelamiento del ruteo del acomodo de tiempo mínimo en centros de distribución (CEDI) usando Búsqueda Tabú

This article aims to develop a tabu search metaheuristic to set putaway routes, which is modeled as a problem Traveling Salesman Problem, in order to obtain sequences of m positions of storage j to place n products in the minimum time. The tabu search metaheuristic was implemented in the putaway ope...

Full description

Saved in:
Bibliographic Details
Published inRevista Soluciones de Postgrado EIA no. 12; p. 15
Main Authors Espinal, Alexánder AlbertoCorrea, Velásquez, Elkin Rodríguez, Montoya, Rodrigo Andrés Gómez
Format Journal Article
LanguageSpanish
Published Envigado Escuela de Ingeniería de Antioquia, Sede de Las Palmas 01.01.2014
Online AccessGet full text

Cover

More Information
Summary:This article aims to develop a tabu search metaheuristic to set putaway routes, which is modeled as a problem Traveling Salesman Problem, in order to obtain sequences of m positions of storage j to place n products in the minimum time. The tabu search metaheuristic was implemented in the putaway operation of a Food company in Medellin, allowing the reduction of time and cost of 7%, what amounts to a cost savings of $750,000 a month and 383 minutes a month compared to a Farthest Location-Closest Location routing strategy, currently being used by the Food company, which allows to increase the efficiency of the operation and Distribution Center.