SIA OpenIR  > 数字工厂研究室
Model and algorithm for 4PLRP with uncertain delivery time
Huang M(黄敏); Ren, Liang; Lee, Loo Hay; Wang XW(王兴伟); Kuang, Hanbin; Shi HB(史海波)
作者部门数字工厂研究室
关键词Fourth Party Logistics Routing Problem Uncertainty Theory Multi-graph Intelligent Algorithm Shortest Path Problem
发表期刊Information Sciences
ISSN0020-0255
2016
卷号330页码:211-225
收录类别SCI ; EI
EI收录号20155001660915
WOS记录号WOS:000367485300013
产权排序3
资助机构National 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.
摘要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. © 2015 Elsevier Inc. All rights reserved.
语种英语
引用统计
文献类型期刊论文
条目标识符http://ir.sia.cn/handle/173321/17545
专题数字工厂研究室
通讯作者Ren, Liang
作者单位1.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
推荐引用方式
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.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Model and algorithm (784KB)期刊论文作者接受稿开放获取ODC PDDL浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Huang M(黄敏)]的文章
[Ren, Liang]的文章
[Lee, Loo Hay]的文章
百度学术
百度学术中相似的文章
[Huang M(黄敏)]的文章
[Ren, Liang]的文章
[Lee, Loo Hay]的文章
必应学术
必应学术中相似的文章
[Huang M(黄敏)]的文章
[Ren, Liang]的文章
[Lee, Loo Hay]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Model and algorithm for 4PLRP with uncertain delivery time.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。