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...
Saved in:
Published in | Revista Soluciones de Postgrado EIA no. 12; p. 15 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | Spanish |
Published |
Envigado
Escuela de Ingeniería de Antioquia, Sede de Las Palmas
01.01.2014
|
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!