{"title":"动态多跳拼车中蚁群与遗传多目标路线规划","authors":"Wesam Herbawi, M. Weber","doi":"10.1109/ICTAI.2011.50","DOIUrl":null,"url":null,"abstract":"The multiobjective route planning problem in dynamic multi-hop ridesharing is considered to be NP-complete. Evolutionary computation has received a growing interest in solving the hard multiobjective optimization problems. In this study we investigate the behavior of different variants of the ant colony based approach for solving the multiobjective route planning problem and compare the performance of the different variants with the performance of a genetic algorithm recommended for solving the problem. Experimentation results indicate that the ant colony approach encounters poor performance in its native form and competes the genetic approach in some of its variants when combined with local search.","PeriodicalId":332661,"journal":{"name":"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Ant Colony vs. Genetic Multiobjective Route Planning in Dynamic Multi-hop Ridesharing\",\"authors\":\"Wesam Herbawi, M. Weber\",\"doi\":\"10.1109/ICTAI.2011.50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The multiobjective route planning problem in dynamic multi-hop ridesharing is considered to be NP-complete. Evolutionary computation has received a growing interest in solving the hard multiobjective optimization problems. In this study we investigate the behavior of different variants of the ant colony based approach for solving the multiobjective route planning problem and compare the performance of the different variants with the performance of a genetic algorithm recommended for solving the problem. Experimentation results indicate that the ant colony approach encounters poor performance in its native form and competes the genetic approach in some of its variants when combined with local search.\",\"PeriodicalId\":332661,\"journal\":{\"name\":\"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2011.50\",\"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 IEEE 23rd International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2011.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ant Colony vs. Genetic Multiobjective Route Planning in Dynamic Multi-hop Ridesharing
The multiobjective route planning problem in dynamic multi-hop ridesharing is considered to be NP-complete. Evolutionary computation has received a growing interest in solving the hard multiobjective optimization problems. In this study we investigate the behavior of different variants of the ant colony based approach for solving the multiobjective route planning problem and compare the performance of the different variants with the performance of a genetic algorithm recommended for solving the problem. Experimentation results indicate that the ant colony approach encounters poor performance in its native form and competes the genetic approach in some of its variants when combined with local search.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
