Modeling and optimizing dynamic dial-a-ride problems

DOI10.1111/1475-3995.00256MaRDI QIDQ2767691zbMATH OpenOpenAlexFDO

Authors 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

branch-and-bounddial-a-ridelocal searchtransportation

Mathematics Subject Classification ID

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

Recommendations

• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• An effective and fast heuristic for the dial-a-ride problem
• The dial-a-ride problem: Models and algorithms
• A matheuristic for the dial-a-ride problem
• Dynamic programming based metaheuristics for the dial-a-ride problem

Cited in

(24)

• A two-stage model for a day-ahead paratransit planning problem
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Typology and literature review for dial-a-ride problems
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
• Efficient feasibility testing for dial-a-ride problems
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• Event-based MILP models for ridepooling applications
• Optimization for dynamic ride-sharing: a review
• A dial-a-ride problem for client transportation in a health-care organization
• The dial-a-ride problem: Models and algorithms
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
• scientific article; zbMATH DE number 1683925 (Why is no real title available?)
• A dynamic day-ahead paratransit planning problem
• Mitigating End Effects in the Dynamic Vehicle Allocation Model
• scientific article; zbMATH DE number 1185321 (Why is no real title available?)
• scientific article; zbMATH DE number 906535 (Why is no real title available?)
• 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
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
• New optimization guidance for dynamic dial-a-ride problems
• The dial-a-tour problem
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767691)