{"title":"用并行微遗传算法求解有能力车辆路径问题","authors":"Zuzana Borčinová","doi":"10.1109/CompEng.2018.8536230","DOIUrl":null,"url":null,"abstract":"The Capacitated Vehicle Routing Problem (CVRP) is a very extensively studied combinatorial optimization problem that aimes to determine the order in which to visit a set of customers using a homogeneous fleet of vehicles based at a single depot so that the total travel cost is minimized. In this paper, a novel coarse-grained parallel micro genetic algorithm is used for solving CVRP while the conventional migration is replaced by a synchronously seeding the overall best solution to all search processes. The computational experiments examined the behaviour of the proposed approach.","PeriodicalId":194279,"journal":{"name":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Solving the Capacitated Vehicle Routing Problem Using a Parallel Micro Genetic Algorithm\",\"authors\":\"Zuzana Borčinová\",\"doi\":\"10.1109/CompEng.2018.8536230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Capacitated Vehicle Routing Problem (CVRP) is a very extensively studied combinatorial optimization problem that aimes to determine the order in which to visit a set of customers using a homogeneous fleet of vehicles based at a single depot so that the total travel cost is minimized. In this paper, a novel coarse-grained parallel micro genetic algorithm is used for solving CVRP while the conventional migration is replaced by a synchronously seeding the overall best solution to all search processes. The computational experiments examined the behaviour of the proposed approach.\",\"PeriodicalId\":194279,\"journal\":{\"name\":\"2018 IEEE Workshop on Complexity in Engineering (COMPENG)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Workshop on Complexity in Engineering (COMPENG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CompEng.2018.8536230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Workshop on Complexity in Engineering (COMPENG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CompEng.2018.8536230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving the Capacitated Vehicle Routing Problem Using a Parallel Micro Genetic Algorithm
The Capacitated Vehicle Routing Problem (CVRP) is a very extensively studied combinatorial optimization problem that aimes to determine the order in which to visit a set of customers using a homogeneous fleet of vehicles based at a single depot so that the total travel cost is minimized. In this paper, a novel coarse-grained parallel micro genetic algorithm is used for solving CVRP while the conventional migration is replaced by a synchronously seeding the overall best solution to all search processes. The computational experiments examined the behaviour of the proposed approach.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
