Research on ride-sharing taxi model optimization and routing choice based on the genetic algorithm
W. Xu, Z. Wang
Pages: 103-110
Abstract:
Ride-sharing is not a strange word and it is rising gradually in a number of small and medium-sized cities. Some theses have studied ride-sharing, model building and cost-sharing. With environmental issues increasingly becoming a topic of concern, how to reduce the environmental impact of a taxi, reduce passengers’ costs and increase drivers’ or the entire industry’s revenue, there are that many researchers continue to explore these aspects of the application. Graph theory model of ride-sharing taxi system can illustrate the problem to a certain extent. However, there are a number of differences with the real system, and the discrepancy considering the income of taxi drivers. Based on the researches of others, the authors enrich and improve the taxi ride-sharing taxi model, regard the average income of taxi drivers, the average costs of passengers as well as the overall effect of social as the goal of ride-sharing taxi model, modify the model constraints and make the model more realistic. Finally, the time window is introduced to simulate the taxi passenger travel time, location, number and route like passengers in real system, and genetic algorithm is used to solve the model with time windows by Matlab10. From a computational experiment which is solved by using refined model, the value and benefits of ride-sharing taxi will be gained. So the ride-sharing taxi has an effect on the mitigation of urban traffic congestion and resource-wasting, which can not only help raise the city's road service levels, and reduce the total passengers’ travel distance, thereby reducing the environmental pollution.
Keywords: urban traffic; ride-sharing taxi; routing choice; genetic algorithm
2025 ISSUES
2024 ISSUES
LXII - April 2024LXIII - July 2024LXIV - November 2024Special 2024 Vol1Special 2024 Vol2Special 2024 Vol3Special 2024 Vol4
2023 ISSUES
LIX - April 2023LX - July 2023LXI - November 2023Special Issue 2023 Vol1Special Issue 2023 Vol2Special Issue 2023 Vol3
2022 ISSUES
LVI - April 2022LVII - July 2022LVIII - November 2022Special Issue 2022 Vol1Special Issue 2022 Vol2Special Issue 2022 Vol3Special Issue 2022 Vol4
2021 ISSUES
LIII - April 2021LIV - July 2021LV - November 2021Special Issue 2021 Vol1Special Issue 2021 Vol2Special Issue 2021 Vol3
2020 ISSUES
2019 ISSUES
Special Issue 2019 Vol1Special Issue 2019 Vol2Special Issue 2019 Vol3XLIX - November 2019XLVII - April 2019XLVIII - July 2019
2018 ISSUES
Special Issue 2018 Vol1Special Issue 2018 Vol2Special Issue 2018 Vol3XLIV - April 2018XLV - July 2018XLVI - November 2018
2017 ISSUES
Special Issue 2017 Vol1Special Issue 2017 Vol2Special Issue 2017 Vol3XLI - April 2017XLII - July 2017XLIII - November 2017
2016 ISSUES
Special Issue 2016 Vol1Special Issue 2016 Vol2Special Issue 2016 Vol3XL - November 2016XXXIX - July 2016XXXVIII - April 2016
2015 ISSUES
Special Issue 2015 Vol1Special Issue 2015 Vol2XXXV - April 2015XXXVI - July 2015XXXVII - November 2015
2014 ISSUES
Special Issue 2014 Vol1Special Issue 2014 Vol2Special Issue 2014 Vol3XXXII - April 2014XXXIII - July 2014XXXIV - November 2014
2013 ISSUES
2012 ISSUES
2011 ISSUES
2010 ISSUES
2009 ISSUES
2008 ISSUES
2007 ISSUES
2006 ISSUES
2005 ISSUES
2004 ISSUES
2003 ISSUES