Pages that link to "Item:Q2267375"
From MaRDI portal
The following pages link to Dynamic transportation of patients in hospitals (Q2267375):
Displaying 24 items.
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
- Dynamic pickup and delivery problems (Q1038370) (← links)
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
- Emergency medical services and beyond: addressing new challenges through a wide literature review (Q1652096) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- Dynamic vehicle routing problems with enhanced ant colony optimization (Q1726966) (← links)
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
- The EMS vehicle patient transportation problem during a demand surge (Q2022301) (← links)
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134) (← links)
- Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
- Synchronizing transportation of people with reduced mobility through airport terminals (Q2664455) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem (Q2815449) (← links)
- A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline (Q3467854) (← links)
- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation (Q3564375) (← links)
- A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
- Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
- Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems (Q6065891) (← links)
- Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system (Q6069239) (← links)
- Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)