有容位置路由问题的可变邻域搜索

2011 4th International Conference on Logistics Pub Date : 2011-07-05 DOI:10.1109/LOGISTIQUA.2011.5939452

H. Derbel, B. Jarboui, H. Chabchoub, S. Hanafi, N. Mladenović

{"title":"有容位置路由问题的可变邻域搜索","authors":"H. Derbel, B. Jarboui, H. Chabchoub, S. Hanafi, N. Mladenović","doi":"10.1109/LOGISTIQUA.2011.5939452","DOIUrl":null,"url":null,"abstract":"In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"A variable neighborhood search for the capacitated location-routing problem\",\"authors\":\"H. Derbel, B. Jarboui, H. Chabchoub, S. Hanafi, N. Mladenović\",\"doi\":\"10.1109/LOGISTIQUA.2011.5939452\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.\",\"PeriodicalId\":324478,\"journal\":{\"name\":\"2011 4th International Conference on Logistics\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 4th International Conference on Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LOGISTIQUA.2011.5939452\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 4th International Conference on Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LOGISTIQUA.2011.5939452","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

在此工作中，我们提出了一个可变邻域搜索来解决一个有容量仓库和有容量同构车队的有容量位置路由问题，以最小化位置和路由成本。为此，我们提出了基本元素，并利用可变邻域下降作为局部搜索实现了可变邻域搜索算法。我们在大量实例上测试了我们的启发式方法，并将结果与文献进行了比较。

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

查看原文本刊更多论文

A variable neighborhood search for the capacitated location-routing problem

In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.

求助全文

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

来源期刊

2011 4th International Conference on Logistics

自引率

0.00%

发文量