An Improved Firefly Algorithm for the Vehicle Routing Problem with Time Windows

Divyam Aggarwal, Vijay Kumar
{"title":"An Improved Firefly Algorithm for the Vehicle Routing Problem with Time Windows","authors":"Divyam Aggarwal, Vijay Kumar","doi":"10.1109/ICACCI.2018.8554555","DOIUrl":null,"url":null,"abstract":"Vehicle Routing Problem is renowned distribution problem in supply chain management. Because of its complex nature, it is categorized as non-polynomial deterministic (NP) hard problem. In the past decades, many researchers had applied various optimization techniques to solve the problem. In this paper, modification to a recently developed metaheuristic called Firefly Algorithm for specialization of Vehicle Routing problem called Vehicle Routing Problem with Time Windows (VRPTW) is suggested. The adaptation and implementation of improved Firefly Algorithm to VRPTW is explained and corresponding numerical experiments to justify the adequacy of the strategy are provided. Experimental outcomes demonstrate that the proposed modification procedures are effective and can get near optimal results for the VRPTW.","PeriodicalId":376852,"journal":{"name":"2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","volume":"19 21","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACCI.2018.8554555","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Vehicle Routing Problem is renowned distribution problem in supply chain management. Because of its complex nature, it is categorized as non-polynomial deterministic (NP) hard problem. In the past decades, many researchers had applied various optimization techniques to solve the problem. In this paper, modification to a recently developed metaheuristic called Firefly Algorithm for specialization of Vehicle Routing problem called Vehicle Routing Problem with Time Windows (VRPTW) is suggested. The adaptation and implementation of improved Firefly Algorithm to VRPTW is explained and corresponding numerical experiments to justify the adequacy of the strategy are provided. Experimental outcomes demonstrate that the proposed modification procedures are effective and can get near optimal results for the VRPTW.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带时间窗车辆路径问题的改进萤火虫算法
车辆路径问题是供应链管理中著名的配送问题。由于其复杂性,它被归类为非多项式确定性(NP)难题。在过去的几十年里,许多研究者应用了各种优化技术来解决这个问题。本文对最近发展的一种名为萤火虫算法的元启发式算法进行了改进,以专门化车辆路由问题,即带时间窗的车辆路由问题(VRPTW)。阐述了改进的萤火虫算法对VRPTW的适应和实现,并给出了相应的数值实验来证明该策略的充分性。实验结果表明,所提出的修正方法是有效的,可以获得接近最优的VRPTW结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design of a Tactile Braille Cell Enhancing the Quality of Processes in Healthcare in India An Improved Firefly Algorithm for the Vehicle Routing Problem with Time Windows LoRa WanEvaluation for IoT Communications Scheduling Applications of DAGs
×
引用
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