具有不确定出行费用的有能力车辆路径问题的蚁群系统

N. E. Toklu, R. Montemanni, L. Gambardella
{"title":"具有不确定出行费用的有能力车辆路径问题的蚁群系统","authors":"N. E. Toklu, R. Montemanni, L. Gambardella","doi":"10.1109/SIS.2013.6615156","DOIUrl":null,"url":null,"abstract":"In this study, we consider a capacitated vehicle routing problem where the objective function is to minimize the total travel cost.We also consider that the travel costs between the locations are subject to uncertainty, therefore they are expressed as intervals, rather than fixed numbers. The motivation of this study is to solve this problem by using a metaheuristic approach. We base our approach on a variant of ant colony optimization metaheuristic, called ant colony system, which was originally implemented for solving the deterministic version of the problem (i.e. the classical version of the problem without the uncertainty), previously reported in the literature. We modify the algorithm to incorporate a robust optimization methodology, so that the uncertainty on traveling costs can be handled.","PeriodicalId":444765,"journal":{"name":"2013 IEEE Symposium on Swarm Intelligence (SIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"An ant colony system for the capacitated vehicle routing problem with uncertain travel costs\",\"authors\":\"N. E. Toklu, R. Montemanni, L. Gambardella\",\"doi\":\"10.1109/SIS.2013.6615156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, we consider a capacitated vehicle routing problem where the objective function is to minimize the total travel cost.We also consider that the travel costs between the locations are subject to uncertainty, therefore they are expressed as intervals, rather than fixed numbers. The motivation of this study is to solve this problem by using a metaheuristic approach. We base our approach on a variant of ant colony optimization metaheuristic, called ant colony system, which was originally implemented for solving the deterministic version of the problem (i.e. the classical version of the problem without the uncertainty), previously reported in the literature. We modify the algorithm to incorporate a robust optimization methodology, so that the uncertainty on traveling costs can be handled.\",\"PeriodicalId\":444765,\"journal\":{\"name\":\"2013 IEEE Symposium on Swarm Intelligence (SIS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Symposium on Swarm Intelligence (SIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIS.2013.6615156\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Symposium on Swarm Intelligence (SIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIS.2013.6615156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

摘要

在本研究中,我们考虑一个有能力的车辆路线问题,其目标函数是最小化总旅行成本。我们还考虑到地点之间的旅行成本受到不确定性的影响,因此它们被表示为间隔,而不是固定的数字。本研究的动机是利用元启发式方法来解决这个问题。我们的方法基于蚁群优化元启发式的一种变体,称为蚁群系统,它最初是为了解决问题的确定性版本(即没有不确定性的问题的经典版本)而实现的,之前在文献中有报道。我们修改了算法,加入了一个鲁棒的优化方法,使旅行成本的不确定性可以处理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An ant colony system for the capacitated vehicle routing problem with uncertain travel costs
In this study, we consider a capacitated vehicle routing problem where the objective function is to minimize the total travel cost.We also consider that the travel costs between the locations are subject to uncertainty, therefore they are expressed as intervals, rather than fixed numbers. The motivation of this study is to solve this problem by using a metaheuristic approach. We base our approach on a variant of ant colony optimization metaheuristic, called ant colony system, which was originally implemented for solving the deterministic version of the problem (i.e. the classical version of the problem without the uncertainty), previously reported in the literature. We modify the algorithm to incorporate a robust optimization methodology, so that the uncertainty on traveling costs can be handled.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信