带时间窗的绿色多车场车辆路径问题的改进蚁群优化

Islem Kaabachi, Dorra Jriji, S. Krichen
{"title":"带时间窗的绿色多车场车辆路径问题的改进蚁群优化","authors":"Islem Kaabachi, Dorra Jriji, S. Krichen","doi":"10.1109/SNPD.2017.8022743","DOIUrl":null,"url":null,"abstract":"We investigate in this paper a new variant of multi-depot vehicle routing problem with time windows is studied (GMDVRPTW), an extension of the MDVRPTW. In the new variant, the proposed GMDVRPTW consists of determining the vehicle's speed in order to minimize a function comprising fuel consumption and resulting emission costs. An integer programming model is formulated with two objectives to find the minimum travel cost and total fuel consumption and CO2 emissions under the constrains of time window, capacity of the vehicle, the fleet size. As the problem is an NP-Hard problem, we develop an improved meta-heuristic, based on an ant colony optimization and local search to solve the problem. The results show that the proposed approach is competitive in terms of solution quality.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An improved ant colony optimization for green multi-depot vehicle routing problem with time windows\",\"authors\":\"Islem Kaabachi, Dorra Jriji, S. Krichen\",\"doi\":\"10.1109/SNPD.2017.8022743\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate in this paper a new variant of multi-depot vehicle routing problem with time windows is studied (GMDVRPTW), an extension of the MDVRPTW. In the new variant, the proposed GMDVRPTW consists of determining the vehicle's speed in order to minimize a function comprising fuel consumption and resulting emission costs. An integer programming model is formulated with two objectives to find the minimum travel cost and total fuel consumption and CO2 emissions under the constrains of time window, capacity of the vehicle, the fleet size. As the problem is an NP-Hard problem, we develop an improved meta-heuristic, based on an ant colony optimization and local search to solve the problem. The results show that the proposed approach is competitive in terms of solution quality.\",\"PeriodicalId\":186094,\"journal\":{\"name\":\"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2017.8022743\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2017.8022743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文研究了一种新的带时间窗的多车场车辆路径问题(GMDVRPTW),它是MDVRPTW的扩展。在新版本中,拟议的GMDVRPTW包括确定车辆的速度,以最小化包括燃料消耗和由此产生的排放成本的函数。在时间窗、车辆容量、车队规模约束下,建立了一个具有两个目标的整数规划模型,求解出行成本和总油耗、CO2排放量的最小值。由于该问题是一个NP-Hard问题,我们开发了一种改进的元启发式算法,基于蚁群优化和局部搜索来解决问题。结果表明,该方法在求解质量方面具有一定的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved ant colony optimization for green multi-depot vehicle routing problem with time windows
We investigate in this paper a new variant of multi-depot vehicle routing problem with time windows is studied (GMDVRPTW), an extension of the MDVRPTW. In the new variant, the proposed GMDVRPTW consists of determining the vehicle's speed in order to minimize a function comprising fuel consumption and resulting emission costs. An integer programming model is formulated with two objectives to find the minimum travel cost and total fuel consumption and CO2 emissions under the constrains of time window, capacity of the vehicle, the fleet size. As the problem is an NP-Hard problem, we develop an improved meta-heuristic, based on an ant colony optimization and local search to solve the problem. The results show that the proposed approach is competitive in terms of solution quality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信