基于遗传算法的多行程车辆路径问题求解

Proceedings of the 3rd International Conference on Machine Learning and Soft Computing Pub Date : 2019-01-25 DOI:10.1145/3310986.3311031

Saâdia Khoukhi, Othmane El Yaakoubi, Chakib Bojji, Y. Bensouda

{"title":"基于遗传算法的多行程车辆路径问题求解","authors":"Saâdia Khoukhi, Othmane El Yaakoubi, Chakib Bojji, Y. Bensouda","doi":"10.1145/3310986.3311031","DOIUrl":null,"url":null,"abstract":"This paper addresses the multi-trip vehicle routing problem with time windows and simultaneous pick and delivery, in which a set of hospitals have to be visited by a fleet of homogeneous vehicles. The objective is to minimize the total cost that includes the traveling cost and the fixed cost of using vehicles, without violating temporal and capacity constraints. As for the solving approach, a genetic algorithm based on route-first cluster-second approach and splitting procedure is introduced. Then crossover and mutation operations are deployed to ensure the exploration and the diversity of the population. The proposed approach is tested on a set of instances from the literature.","PeriodicalId":252781,"journal":{"name":"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A genetic algorithm for solving a multi-trip vehicle routing problem with time windows and simultaneous pick-up and delivery in a hospital complex\",\"authors\":\"Saâdia Khoukhi, Othmane El Yaakoubi, Chakib Bojji, Y. Bensouda\",\"doi\":\"10.1145/3310986.3311031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the multi-trip vehicle routing problem with time windows and simultaneous pick and delivery, in which a set of hospitals have to be visited by a fleet of homogeneous vehicles. The objective is to minimize the total cost that includes the traveling cost and the fixed cost of using vehicles, without violating temporal and capacity constraints. As for the solving approach, a genetic algorithm based on route-first cluster-second approach and splitting procedure is introduced. Then crossover and mutation operations are deployed to ensure the exploration and the diversity of the population. The proposed approach is tested on a set of instances from the literature.\",\"PeriodicalId\":252781,\"journal\":{\"name\":\"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd International Conference on Machine Learning and Soft Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3310986.3311031\",\"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 of the 3rd International Conference on Machine Learning and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3310986.3311031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文研究了具有时间窗口和同时取货的多行程车辆路径问题，其中一组医院必须由同质车队访问。目标是在不违反时间和容量限制的情况下，使包括旅行成本和使用车辆的固定成本在内的总成本最小化。在求解方法上，提出了一种基于路由优先聚类第二方法和分割过程的遗传算法。然后进行交叉和变异操作，保证种群的探索性和多样性。在文献中的一组实例上对所提出的方法进行了测试。

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

查看原文本刊更多论文

A genetic algorithm for solving a multi-trip vehicle routing problem with time windows and simultaneous pick-up and delivery in a hospital complex

This paper addresses the multi-trip vehicle routing problem with time windows and simultaneous pick and delivery, in which a set of hospitals have to be visited by a fleet of homogeneous vehicles. The objective is to minimize the total cost that includes the traveling cost and the fixed cost of using vehicles, without violating temporal and capacity constraints. As for the solving approach, a genetic algorithm based on route-first cluster-second approach and splitting procedure is introduced. Then crossover and mutation operations are deployed to ensure the exploration and the diversity of the population. The proposed approach is tested on a set of instances from the literature.

求助全文

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

来源期刊

Proceedings of the 3rd International Conference on Machine Learning and Soft Computing

自引率

0.00%

发文量