{"title":"多车场车辆路线问题与车场间路线的联合启发式算法","authors":"Tong Zhen, Qiuwen Zhang","doi":"10.1109/JCAI.2009.161","DOIUrl":null,"url":null,"abstract":"The multi-depot vehicle routing problem with inter-depot routes (MDVRPI) is an extension to the classical Vehicle Routing Problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances. The experiment indicates the validity of the technique to MDVRPI with the above-mentioned conditions.","PeriodicalId":373421,"journal":{"name":"IITA International Joint Conference on Artificial Intelligence","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"A Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-depot Routes\",\"authors\":\"Tong Zhen, Qiuwen Zhang\",\"doi\":\"10.1109/JCAI.2009.161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The multi-depot vehicle routing problem with inter-depot routes (MDVRPI) is an extension to the classical Vehicle Routing Problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances. The experiment indicates the validity of the technique to MDVRPI with the above-mentioned conditions.\",\"PeriodicalId\":373421,\"journal\":{\"name\":\"IITA International Joint Conference on Artificial Intelligence\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IITA International Joint Conference on Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCAI.2009.161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IITA International Joint Conference on Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCAI.2009.161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-depot Routes
The multi-depot vehicle routing problem with inter-depot routes (MDVRPI) is an extension to the classical Vehicle Routing Problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances. The experiment indicates the validity of the technique to MDVRPI with the above-mentioned conditions.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
