A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
From MaRDI portal
Recommendations
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- Dynamic programming based metaheuristics for the dial-a-ride problem
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
Cites work
Cited in
(56)- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- The pickup and delivery problem with time windows
- Towards a decision support system for the ready concrete distribution system: a case of a Greek company.
- Planning models for long-haul operations of postal and express shipment companies
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- Daily aircraft routing for amphibious ready groups
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- A two-phase heuristic for an in-port ship routing problem with tank allocation
- Typology and literature review for dial-a-ride problems
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
- Efficient feasibility testing for dial-a-ride problems
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Routing problems: A bibliography
- A column generation approach for location-routing problems with pickup and delivery
- Asynchronous optimization of part logistics routing problem
- Dynamic transportation of patients in hospitals
- A tabu search heuristic for the dynamic transportation of patients between care units
- 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
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints
- Vehicle routing problems with simultaneous pick-up and delivery service.
- The dial-a-ride problem: Models and algorithms
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- An effective and fast heuristic for the dial-a-ride problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Hybrid adaptive predictive control for a dynamic pickup and delivery problem including traffic congestion
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
- Recent models and algorithms for one-to-one pickup and delivery problems
- Feasibility testing for dial-a-ride problems
- Locating a cycle in a transportation or a telecommunications network
- Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
- Solving min-max shortest-path problems on a network
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
- scientific article; zbMATH DE number 2153292 (Why is no real title available?)
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Online dial-a-ride problem with time windows: an exact algorithm using status vectors
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Ship scheduling with soft time windows: An optimisation based approach
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
- Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- Earliest deadline first is a 2-approximation for DARP with time windows
- A memory-enhanced greedy randomized adaptive search procedure for the multi-pickup and delivery problem with time windows
- Supermarket-chain grocery delivery optimization through courier coordination
- An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services
- The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms
This page was built for publication: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770308)
