Dynamic transportation of patients in hospitals
From MaRDI portal
Publication:2267375
DOI10.1007/S00291-008-0135-6zbMATH Open1181.90173OpenAlexW2055819286MaRDI QIDQ2267375FDOQ2267375
Authors: Alexandre Beaudry, G. Laporte, Teresa Melo, S. Nickel 
Publication date: 1 March 2010
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-15242
Recommendations
- A tabu search heuristic for the dynamic transportation of patients between care units
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
- Study on man power planning of hospital transportation department by using VRPSTW
- scientific article; zbMATH DE number 1594585
- The EMS vehicle patient transportation problem during a demand surge
Case-oriented studies in operations research (90B90) Transportation, logistics and supply chain management (90B06)
Cites Work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The dial-a-ride problem: Models and algorithms
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Parallel iterative search methods for vehicle routing problems
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
- A dial-a-ride problem for client transportation in a health-care organization
- A generalized insertion heuristic for the travelling salesman problem with time windows
- Scheduling linen deliveries in a large hospital
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Solving the Dial-a-Ride problem using genetic algorithms
- An effective and fast heuristic for the dial-a-ride problem
- Title not available (Why is that?)
Cited In (27)
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- Efficient GRASP solution approach for the prisoner transportation problem
- Rich vehicle routing problems: from a taxonomy to a definition
- The EMS vehicle patient transportation problem during a demand surge
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Title not available (Why is that?)
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Comparison of anticipatory algorithms for a dial-a-ride problem
- Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
- Emergency medical services and beyond: addressing new challenges through a wide literature review
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Dynamic pickup and delivery problems
- Synchronizing transportation of people with reduced mobility through airport terminals
- A hybrid large neighborhood search for dynamic vehicle routing problem with time deadline
- Study on man power planning of hospital transportation department by using VRPSTW
- Waiting strategies for regular and emergency patient transportation
- The prisoner transportation problem
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
- Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems
- Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the austrian situation
- Typology and literature review for dial-a-ride problems
- A tabu search heuristic for the dynamic transportation of patients between care units
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity
- Dynamic vehicle routing problems with enhanced ant colony optimization
This page was built for publication: Dynamic transportation of patients in hospitals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267375)
