基于遗传算法的多车多库取货优化中新仓库位置的插入问题

2015 International Conference on Industrial Engineering and Systems Management (IESM) Pub Date : 2015-10-01 DOI:10.1109/IESM.2015.7380234

E. Ben Alaia, I. Dridi, H. Bouchriha, P. Borne

{"title":"基于遗传算法的多车多库取货优化中新仓库位置的插入问题","authors":"E. Ben Alaia, I. Dridi, H. Bouchriha, P. Borne","doi":"10.1109/IESM.2015.7380234","DOIUrl":null,"url":null,"abstract":"The Pickup and Delivery Problems (PDP) represent an important class of Vehicle Routing Problems (VRP) in which goods must be collected and distributed. In this paper, we propose an approach which is based on the combination of Genetic Algorithm (GA) with the clustering algorithm for the optimization of multi-vehicles, multi-depots, pickup and delivery problem (m-MDPDP). The main contribution is to find new depot locations in order to obtain feasible solution (routes) for the m-MDPDPTW. These routes satisfy transportation requests without contravening any of the instance specific constraints.","PeriodicalId":308675,"journal":{"name":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Insertion of new depot locations for the optimization of multi-vehicles multi-depots pickup and Delivery Problems using Genetic Algorithm\",\"authors\":\"E. Ben Alaia, I. Dridi, H. Bouchriha, P. Borne\",\"doi\":\"10.1109/IESM.2015.7380234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Pickup and Delivery Problems (PDP) represent an important class of Vehicle Routing Problems (VRP) in which goods must be collected and distributed. In this paper, we propose an approach which is based on the combination of Genetic Algorithm (GA) with the clustering algorithm for the optimization of multi-vehicles, multi-depots, pickup and delivery problem (m-MDPDP). The main contribution is to find new depot locations in order to obtain feasible solution (routes) for the m-MDPDPTW. These routes satisfy transportation requests without contravening any of the instance specific constraints.\",\"PeriodicalId\":308675,\"journal\":{\"name\":\"2015 International Conference on Industrial Engineering and Systems Management (IESM)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Industrial Engineering and Systems Management (IESM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IESM.2015.7380234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Industrial Engineering and Systems Management (IESM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IESM.2015.7380234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

拾取和交付问题(PDP)代表了一类重要的车辆路径问题(VRP)，其中货物必须被收集和分发。本文提出了一种基于遗传算法(GA)和聚类算法相结合的多车多库取货问题(m-MDPDP)优化方法。其主要贡献是为m-MDPDPTW找到新的车厂位置，从而获得可行的解决方案(路线)。这些路由满足传输请求，而不违反任何特定于实例的约束。

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

查看原文本刊更多论文

Insertion of new depot locations for the optimization of multi-vehicles multi-depots pickup and Delivery Problems using Genetic Algorithm

The Pickup and Delivery Problems (PDP) represent an important class of Vehicle Routing Problems (VRP) in which goods must be collected and distributed. In this paper, we propose an approach which is based on the combination of Genetic Algorithm (GA) with the clustering algorithm for the optimization of multi-vehicles, multi-depots, pickup and delivery problem (m-MDPDP). The main contribution is to find new depot locations in order to obtain feasible solution (routes) for the m-MDPDPTW. These routes satisfy transportation requests without contravening any of the instance specific constraints.

求助全文

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

来源期刊

2015 International Conference on Industrial Engineering and Systems Management (IESM)

自引率

0.00%

发文量