A dial-a-ride problem for client transportation in a health-care organization
From MaRDI portal
Publication:2433383
DOI10.1016/j.cor.2005.03.024zbMath1120.90003OpenAlexW2016908591MaRDI QIDQ2433383
Hokey Min, Emanuel Melachrinoudis, Ahmet B. Ilhan
Publication date: 27 October 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.03.024
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
Event-based MILP models for ridepooling applications, An adaptive large neighborhood search for an E-grocery delivery routing problem, Vehicle routing problems with alternative paths: an application to on-demand transportation, An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, Étude comparative de divers modèles pour le problème de transport à la demande, Typology and literature review for dial-a-ride problems, A demand‐responsive feeder service with a maximum headway at mandatory stops, An enhanced semi-flexible transit service with introducing meeting points, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, Minimizing the maximal ergonomic burden in intra-hospital patient transportation, Benchmarking online dispatch algorithms for emergency medical services, The dial-a-ride problem: Models and algorithms, A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM, Dynamic transportation of patients in hospitals, A tabu search heuristic for the dynamic transportation of patients between care units, A new VRPPD model and a hybrid heuristic solution approach for e-tailing, An optimization model and a solution algorithm for the many-to-many car pooling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A classification scheme for vehicle routing and scheduling problems
- A bi-criteria heuristic for the vehicle routing problem with time windows
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Future paths for integer programming and links to artificial intelligence
- Tabu search heuristics for the vehicle routing problem with time windows.
- Modeling and Optimizing Dynamic Dial-a-Ride Problems
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- 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
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- Solving vehicle routing problems using constraint programming and metaheuristics
