中文版 | English
题名

Variable-depth adaptive large neighbourhood search algorithm for open periodic vehicle routing problem with time windows

作者
发表日期
2017
会议录名称
页码
25-34
会议地点
Barcelona, Spain
出版者
摘要
The Open Periodic Vehicle Routing Problem with Time Windows (OPVRPTW) is a practical transportation routing and scheduling problem arising from real-world scenarios. It shares some common features with some classic VRP variants. The problem has a tightly constrained large-scale solution space and requires wellbalanced diversification and intensification in search. In Variable Depth Neighbourhood Search, large neighbourhood depth prevents the search from trapping into local optima prematurely, while small depth provides thorough exploitation in local areas. Considering the multi-dimensional solution structure and tight constraints in OPVRPTW, a Variable-Depth Adaptive Large Neighbourhood Search (VD-ALNS) algorithm is proposed in this paper. Contributions of four tailored destroy operators and three repair operators at variable depths are investigated. Comparing to existing methods, VD-ALNS makes a good trade-off between exploration and exploitation, and produces promising results on both small and large size benchmark instances.
学校署名
其他
收录类别
资助项目
University of Nottingham[] ; Ningbo Municipal Bureau of Science and Technology[2014A35006] ; National Graduate School in Computer Science[]
EI入藏号
20174804471647
EI主题词
Benchmarking ; Economic and social effects ; Electronic trading ; Routing algorithms ; Vehicles
EI分类号
Computer Software, Data Handling and Applications:723 ; Computer Applications:723.5 ; Social Sciences:971
来源库
EV Compendex
成果类型会议论文
条目标识符http://sustech.caswiz.com/handle/2SGJ60CL/50997
专题工学院_计算机科学与工程系
作者单位
1.School of Computer Science, University of Nottingham, United Kingdom
2.Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China
3.Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Japan
推荐引用方式
GB/T 7714
Chen, Binhui,Qu, Rong,Ishibuchi, Hisao. Variable-depth adaptive large neighbourhood search algorithm for open periodic vehicle routing problem with time windows[C]:CAL-TEK S.r.l.,2017:25-34.
条目包含的文件
条目无相关文件。
个性服务
原文链接
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
导出为Excel格式
导出为Csv格式
Altmetrics Score
谷歌学术
谷歌学术中相似的文章
[Chen, Binhui]的文章
[Qu, Rong]的文章
[Ishibuchi, Hisao]的文章
百度学术
百度学术中相似的文章
[Chen, Binhui]的文章
[Qu, Rong]的文章
[Ishibuchi, Hisao]的文章
必应学术
必应学术中相似的文章
[Chen, Binhui]的文章
[Qu, Rong]的文章
[Ishibuchi, Hisao]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
[发表评论/异议/意见]
暂无评论

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