SIA OpenIR  > 数字工厂研究室
Model and algorithm for 4PLRP with uncertain delivery time
Huang M(黄敏); Ren, Liang; Lee, Loo Hay; Wang XW(王兴伟); Kuang, Hanbin; Shi HB(史海波)
Department数字工厂研究室
Source PublicationInformation Sciences
ISSN0020-0255
2016
Volume330Pages:211-225
Indexed BySCI ; EI
EI Accession number20155001660915
WOS IDWOS:000367485300013
Contribution Rank3
Funding OrganizationNational Science Foundation for Distinguished Young Scholars of Chinaunder Grantnos. 71325002 and 61225012 ; the National Natural Science Foundation of Chinaunder Grantno. 71071028 ; the Fundamental Re-search Funds for State Key Laboratory of Synthetical Automation for Process Industries under Grantno.2013ZCX11.
KeywordFourth Party Logistics Routing Problem Uncertainty Theory Multi-graph Intelligent Algorithm Shortest Path Problem
AbstractTo 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. © 2015 Elsevier Inc. All rights reserved.
Language英语
Citation statistics
Cited Times:7[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.sia.cn/handle/173321/17545
Collection数字工厂研究室
Corresponding AuthorRen, Liang
Affiliation1.College of Information Science and Engineering, State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, Liaoning, China
2.Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore, Singapore
3.Shenyang Institute of Automation (SIA), Chinese Academy of Sciences, Shenyang, Liaoning, China
Recommended Citation
GB/T 7714
Huang M,Ren, Liang,Lee, Loo Hay,et al. Model and algorithm for 4PLRP with uncertain delivery time[J]. Information Sciences,2016,330:211-225.
APA Huang M,Ren, Liang,Lee, Loo Hay,Wang XW,Kuang, Hanbin,&Shi HB.(2016).Model and algorithm for 4PLRP with uncertain delivery time.Information Sciences,330,211-225.
MLA Huang M,et al."Model and algorithm for 4PLRP with uncertain delivery time".Information Sciences 330(2016):211-225.
Files in This Item: Download All
File Name/Size DocType Version Access License
Model and algorithm (784KB)期刊论文作者接受稿开放获取ODC PDDLView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Huang M(黄敏)]'s Articles
[Ren, Liang]'s Articles
[Lee, Loo Hay]'s Articles
Baidu academic
Similar articles in Baidu academic
[Huang M(黄敏)]'s Articles
[Ren, Liang]'s Articles
[Lee, Loo Hay]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Huang M(黄敏)]'s Articles
[Ren, Liang]'s Articles
[Lee, Loo Hay]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Model and algorithm for 4PLRP with uncertain delivery time.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.