A tabu search heuristic for the dynamic transportation of patients between care units
From MaRDI portal
Publication:2275836
DOI10.1016/j.ejor.2011.04.033zbMath1218.90040OpenAlexW2011141509MaRDI QIDQ2275836
Yannick Kergosien, Jean-Charles Billaut, D. Piton, Christophe Lenté
Publication date: 10 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.033
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Optimal routing for electric vehicle service systems ⋮ Dynamic resource allocation to improve emergency department efficiency in real time ⋮ From theory to practice: maximizing revenues for on-line dial-a-ride ⋮ Synchronized routing of active and passive means of transport ⋮ Minimizing the maximal ergonomic burden in intra-hospital patient transportation ⋮ The EMS vehicle patient transportation problem during a demand surge ⋮ New Notation and Classification Scheme for Vehicle Routing Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic pickup and delivery problems
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Future paths for integer programming and links to artificial intelligence
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Dynamic transportation of patients in hospitals
- A fuzzy multi-objective covering-based vehicle location model for emergency services
- A dial-a-ride problem for client transportation in a health-care organization
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- A multiperiod set covering location model for dynamic redeployment of ambulances
- Dynamic fleet management. Concepts, systems, algorithms \& case studies
- The dial-a-ride problem: Models and algorithms
- Extensions to emergency vehicle location models
- 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
- Diversion Issues in Real-Time Vehicle Dispatching
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- An Asymptotic, Probabilistic Analysis of a Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
