带时间窗车辆路径问题的改进萤火虫算法

2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI) Pub Date : 2018-09-01 DOI:10.1109/ICACCI.2018.8554555

Divyam Aggarwal, Vijay Kumar

{"title":"带时间窗车辆路径问题的改进萤火虫算法","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":"{\"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}","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

摘要

车辆路径问题是供应链管理中著名的配送问题。由于其复杂性，它被归类为非多项式确定性(NP)难题。在过去的几十年里，许多研究者应用了各种优化技术来解决这个问题。本文对最近发展的一种名为萤火虫算法的元启发式算法进行了改进，以专门化车辆路由问题，即带时间窗的车辆路由问题(VRPTW)。阐述了改进的萤火虫算法对VRPTW的适应和实现，并给出了相应的数值实验来证明该策略的充分性。实验结果表明，所提出的修正方法是有效的，可以获得接近最优的VRPTW结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)

自引率

0.00%

发文量