车辆路径问题的一种新的遗传算法

Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI:10.1109/TAI.1999.809805

Juay Chin Ang, Wee-Kit Ho, A. Lim

{"title":"车辆路径问题的一种新的遗传算法","authors":"Juay Chin Ang, Wee-Kit Ho, A. Lim","doi":"10.1109/TAI.1999.809805","DOIUrl":null,"url":null,"abstract":"This paper focuses on the study of a hybrid of two search heuristics, tabu search (TS) and genetic algorithms (GA) in the vehicle routing problem with time-windows (VRPTW). TS is a local search technique that has been successfully applied to many NP-complete problems. On the other hand, a GA which is capable of searching multiple search areas in a search space is good for diversification. We investigate whether a hybrid of the two heuristics outperforms the individual heuristics.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"A new GA approach for the vehicle routing problem\",\"authors\":\"Juay Chin Ang, Wee-Kit Ho, A. Lim\",\"doi\":\"10.1109/TAI.1999.809805\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses on the study of a hybrid of two search heuristics, tabu search (TS) and genetic algorithms (GA) in the vehicle routing problem with time-windows (VRPTW). TS is a local search technique that has been successfully applied to many NP-complete problems. On the other hand, a GA which is capable of searching multiple search areas in a search space is good for diversification. We investigate whether a hybrid of the two heuristics outperforms the individual heuristics.\",\"PeriodicalId\":194023,\"journal\":{\"name\":\"Proceedings 11th International Conference on Tools with Artificial Intelligence\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 11th International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1999.809805\",\"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 11th International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1999.809805","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

本文主要研究了禁忌搜索和遗传算法两种启发式搜索方法的混合算法在带时间窗车辆路径问题中的应用。TS是一种局部搜索技术，已成功地应用于许多np完全问题。另一方面，能够在一个搜索空间中搜索多个搜索区域的遗传算法有利于多样化。我们研究两种启发式的混合是否优于单个启发式。

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

查看原文本刊更多论文

A new GA approach for the vehicle routing problem

This paper focuses on the study of a hybrid of two search heuristics, tabu search (TS) and genetic algorithms (GA) in the vehicle routing problem with time-windows (VRPTW). TS is a local search technique that has been successfully applied to many NP-complete problems. On the other hand, a GA which is capable of searching multiple search areas in a search space is good for diversification. We investigate whether a hybrid of the two heuristics outperforms the individual heuristics.

求助全文

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

来源期刊

Proceedings 11th International Conference on Tools with Artificial Intelligence

自引率

0.00%

发文量