Dynamic vehicle routing problem using hybrid ant system

Yan Tian, Jingyan Song, D. Yao, Jianming Hu
{"title":"Dynamic vehicle routing problem using hybrid ant system","authors":"Yan Tian, Jingyan Song, D. Yao, Jianming Hu","doi":"10.1109/ITSC.2003.1252630","DOIUrl":null,"url":null,"abstract":"The dynamic vehicle routing problem, DVRP, consists in optimally routing a fleet occur at random. The optimization consists in finding the solution that minimizes the total length of tours and satisfying the customer delivery time window. In this paper, we present a hybrid ant system to handle the dynamism by means of modifying the pheromone matrix and candidate sets strategy. In addition, we make further improvements on vehicle routes with the local search heuristics. The results show that the hybrid ant system works effectively to find competitive solutions.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"255 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2003.1252630","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

The dynamic vehicle routing problem, DVRP, consists in optimally routing a fleet occur at random. The optimization consists in finding the solution that minimizes the total length of tours and satisfying the customer delivery time window. In this paper, we present a hybrid ant system to handle the dynamism by means of modifying the pheromone matrix and candidate sets strategy. In addition, we make further improvements on vehicle routes with the local search heuristics. The results show that the hybrid ant system works effectively to find competitive solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于混合蚁群系统的动态车辆路径问题
动态车辆路径问题(DVRP)是指随机出现的车辆的最优路径问题。优化包括找到最小化总行程长度和满足客户交付时间窗口的解决方案。本文通过修改信息素矩阵和候选集策略,提出了一种混合蚂蚁系统来处理动态问题。此外,我们还利用局部搜索启发式对车辆路线进行了进一步改进。结果表明,混合蚁群系统能够有效地寻找竞争解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Study on ship manoeuvering control based on adaptive inverse control technology Formal design and analysis of FMS controller The application of spatial data mining in railway geographic information systems Dynamic vehicle routing problem using hybrid ant system Dynamic link travel time model in dynamic traffic assignment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1