{"title":"求解动态车辆路径问题的人工蚁群性能研究","authors":"Jalel Euchi, A. Yassine, H. Chabchoub","doi":"10.1109/LOGISTIQUA.2011.5939400","DOIUrl":null,"url":null,"abstract":"In this paper we describe an alternative variant dynamic Pickup and Delivery strategy of Vehicle Routing Problem (DVRP) which arises when new customers appear in the tours after starting visit. We propose an Artificial Ant Colony based on 2-Opt local search (AAC-2-Opt) to solve the DVRP. We demonstrate the effectiveness of our approach by comparing its results with those of existing methods in literature on the same tests problems. The proposed algorithm can efficiently optimize the routing problem and provide highly competitive solutions.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"734 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the performance of artificial ant colony to solve the dynamic vehicle routing problem\",\"authors\":\"Jalel Euchi, A. Yassine, H. Chabchoub\",\"doi\":\"10.1109/LOGISTIQUA.2011.5939400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe an alternative variant dynamic Pickup and Delivery strategy of Vehicle Routing Problem (DVRP) which arises when new customers appear in the tours after starting visit. We propose an Artificial Ant Colony based on 2-Opt local search (AAC-2-Opt) to solve the DVRP. We demonstrate the effectiveness of our approach by comparing its results with those of existing methods in literature on the same tests problems. The proposed algorithm can efficiently optimize the routing problem and provide highly competitive solutions.\",\"PeriodicalId\":324478,\"journal\":{\"name\":\"2011 4th International Conference on Logistics\",\"volume\":\"734 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 4th International Conference on Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LOGISTIQUA.2011.5939400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 4th International Conference on Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LOGISTIQUA.2011.5939400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the performance of artificial ant colony to solve the dynamic vehicle routing problem
In this paper we describe an alternative variant dynamic Pickup and Delivery strategy of Vehicle Routing Problem (DVRP) which arises when new customers appear in the tours after starting visit. We propose an Artificial Ant Colony based on 2-Opt local search (AAC-2-Opt) to solve the DVRP. We demonstrate the effectiveness of our approach by comparing its results with those of existing methods in literature on the same tests problems. The proposed algorithm can efficiently optimize the routing problem and provide highly competitive solutions.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
