Solving the Dial-a-Ride problem using genetic algorithms
From MaRDI portal
Publication:3512379
DOI10.1057/palgrave.jors.2602287zbMath1179.90035OpenAlexW2011884974MaRDI QIDQ3512379
No author found.
Publication date: 11 July 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: http://orbit.dtu.dk/ws/files/2891779/imm3395.pdf
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (18)
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ Event-based MILP models for ridepooling applications ⋮ A hybrid genetic algorithm for the heterogeneous dial-a-ride problem ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ Variable neighborhood search for the dial-a-ride problem ⋮ Scheduling heterogeneous multi-load AGVs with battery constraints ⋮ Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems ⋮ Étude comparative de divers modèles pour le problème de transport à la demande ⋮ Typology and literature review for dial-a-ride problems ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ The dial-a-ride problem: Models and algorithms ⋮ The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms ⋮ Dynamic transportation of patients in hospitals ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ A two-stage model for a day-ahead paratransit planning problem ⋮ Solving a dial-a-flight problem using composite variables ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem ⋮ The paired many-to-many pickup and delivery problem: an application
This page was built for publication: Solving the Dial-a-Ride problem using genetic algorithms
