Carl Michael Boukhater, Oussama Dakroub, Fayez Lahoud, M. Awad, H. Artail
{"title":"一种智能公平的GA拼车调度程序,为绿色交通提供社会解决方案","authors":"Carl Michael Boukhater, Oussama Dakroub, Fayez Lahoud, M. Awad, H. Artail","doi":"10.1109/MELCON.2014.6820528","DOIUrl":null,"url":null,"abstract":"Although many carpooling systems have been proposed, most of them lack various levels of automation, functionality, practicality, and solution quality. While Genetic Algorithms (GAs) have been successfully adopted for solving combinatorial optimization problems, their use is still rare in carpooling problems. Motivated to propose a solution for the many to many carpooling scenario, we present in this paper a GA with a customized fitness function that searches for the solution with minimal travel distance, efficient ride matching, timely arrival, and maximum fairness. The computational results and simulations based on real user data show the merits of the proposed method and motivate follow on research.","PeriodicalId":103316,"journal":{"name":"MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An intelligent and fair GA carpooling scheduler as a social solution for greener transportation\",\"authors\":\"Carl Michael Boukhater, Oussama Dakroub, Fayez Lahoud, M. Awad, H. Artail\",\"doi\":\"10.1109/MELCON.2014.6820528\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although many carpooling systems have been proposed, most of them lack various levels of automation, functionality, practicality, and solution quality. While Genetic Algorithms (GAs) have been successfully adopted for solving combinatorial optimization problems, their use is still rare in carpooling problems. Motivated to propose a solution for the many to many carpooling scenario, we present in this paper a GA with a customized fitness function that searches for the solution with minimal travel distance, efficient ride matching, timely arrival, and maximum fairness. The computational results and simulations based on real user data show the merits of the proposed method and motivate follow on research.\",\"PeriodicalId\":103316,\"journal\":{\"name\":\"MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference\",\"volume\":\"109 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MELCON.2014.6820528\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MELCON.2014.6820528","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An intelligent and fair GA carpooling scheduler as a social solution for greener transportation
Although many carpooling systems have been proposed, most of them lack various levels of automation, functionality, practicality, and solution quality. While Genetic Algorithms (GAs) have been successfully adopted for solving combinatorial optimization problems, their use is still rare in carpooling problems. Motivated to propose a solution for the many to many carpooling scenario, we present in this paper a GA with a customized fitness function that searches for the solution with minimal travel distance, efficient ride matching, timely arrival, and maximum fairness. The computational results and simulations based on real user data show the merits of the proposed method and motivate follow on research.