An Ant Colony algorithm hybridized with insertion heuristics for the.pdfVIP

下载本文档

6
0
约7.04万字
约 13页
2017-04-06 发布于江苏
举报
版权申诉

An Ant Colony algorithm hybridized with insertion heuristics for the.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

An Ant Colony algorithm hybridized with insertion heuristics for the

Computers Operations Research 38 (2011) 954–966Contents lists available at ScienceDirectComputers Operations Research0305-05 doi:10.1 Corr E-m irene@d 1 Th Buenosjournal homepage: /locate/caorAn Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time WindowsS.R. Balseiro a,,1, I. Loiseau b, J. Ramonet c a Graduate School of Business, Columbia University, USA b Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina c Facultad de Ingenieria, Universidad de Buenos Aires, Argentinaa r t i c l e i n f o Available online 17 October 2010 Keywords: Ant Colony System Insertion heuristics Minimum delay Time-dependent Vehicle Routing Problem with Time Windows48/$ - see front matter 2010 Elsevier Ltd. A 016/j.cor.2010.10.011 esponding author. Tel.: +1 646 460 1264; fax ail addresses: sbalseiro@, srb2155@ c.uba.ar (I. Loiseau), juan_ramonet@yahoo.co is work was developed while the author was a Aires.a b s t r a c t This paper presents an Ant Colony System algorithm hybridized with insertion heuristics for the Time- Dependent Vehicle Routing Problemwith TimeWindows (TDVRPTW). In the TDVRPTW a fleet of vehicles must deliver goods to a set of customers, timewindowconstraints of the customersmust be respected and the fact that the travel time between two points depends on the time of departure has to be taken into account. The latter assumption is particularly important in an urban context where the traffic plays a significant role. A shortcoming of Ant Colony algorithms for capacitated routing problems is that, at the final stages of the algorithm, ants tend to create infeasible solutions with unrouted clients. Hence, we propose enhancing the algorithm with an aggressive insertion heuristic relying on the minimum delay metric. Computational results confirm the benefits of more involved insertion heuristics. Moreover, the resulting algorithm turns out to be competitive, matching or improving t