Balanced strategy based on environment and user benefit-oriented carpooling service mode for commuting trips

Besides saving money and providing convenience, carpooling can result in environmental benefits to society; therefore, it is important to promote and improve daily carpooling services. However, some conflicts related to carpooling match rates and environmental protection have been influencing user satisfaction. To broaden the carpooling service scope and improve service flexibility, an environment and user benefit-oriented carpooling service model was developed that included mixed user groups, different user types, multiple origin and destination pairs, a time window and user attitudes, and considered the cost and time efficiency requirements of the users to guarantee individual benefits and provide more reasonable matches. A 0–1 nonlinear optimization model was built to describe the model and an improved genetic algorithm based on a nearby matching principle designed to find the optimal solution. Finally, a case simulation from Chengdu city was conducted to demonstrate the effectiveness of the proposed model and the influence of different user attitudes on the carbon emissions and match rates, from which it was found that the proposed carpooling mode was able to provide a more systematic carpooling plan, avoid the increased carbon emissions from potential mismatching due to time and efficiency losses, and guarante the maximum social benefit.

[1]  S. Handy,et al.  Sustainable transportation at the ballot box: a disaggregate analysis of the relative importance of user travel mode, attitudes and self-interest , 2018 .

[2]  Henry C. W. Lau,et al.  Application of Genetic Algorithms to Solve the Multidepot Vehicle Routing Problem , 2010, IEEE Transactions on Automation Science and Engineering.

[3]  Kalon L Kelley Casual carpooling—enhanced , 2007 .

[4]  Ming Zhu,et al.  Joint Transportation and Charging Scheduling in Public Vehicle Systems—A Game Theoretic Approach , 2017, IEEE Transactions on Intelligent Transportation Systems.

[5]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[6]  Shih-Chia Huang,et al.  A Genetic-Algorithm-Based Approach to Solve Carpool Service Problems in Cloud Computing , 2015, IEEE Transactions on Intelligent Transportation Systems.

[7]  Martin W. P. Savelsbergh,et al.  Optimization for dynamic ride-sharing: A review , 2012, Eur. J. Oper. Res..

[8]  Maged Dessouky,et al.  Complementarity models for traffic equilibrium with ridesharing , 2015 .

[9]  Maxwell Chipulu,et al.  What encourages people to carpool? An evaluation of factors with meta-analysis , 2017 .

[10]  Christoph Stach Saving time, money and the environment - vHike a dynamic ride-sharing service for mobile devices , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[11]  Shih-Chia Huang,et al.  An Evolutionary Multiobjective Carpool Algorithm Using Set-Based Operator Based on Simulated Binary Crossover , 2019, IEEE Transactions on Cybernetics.

[12]  Shih-Chia Huang,et al.  Global and Local Pareto Optimality in Coevolution for Solving Carpool Service Problem With Time Windows , 2020, IEEE Transactions on Intelligent Transportation Systems.

[13]  Davy Janssens,et al.  Multi-agent simulation of individual mobility behavior in carpooling , 2014 .

[14]  Robert Weibel,et al.  Multimodal Route Planning With Public Transport and Carpooling , 2019, IEEE Transactions on Intelligent Transportation Systems.

[15]  Ezequiel A. Di Paolo,et al.  Binary-Representation-Based Genetic Algorithm for Aircraft Arrival Sequencing and Scheduling , 2008, IEEE Transactions on Intelligent Transportation Systems.

[16]  Fernando Ordóñez,et al.  Ridesharing: The state-of-the-art and future directions , 2013 .

[17]  Roberto Baldacci,et al.  An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation , 2004, Oper. Res..

[18]  Luigi Atzori,et al.  Dynamic Carpooling in Urban Areas: Design and Experimentation with a Multi-Objective Route Matching Algorith , 2017 .

[19]  Mark W Burris,et al.  Slugging in Houston: Casual Carpool Passenger Characteristics , 2006 .

[20]  Xiaowei Chen,et al.  Exploring impacts of on-demand ridesplitting on mobility via real-world ridesourcing data and questionnaires , 2018, Transportation.

[21]  R M Jorgensen,et al.  Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..

[22]  Philip L Winters,et al.  Impact of Carpooling on Trip-Chaining Behavior and Emission Reductions , 2007 .

[23]  Ali Haghani,et al.  Real-Time Rideshare Matching Problem , 2010 .

[24]  Shih-Chia Huang,et al.  An Ant Path-Oriented Carpooling Allocation Approach to Optimize the Carpool Service Problem With Time Windows , 2019, IEEE Systems Journal.

[25]  Shih-Chia Huang,et al.  A Heuristic Multi-Objective Optimization Algorithm for Solving the Carpool Services Problem Featuring High-Occupancy-Vehicle Itineraries , 2018, IEEE Transactions on Intelligent Transportation Systems.

[26]  R. Buliung,et al.  Catching a ride on the information super-highway: toward an understanding of internet-based carpool formation and use , 2010 .

[27]  Yu Zheng,et al.  Real-Time City-Scale Taxi Ridesharing , 2015, IEEE Transactions on Knowledge and Data Engineering.

[28]  Manuel Iori,et al.  Minimizing CO2 emissions in a practical daily carpooling problem , 2017, Comput. Oper. Res..

[29]  Graham Currie,et al.  Optimization of Transit Priority in the Transportation Network Using a Genetic Algorithm , 2011, IEEE Transactions on Intelligent Transportation Systems.

[30]  Shih-Chia Huang,et al.  Self-Organizing Neuroevolution for Solving Carpool Service Problem With Dynamic Capacity to Alternate Matches , 2019, IEEE Transactions on Neural Networks and Learning Systems.

[31]  Niels A. H. Agatz,et al.  The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .

[32]  Shih-Chia Huang,et al.  Stochastic Set-Based Particle Swarm Optimization Based on Local Exploration for Solving the Carpool Service Problem , 2016, IEEE Transactions on Cybernetics.

[33]  Kai Hwang,et al.  Intelligent Carpool Routing for Urban Ridesharing by Mining GPS Trajectories , 2014, IEEE Transactions on Intelligent Transportation Systems.

[34]  Frank Spielberg,et al.  Mating Habits of Slugs: Dynamic Carpool Formation in the I-95/I-395 Corridor of Northern Virginia , 2000 .

[35]  Martin W. P. Savelsbergh,et al.  Dynamic ridesharing: Is there a role for dedicated drivers? , 2015 .

[36]  Desheng Zhang,et al.  A Carpooling Recommendation System for Taxicab Services , 2014, IEEE Transactions on Emerging Topics in Computing.

[37]  Michael Weber,et al.  The ridematching problem with time windows in dynamic ridesharing: A model and a genetic algorithm , 2012, 2012 IEEE Congress on Evolutionary Computation.

[38]  Joseph Ying Jun Chow,et al.  Agent-based day-to-day adjustment process to evaluate dynamic flexible transport service policies , 2017 .

[39]  Wenquan Li,et al.  Research on Optimization of Vehicle Routing Problem for Ride-sharing Taxi , 2012 .

[40]  Kevin M. Curtin,et al.  A New Model for a Carpool Matching Service , 2015, PloS one.

[41]  Shih-Chia Huang,et al.  Optimization of the Carpool Service Problem via a Fuzzy-Controlled Genetic Algorithm , 2015, IEEE Transactions on Fuzzy Systems.

[42]  Shih-Chia Huang,et al.  Services-Oriented Computing Using the Compact Genetic Algorithm for Solving the Carpool Services Problem , 2015, IEEE Transactions on Intelligent Transportation Systems.