An optimization model and a solution algorithm for the many-to-many car pooling problem
DOI10.1007/S10479-011-0948-6zbMATH Open1233.90102OpenAlexW2070937143MaRDI QIDQ763101FDOQ763101
Authors: Shangyao Yan, Chun-Ying Chen 
Publication date: 9 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0948-6
Recommendations
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- Approximation algorithms for the maximum carpool matching problem
- Modeling and solving the multimodal car- and ride-sharing problem
- Common route planning for carpoolers -- model and exact algorithm
- scientific article; zbMATH DE number 721724
- Approximation algorithms for car-sharing problems
- Scalability issues in optimal assignment for carpooling
- A multi-destination daily carpooling problem and an ant colony based resolution method
- Tabu search for the real-world carpooling problem
Lagrangian relaxationmany-to-manycar poolingmultiple commodity network flow problemtime-space network
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Traffic problems in operations research (90B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- On fairness in the carpool problem
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- The dial-a-ride problem: Models and algorithms
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- Optimal scheduling of emergency roadway repair and subsequent relief distribution
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- A dial-a-ride problem for client transportation in a health-care organization
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- Solving the Dial-a-Ride problem using genetic algorithms
- A distributed geographic information system for the daily car pooling problem
- An effective and fast heuristic for the dial-a-ride problem
- Modeling and optimizing dynamic dial-a-ride problems
- The optimality of the online greedy algorithm in carpool and chairman assignment problems
- Approximating reduced costs under degeneracy in a network flow problem with side constraints
Cited In (12)
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- Carpooling: the 2 synchronization points shortest paths problem
- Title not available (Why is that?)
- Tabu search for the real-world carpooling problem
- A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem
- A multi-destination daily carpooling problem and an ant colony based resolution method
- Environmental and social implications of incorporating carpooling service on a customized bus system
- A traffic restriction scheme for enhancing carpooling
- Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
- Scalability issues in optimal assignment for carpooling
- Common route planning for carpoolers -- model and exact algorithm
- A distributed geographic information system for the daily car pooling problem
This page was built for publication: An optimization model and a solution algorithm for the many-to-many car pooling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763101)
