A tabu search heuristic for the dynamic transportation of patients between care units
From MaRDI portal
Publication:2275836
Recommendations
- Dynamic transportation of patients in hospitals
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
- The EMS vehicle patient transportation problem during a demand surge
- Solving an ambulance location model by tabu search
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
Cites work
- A dial-a-ride problem for client transportation in a health-care organization
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A fuzzy multi-objective covering-based vehicle location model for emergency services
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A multiperiod set covering location model for dynamic redeployment of ambulances
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- An Asymptotic, Probabilistic Analysis of a Routing Problem
- Diversion issues in real-time vehicle dispatching
- Dynamic fleet management. Concepts, systems, algorithms \& case studies
- Dynamic pickup and delivery problems
- Dynamic transportation of patients in hospitals
- Extensions to emergency vehicle location models
- Future paths for integer programming and links to artificial intelligence
- scientific article; zbMATH DE number 1749228 (Why is no real title available?)
- scientific article; zbMATH DE number 1361564 (Why is no real title available?)
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- The dial-a-ride problem: Models and algorithms
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- Variable neighborhood search for the dial-a-ride problem
Cited in
(17)- From theory to practice: maximizing revenues for on-line dial-a-ride
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- The EMS vehicle patient transportation problem during a demand surge
- Dynamic transportation of patients in hospitals
- Synchronized routing of active and passive means of transport
- Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare
- Optimal routing for electric vehicle service systems
- Dynamic resource allocation to improve emergency department efficiency in real time
- New notation and classification scheme for vehicle routing problems
- The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem
- Waiting strategies for regular and emergency patient transportation
- Study on man power planning of hospital transportation department by using VRPSTW
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
- MILP models of a patient transportation problem
- Multiple plan approach for a dynamic dial-a-ride problem
- Evaluating a simulated annealing metaheuristic for the heterogeneous on-demand bus routing problem with a novel experimental setup
- A hybrid method for the intelligent effectiveness management of production operators
This page was built for publication: A tabu search heuristic for the dynamic transportation of patients between care units
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275836)
