{"title":"从“反出租车”到“派乘客”:分布式出租车拼车路线和时间的优化","authors":"A. Manjunath, V. Raychoudhury, Snehanshu Saha","doi":"10.1109/COMSNETS48256.2020.9027410","DOIUrl":null,"url":null,"abstract":"Sustainability of local co-operative taxi networks in the face of competition from corporate behemoths is a problem worthy of investigation. Lack of infrastructure background support and venture capital demands alternative strategies for survival. A viable solution requires novel modeling approach and computational framework. Such framework needs to be fully distributed and therefore is sub-optimal. We propose an intra-city taxi service that leverages individual rides and local network for ride management. This, in turn, demands a bunch of decision variables and objectives to be optimized. Some of these objectives are conflicting and therefore the problem requires a multi objective optimization formulation. We propose to exploit the flexible structure and multi-agent like behavior of Ant colony optimization to tackle the diversity of objectives in the ride share problem. We consider the scenario of ride share only since that is the hardest part in the taxi business. The implementation is multi-modular and provides an alternative approach to commonly used centralized taxi network. We define novel performance metrics and present results to supplement the modeling approach. Our results show that spatio-temporal diversity is the biggest road block to wide scale ride sharing. Nonetheless, our solution ensures up to 77% acceptance in shared rides.","PeriodicalId":265871,"journal":{"name":"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Ant-Taxi to Pie-Passenger: Optimizing Routes and Time for Distributed Taxi Ride Sharing\",\"authors\":\"A. Manjunath, V. Raychoudhury, Snehanshu Saha\",\"doi\":\"10.1109/COMSNETS48256.2020.9027410\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sustainability of local co-operative taxi networks in the face of competition from corporate behemoths is a problem worthy of investigation. Lack of infrastructure background support and venture capital demands alternative strategies for survival. A viable solution requires novel modeling approach and computational framework. Such framework needs to be fully distributed and therefore is sub-optimal. We propose an intra-city taxi service that leverages individual rides and local network for ride management. This, in turn, demands a bunch of decision variables and objectives to be optimized. Some of these objectives are conflicting and therefore the problem requires a multi objective optimization formulation. We propose to exploit the flexible structure and multi-agent like behavior of Ant colony optimization to tackle the diversity of objectives in the ride share problem. We consider the scenario of ride share only since that is the hardest part in the taxi business. The implementation is multi-modular and provides an alternative approach to commonly used centralized taxi network. We define novel performance metrics and present results to supplement the modeling approach. Our results show that spatio-temporal diversity is the biggest road block to wide scale ride sharing. Nonetheless, our solution ensures up to 77% acceptance in shared rides.\",\"PeriodicalId\":265871,\"journal\":{\"name\":\"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS48256.2020.9027410\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS48256.2020.9027410","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ant-Taxi to Pie-Passenger: Optimizing Routes and Time for Distributed Taxi Ride Sharing
Sustainability of local co-operative taxi networks in the face of competition from corporate behemoths is a problem worthy of investigation. Lack of infrastructure background support and venture capital demands alternative strategies for survival. A viable solution requires novel modeling approach and computational framework. Such framework needs to be fully distributed and therefore is sub-optimal. We propose an intra-city taxi service that leverages individual rides and local network for ride management. This, in turn, demands a bunch of decision variables and objectives to be optimized. Some of these objectives are conflicting and therefore the problem requires a multi objective optimization formulation. We propose to exploit the flexible structure and multi-agent like behavior of Ant colony optimization to tackle the diversity of objectives in the ride share problem. We consider the scenario of ride share only since that is the hardest part in the taxi business. The implementation is multi-modular and provides an alternative approach to commonly used centralized taxi network. We define novel performance metrics and present results to supplement the modeling approach. Our results show that spatio-temporal diversity is the biggest road block to wide scale ride sharing. Nonetheless, our solution ensures up to 77% acceptance in shared rides.