Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
From MaRDI portal
Publication:6070411
DOI10.1111/itor.12737OpenAlexW2982452528WikidataQ126861948 ScholiaQ126861948MaRDI QIDQ6070411
Publication date: 21 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12737
Related Items (3)
Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach ⋮ An iterative combinatorial auction design for fractional ownership of autonomous vehicles ⋮ Differential pricing strategies of ride‐sharing platforms: choosing customers or drivers?
Cites Work
- Unnamed Item
- Tabu search for the real-world carpooling problem
- Late acceptance hill-climbing for high school timetabling
- An optimization model and a solution algorithm for the many-to-many car pooling problem
- Minimizing \(\mathrm{CO}_2\) emissions in a practical daily carpooling problem
- The late acceptance hill-climbing heuristic
- A distributed geographic information system for the daily car pooling problem
- Optimization for dynamic ride-sharing: a review
- Multi-machine energy-aware scheduling
- Solving the Dial-a-Ride problem using genetic algorithms
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
This page was built for publication: Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems