An optimization model and a solution algorithm for the many-to-many car pooling problem
type: Item
instance of: scholarly article
title: An optimization model and a solution algorithm for the many-to-many car pooling problem
zbMATH Open document ID: 1233.90102
author: Shangyao Yan
author: Chun-Ying Chen
published in: Annals of Operations Research
publication date: 2012-03-09T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6013347
zbMATH Keywords: car pooling
zbMATH Keywords: many-to-many
zbMATH Keywords: time-space network
zbMATH Keywords: multiple commodity network flow problem
zbMATH Keywords: Lagrangian relaxation
MaRDI profile type: Publication
full work available at URL: s10479-011-0948-6
OpenAlex ID: W2070937143
cites work: An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
cites work: Modeling and optimizing dynamic dial-a-ride problems
cites work: The optimality of the online greedy algorithm in carpool and chairman assignment problems
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
cites work: The dial-a-ride problem: Models and algorithms
cites work: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4198056
cites work: Solving the Dial-a-Ride problem using genetic algorithms
cites work: A dial-a-ride problem for client transportation in a health-care organization
cites work: On fairness in the carpool problem
cites work: Q4739657
cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
cites work: An effective and fast heuristic for the dial-a-ride problem
cites work: A distributed geographic information system for the daily car pooling problem
cites work: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
cites work: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
cites work: Approximating reduced costs under degeneracy in a network flow problem with side constraints
cites work: Optimal scheduling of emergency roadway repair and subsequent relief distribution
DOI: 10.1007/S10479-011-0948-6
Recommended article: An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
Recommended article: Approximation algorithms for the maximum carpool matching problem
Recommended article: Modeling and solving the multimodal car- and ride-sharing problem
Recommended article: Common Route Planning for Carpoolers – Model and Exact Algorithm
Recommended article: Q4322679
Recommended article: Approximation algorithms for car-sharing problems
Recommended article: Scalability issues in optimal assignment for carpooling
Recommended article: A multi-destination daily carpooling problem and an ant colony based resolution method
Recommended article: Tabu search for the real-world carpooling problem
description: scientific article; zbMATH DE number 6013347