A Heuristic Approach to the Design of Optimal Cross-Docking Boxes

被引:0
作者
Nieuwenhuis, Robert [1 ]
Oliveras, Albert [1 ]
Rodriguez-Carbonell, Enric [1 ]
机构
[1] Tech Univ Catalonia, Comp Sci Dept, Barcelona 08034, Spain
关键词
Logistics; Search problems; Industries; Companies; Simulated annealing; Shape; Routing; Artificial intelligence; combinatorial optimization; heuristic algorithms; logistics; NETWORK; OPTIMIZATION; LOGISTICS;
D O I
10.1109/ACCESS.2021.3109976
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multinational companies frequently work with manufacturers that receive large orders for different products (or product varieties: size, shape, color, texture, material), to serve thousands of different final destinations (e.g., shops) requesting a combination of different quantities of each product. It is not the manufacturers' task to create the individual shipments for each final destination. But manufacturers can deliver part of their production in so-called cross-docking boxes (or other containers) of a few+ (say, three) types, each type containing a given assortment, i.e., different quantities of different products. At a logistics center, the shipments for each destination are then made of cross-docking boxes plus additional "picking" units. The expensive part is the picking, since cross-docking boxes require little or no manipulation. The problem we solve in this paper is, given a large set of orders for each destination, to design the cross-docking box types in order to minimize picking. We formally define a variant of this problem and develop a heuristic method to solve it. Finally, we present extensive experimental results on a large set of real-world benchmarks proving that our approach gives high-quality solutions (optimal or near optimal) in a very limited amount of time.
引用
收藏
页码:122578 / 122588
页数:11
相关论文
共 33 条
[1]  
Agustina D, 2010, INT J ENG BUS MANAG, V2, P47
[2]  
[Anonymous], 1987, THEORY LINEAR INTEGE
[3]   Designing an integrated multi-echelon agile supply chain network: a hybrid taguchi-particle swarm optimization approach [J].
Bachlaus, Manish ;
Pandey, Mayank Kumar ;
Mahajan, Chetan ;
Shankar, Ravi ;
Tiwari, M. K. .
JOURNAL OF INTELLIGENT MANUFACTURING, 2008, 19 (06) :747-761
[4]  
Barrett Clark, 2011, Computer Aided Verification. Proceedings 23rd International Conference, CAV 2011, P171, DOI 10.1007/978-3-642-22110-1_14
[5]   Satisfiability modulo theories [J].
Barrett, Clark ;
Sebastiani, Roberto ;
Seshia, Sanjit A. ;
Tinelli, Cesare .
Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) :825-885
[6]   Bounded model checking [J].
Biere, Armin .
Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) :457-481
[7]  
Bofill M, 2008, LECT NOTES COMPUT SC, V5123, P294
[8]   Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers [J].
Borralleras, Cristina ;
Larraz, Daniel ;
Rodriguez-Carbonell, Enric ;
Oliveras, Albert ;
Rubio, Albert .
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2019, 20 (04)
[9]   Minimizing the makespan in a two-machine cross-docking flow shop problem [J].
Chen, Feng ;
Lee, Chung-Yee .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 193 (01) :59-72
[10]  
Cimatti A, 2013, LECT NOTES COMPUT SC, V7795, P93