Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
Author:
- 30 October 2019
- journal article
- research article
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (1) , 91-118
Abstract
Severe traffic congestion and growing ecological consciousness have led to the rise of alternative transportation systems. Ride sharing is one such alternative in which drivers and passengers with similar time schedules and travel plans are matched. For this service to be effective, a large number of users are required to increase the probability of finding suitable travel partners. The present paper proposes a late acceptance metaheuristic to decide which users act as drivers and to construct their routes. The underlying optimization model allows passengers to walk to/from alternative pickup/drop‐off locations so as to further exploit user flexibility. A computational study quantifies the impact of different types of participant flexibility on CO2 emissions. These insights can inform and support policymakers in organizing effective ride‐sharing systems.Keywords
This publication has 26 references indexed in Scilit:
- Late acceptance hill climbing algorithm for solving patient admission scheduling problemKnowledge-Based Systems, 2018
- Minimizing CO2 emissions in a practical daily carpooling problemComputers & Operations Research, 2017
- The late acceptance Hill-Climbing heuristicEuropean Journal of Operational Research, 2017
- Stochastic Set-Based Particle Swarm Optimization Based on Local Exploration for Solving the Carpool Service ProblemIEEE Transactions on Cybernetics, 2016
- Late acceptance hill-climbing for high school timetablingJournal of Scheduling, 2015
- Ridesharing: The state-of-the-art and future directionsTransportation Research Part B: Methodological, 2013
- Optimization for dynamic ride-sharing: A reviewEuropean Journal of Operational Research, 2012
- Ridesharing in North America: Past, Present, and FutureTransport Reviews, 2012
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column GenerationOperations Research, 2004
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003