An optimization model and a solution algorithm for the many-to-many car pooling problem

DOI10.1007/s10479-011-0948-6zbMath1233.90102OpenAlexW2070937143MaRDI QIDQ763101

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

zbMATH Keywords

Lagrangian relaxationtime-space networkmany-to-manycar poolingmultiple commodity network flow problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (2)

Environmental and social implications of incorporating carpooling service on a customized bus system ⋮ Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal scheduling of emergency roadway repair and subsequent relief distribution
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• A distributed geographic information system for the daily car pooling problem
• A dial-a-ride problem for client transportation in a health-care organization
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
• The dial-a-ride problem: Models and algorithms
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• 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
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Solving the Dial-a-Ride problem using genetic algorithms
• An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• On fairness in the carpool problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
• Approximating reduced costs under degeneracy in a network flow problem with side constraints

This page was built for publication: An optimization model and a solution algorithm for the many-to-many car pooling problem