Modeling and Optimizing Dynamic Dial-a-Ride Problems

DOI10.1111/1475-3995.00256zbMath0992.90002OpenAlexW1967049025MaRDI QIDQ2767691

Alberto Colorni, Giovanni Righini

Publication date: 30 January 2002

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00256

zbMATH Keywords

transportationbranch-and-boundlocal searchdial-a-ride

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (5)

Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed ⋮ Étude comparative de divers modèles pour le problème de transport à la demande ⋮ A dial-a-ride problem for client transportation in a health-care organization ⋮ The dial-a-ride problem: Models and algorithms ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem

This page was built for publication: Modeling and Optimizing Dynamic Dial-a-Ride Problems