Model and algorithm for 4PLRP with uncertain delivery time

详细信息    查看全文

• 作者：Min Huang^a ; Liang Ren ; ^a ; ^{neurenliang@163.com" class="auth_mail" title="E-mail the corresponding author} ; Loo Hay Lee^b ; Xingwei Wang^a ; Hanbin Kuang^a ; Haibo Shi^c
• 关键词：Fourth party logistics routing problem ; Uncertainty theory ; Multi-graph ; Intelligent algorithm ; Shortest path problem
• 刊名：Information Sciences
• 出版年：2016
• 出版时间：10 February 2016
• 年：2016
• 卷：330
• 期：Complete
• 页码：211-225
• 全文大小：784 K

文摘

To address the challenge of logistics routing decision under uncertain environment, this paper studies a fourth party logistics routing problem (4PLRP) with uncertain delivery time (4PLRPU). A novel 4PLRPU model based on uncertainty theory is proposed by describing the delivery time of a third party logistics (3PL) provider as an uncertain variable. After that, the model is transformed into an equivalent deterministic model, and several improved genetic algorithms are designed to get solutions. To handle the problem of infeasible solutions in the proposed 4PLRPU, an improved node-based genetic algorithm (INGA) and an improved distance-based genetic algorithm (IDGA) are developed to reduce the computing time required to repair infeasible solutions, and an improved genetic algorithm based on the simple graph and Dijkstra algorithm (SDGA) is proposed to avoid the generation of infeasible solutions. Numerical experiments are conducted to investigate the performance of the proposed algorithms and verify the effectiveness of the proposed 4PLRPU model. The results show that INGA and SDGA are more effective than the standard genetic algorithm and IDGA at solving large-scale problems. Additionally, compared with the expected value model, the 4PLRPU model is more robust.