Vehicle Routing Optimization with Cross-Docking Based on an Artificial Immune System in Logistics Management

被引:6
作者
Lo, Shih-Che [1 ]
Chuang, Ying-Lin [1 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106335, Taiwan
关键词
logistics management; artificial immune systems; vehicle routing problem; cross-docking; ALGORITHM;
D O I
10.3390/math11040811
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Background: Manufacturing companies optimize logistics network routing to reduce transportation costs and operational costs in order to make profits in an extremely competitive environment. Therefore, the efficiency of logistics management in the supply chain and the quick response to customers' demands are treated as an additional source of profit. One of the warehouse operations for intelligent logistics network design, called cross-docking (CD) operations, is used to reduce inventory levels and improve responsiveness to meet customers' requirements. Accordingly, the optimization of a vehicle dispatch schedule is imperative in order to produce a routing plan with the minimum transport cost while meeting demand allocation. Methods: This paper developed a two-phase algorithm, called sAIS, to solve the vehicle routing problem (VRP) with the CD facilities and systems in the logistics operations. The sAIS algorithm is based on a clustering-first and routing-later approach. The sweep method is used to cluster trucks as the initial solution for the second phase: optimizing routing by the Artificial Immune System. Results: In order to examine the performance of the proposed sAIS approach, we compared the proposed model with the Genetic Algorithm (GA) on the VRP with pickup and delivery benchmark problems, showing average improvements of 7.26%. Conclusions: In this study, we proposed a novel sAIS algorithm for solving VRP with CD problems by simulating human body immune reactions. The experimental results showed that the proposed sAIS algorithm is robustly competitive with the GA on the criterion of average solution quality as measured by the two-sample t-test.
引用
收藏
页数:19
相关论文
共 50 条
[1]   Ontology Support for Vehicle Routing Problem [J].
Agardi, Anita ;
Kovacs, Laszlo ;
Banyai, Tamas .
APPLIED SCIENCES-BASEL, 2022, 12 (23)
[2]   A cross-docking scheduling problem with sub-population multi-objective algorithms [J].
Arabani, A. Boloori ;
Zandieh, M. ;
Ghomi, S. M. T. Fatemi .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 58 (5-8) :741-761
[3]   Multi-objective genetic-based algorithms for a cross-docking scheduling problem [J].
Arabani, A. Boloori ;
Zandieh, M. ;
Ghomi, S. M. T. Fatemi .
APPLIED SOFT COMPUTING, 2011, 11 (08) :4954-4970
[4]   Meta-heuristics implementation for scheduling of trucks in a cross-docking system with temporary storage [J].
Arabani, A. R. Boloori ;
Ghomi, S. M. T. Fatemi ;
Zandieh, M. .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (03) :1964-1979
[5]  
Astachova I. F., 2019, Journal of Physics: Conference Series, V1203, DOI 10.1088/1742-6596/1203/1/012036
[6]   A genetic algorithm for the vehicle routing problem [J].
Baker, BM ;
Ayechew, MA .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :787-800
[7]   Ant colony optimization techniques for the vehicle routing problem [J].
Bell, JE ;
McMullen, PR .
ADVANCED ENGINEERING INFORMATICS, 2004, 18 (01) :41-48
[8]   Kernel Search for the Capacitated Vehicle Routing Problem [J].
Borcinova, Zuzana .
APPLIED SCIENCES-BASEL, 2022, 12 (22)
[9]   An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem [J].
Chung, Tsui-Ping ;
Liao, Ching-Jong .
APPLIED SOFT COMPUTING, 2013, 13 (08) :3729-3736
[10]  
Cutello V, 2002, LECT NOTES ARTIF INT, V2527, P361