Productivity improvement based on a decision support tool for optimization of constrained delivery problem with time windows

被引:3
作者
Abdelsadek, Youcef [1 ]
Kacem, Imed [1 ]
机构
[1] Univ Lorraine, Lab Concept Optimisat & Modelisat Syst LCOMS, EA 7306, Metz, France
关键词
Productivity improvement; Delivery schedule optimization; Decision support tool; Effective algorithm; VEHICLE-ROUTING PROBLEM; INDUSTRY; 4.0; 6; SIGMA; MODEL; INTERNET; SYSTEMS; SERVICE; THINGS;
D O I
10.1016/j.cie.2021.107876
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Nowadays there is more and more competition in the industrial sector. Globalization makes fierce rivalry in the market between the different stakeholders at all levels offering to the customers a wide choice of cheaper products. Therefore, it is crucial to adopt efficient strategies to do the right things better with less resources and more benefit. The choice of the best techniques and methods is important and often tools need to be implemented. The purpose of this work is to introduce how productivity can be improved through delivery schedule optimization based on a decision support tool. This work is driven from an industrial case study. The results show a productivity improvement with a better use of resources up to 10% and effortless logistics management. Moreover, a comparison study is conducted between Genetic Algorithm and Ant Colony Optimization showing that our approach outperforms them in efficiency (approximate to 36% and approximate to 25% respectively) and in computation time.
引用
收藏
页数:11
相关论文
共 50 条
[31]   A mixed integer linear programming model for the vehicle routing problem with simultaneous delivery and pickup by heterogeneous vehicles, and constrained by time windows [J].
Madankumar, Sakthivel ;
Rajendran, Chandrasekharan .
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2019, 44 (02)
[32]   A mixed integer linear programming model for the vehicle routing problem with simultaneous delivery and pickup by heterogeneous vehicles, and constrained by time windows [J].
Sakthivel Madankumar ;
Chandrasekharan Rajendran .
Sādhanā, 2019, 44
[33]   Particle swarm optimization for vehicle routing problem with time windows [J].
Wang, Fang ;
Wu, Qizong .
PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON RISK AND RELIABILITY MANAGEMENT, VOLS I AND II, 2008, :962-966
[34]   An optimization algorithm for a capacitated vehicle routing problem with time windows [J].
Kirci, Pinar .
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2016, 41 (05) :519-529
[35]   An optimization algorithm for a capacitated vehicle routing problem with time windows [J].
Pinar Kirci .
Sādhanā, 2016, 41 :519-529
[36]   A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows [J].
Xu, Sheng-Hua ;
Liu, Ji-Ping ;
Zhang, Fu-Hao ;
Wang, Liang ;
Sun, Li-Jian .
SENSORS, 2015, 15 (09) :21033-21053
[37]   Multi-trip pickup and delivery problem with time windows and synchronization [J].
Phuong Khanh Nguyen ;
Crainic, Teodor Gabriel ;
Toulouse, Michel .
ANNALS OF OPERATIONS RESEARCH, 2017, 253 (02) :899-934
[38]   Improved Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows [J].
Ding, Genhong ;
Mao, Juncheng ;
Ding, Yuchen .
PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND SERVICE SYSTEM (CSSS), 2014, 109 :595-598
[39]   The drone-assisted simultaneous pickup and delivery problem with time windows [J].
Zhang, Xia ;
Zeng, Shuang .
COMPUTERS & OPERATIONS RESEARCH, 2025, 178
[40]   Evaluation of the size of time windows for the travelling salesman problem in delivery operations [J].
Budak, Gercek ;
Chen, Xin .
COMPLEX & INTELLIGENT SYSTEMS, 2020, 6 (03) :681-695