Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
From MaRDI portal
Publication:5449876
DOI10.1111/j.1475-3995.2006.00544.xzbMath1145.90398OpenAlexW2136458540MaRDI QIDQ5449876
Ka In Wong, Michael G. H. Bell
Publication date: 19 March 2008
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2006.00544.x
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (9)
A hybrid genetic algorithm for the heterogeneous dial-a-ride problem ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ 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 ⋮ Typology and literature review for dial-a-ride problems ⋮ Routing by ranking: a link analysis method for the constrained dial-a-ride problem ⋮ The dial-a-ride problem: Models and algorithms ⋮ A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem
Cites Work
This page was built for publication: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
