Finding Interactions or Relationships Between Customer Orders for Building Better Batches by Means of an Estimation of Distribution Algorithm-based approach for the Online Order Batching Problem
被引:0
|
作者:
Perez-Rodriguez, Ricardo
论文数: 0引用数: 0
h-index: 0
机构:
CIMAT AC, Callejon de Jalisco S-N, Guanajuato, Guanajuato, MexicoCIMAT AC, Callejon de Jalisco S-N, Guanajuato, Guanajuato, Mexico
Perez-Rodriguez, Ricardo
[1
]
Hernandez-Aguirre, Arturo
论文数: 0引用数: 0
h-index: 0
机构:
CIMAT AC, Callejon de Jalisco S-N, Guanajuato, Guanajuato, MexicoCIMAT AC, Callejon de Jalisco S-N, Guanajuato, Guanajuato, Mexico
Hernandez-Aguirre, Arturo
[1
]
机构:
[1] CIMAT AC, Callejon de Jalisco S-N, Guanajuato, Guanajuato, Mexico
Routing and layout;
Time-tabling and scheduling;
Metaheuristics;
Heuristics;
Combinatorial optimization;
TRAVEL DISTANCE ESTIMATION;
PICKING SYSTEM;
WAREHOUSE;
OPTIMIZATION;
DESIGN;
D O I:
10.1145/2908812.290894410
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
Order-picking systems are very common in industry. In this warehouse environment an order batching consists of combining customer orders into picking orders. Order batching is a combinatorial issue because many customer orders arrive throughout the scheduling in real-world situations, therefore to find interactions or relationships between orders for building better batches is a difficult task. This paper introduces an estimation of distribution algorithm-based approach for the online order batching problem to guide the overall search process. The results show how the warehouse performance is improved by estimating relationships between orders. This approach is compared with others published in the literature.