带时间窗异构车队路径问题的变邻域禁忌搜索算法

2010 International Conference on Logistics Engineering and Intelligent Transportation Systems Pub Date : 2010-12-10 DOI:10.1109/LEITS.2010.5665040

W. Luo, Z. Fu

{"title":"带时间窗异构车队路径问题的变邻域禁忌搜索算法","authors":"W. Luo, Z. Fu","doi":"10.1109/LEITS.2010.5665040","DOIUrl":null,"url":null,"abstract":"The heterogeneous fleet vehicle routing problem with time windows is a variant of the classical vehicle routing problem. This paper defines a mathematical model of this problem and proposes a variable neighborhood tabu search algorithm to solve it. The initial solution is obtained by GENIUS and the giant tour algorithm. Our algorithm employs a variable neighborhood mechanism to search the optimal solution based upon four neighborhoods. In addition, the local search results are improved by the tabu search algorithm. The proposed algorithm appears to be effective when tested on benchmark instances from the literature.","PeriodicalId":173716,"journal":{"name":"2010 International Conference on Logistics Engineering and Intelligent Transportation Systems","volume":"374 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Variable Neighborhood Tabu Search Algorithm for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows\",\"authors\":\"W. Luo, Z. Fu\",\"doi\":\"10.1109/LEITS.2010.5665040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The heterogeneous fleet vehicle routing problem with time windows is a variant of the classical vehicle routing problem. This paper defines a mathematical model of this problem and proposes a variable neighborhood tabu search algorithm to solve it. The initial solution is obtained by GENIUS and the giant tour algorithm. Our algorithm employs a variable neighborhood mechanism to search the optimal solution based upon four neighborhoods. In addition, the local search results are improved by the tabu search algorithm. The proposed algorithm appears to be effective when tested on benchmark instances from the literature.\",\"PeriodicalId\":173716,\"journal\":{\"name\":\"2010 International Conference on Logistics Engineering and Intelligent Transportation Systems\",\"volume\":\"374 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Logistics Engineering and Intelligent Transportation Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LEITS.2010.5665040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Logistics Engineering and Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LEITS.2010.5665040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

带时间窗的异构车队路径问题是经典车辆路径问题的一种变体。本文定义了该问题的数学模型，并提出了一种可变邻域禁忌搜索算法来求解该问题。通过GENIUS和巨游算法得到了初始解。我们的算法采用可变邻域机制，在四个邻域的基础上搜索最优解。此外，采用禁忌搜索算法对局部搜索结果进行了改进。在文献中的基准实例上进行测试后，所提出的算法似乎是有效的。

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

查看原文本刊更多论文

A Variable Neighborhood Tabu Search Algorithm for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows

The heterogeneous fleet vehicle routing problem with time windows is a variant of the classical vehicle routing problem. This paper defines a mathematical model of this problem and proposes a variable neighborhood tabu search algorithm to solve it. The initial solution is obtained by GENIUS and the giant tour algorithm. Our algorithm employs a variable neighborhood mechanism to search the optimal solution based upon four neighborhoods. In addition, the local search results are improved by the tabu search algorithm. The proposed algorithm appears to be effective when tested on benchmark instances from the literature.

求助全文

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

来源期刊

2010 International Conference on Logistics Engineering and Intelligent Transportation Systems

自引率

0.00%

发文量