Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation

DOI10.1016/j.cor.2016.07.020zbMath1391.90078OpenAlexW2481715007MaRDI QIDQ1652021

Kris Braekers, Yves Molenbruch, An Caris, Greet vanden Berghe

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.020

zbMATH Keywords

dial-a-ride problembi-objective optimizationcombination restrictionsmulti-directional local searchpatient transportationscheduling procedure

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ A multi-objective approach for intermodal train load planning ⋮ Synchronizing transportation of people with reduced mobility through airport terminals ⋮ The prisoner transportation problem ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ Efficient GRASP solution approach for the prisoner transportation problem ⋮ A deterministic annealing local search for the electric autonomous dial-a-ride problem ⋮ Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak ⋮ Typology and literature review for dial-a-ride problems ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ Objectives and methods in multi-objective routing problems: a survey and classification scheme ⋮ Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm

Cites Work

• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Multi-directional local search
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• Variable neighbourhood search: methods and applications
• Dynamic transportation of patients in hospitals
• The dial-a-ride problem: Models and algorithms
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• Variable neighborhood search for the dial-a-ride problem
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows

This page was built for publication: Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation