带时间窗车辆路径问题的演化调度图

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI:10.1109/CEC.2000.870734

H. Ozdemir, C. Mohan

{"title":"带时间窗车辆路径问题的演化调度图","authors":"H. Ozdemir, C. Mohan","doi":"10.1109/CEC.2000.870734","DOIUrl":null,"url":null,"abstract":"The vehicle routing problem with time windows (VRPTW) is a very important problem in the transportation industry since it occurs frequently in everyday practice, e.g. in scheduling bank deliveries. Many heuristic algorithms have been proposed for this NP-hard problem. This paper reports the successful application of GrEVeRT (Graph-based Evolutionary algorithm for the Vehicle Routing Problem with Time windows), an evolutionary algorithm based on a directed acyclic graph model. On well-known benchmark instances of the VRPTW, we obtain better results than those reported by other researchers using genetic algorithms.","PeriodicalId":218136,"journal":{"name":"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Evolving schedule graphs for the vehicle routing problem with time windows\",\"authors\":\"H. Ozdemir, C. Mohan\",\"doi\":\"10.1109/CEC.2000.870734\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The vehicle routing problem with time windows (VRPTW) is a very important problem in the transportation industry since it occurs frequently in everyday practice, e.g. in scheduling bank deliveries. Many heuristic algorithms have been proposed for this NP-hard problem. This paper reports the successful application of GrEVeRT (Graph-based Evolutionary algorithm for the Vehicle Routing Problem with Time windows), an evolutionary algorithm based on a directed acyclic graph model. On well-known benchmark instances of the VRPTW, we obtain better results than those reported by other researchers using genetic algorithms.\",\"PeriodicalId\":218136,\"journal\":{\"name\":\"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2000.870734\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2000.870734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

带时间窗的车辆路径问题(VRPTW)是交通运输行业中一个非常重要的问题，因为它在日常实践中经常发生，例如安排银行交货。针对这个np困难问题，已经提出了许多启发式算法。本文报道了基于有向无环图模型的进化算法GrEVeRT (graph -based evolution algorithm for the Vehicle Routing Problem with Time window)的成功应用。在已知的VRPTW基准实例上，我们获得了比其他研究人员使用遗传算法报道的更好的结果。

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

查看原文本刊更多论文

Evolving schedule graphs for the vehicle routing problem with time windows

The vehicle routing problem with time windows (VRPTW) is a very important problem in the transportation industry since it occurs frequently in everyday practice, e.g. in scheduling bank deliveries. Many heuristic algorithms have been proposed for this NP-hard problem. This paper reports the successful application of GrEVeRT (Graph-based Evolutionary algorithm for the Vehicle Routing Problem with Time windows), an evolutionary algorithm based on a directed acyclic graph model. On well-known benchmark instances of the VRPTW, we obtain better results than those reported by other researchers using genetic algorithms.

求助全文

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

来源期刊

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)

自引率

0.00%

发文量