A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
From MaRDI portal
Publication:1908288
DOI10.1007/BF02031946zbMath0839.90033MaRDI QIDQ1908288
Jens Moberg Rygaard, Oli B. G. Madsen, Hans F. Ravn
Publication date: 26 February 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items (39)
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ A dynamic tree algorithm for peer-to-peer ridesharing matching ⋮ Daily aircraft routing for amphibious ready groups ⋮ A comparison of column-generation approaches to the synchronized pickup and delivery problem ⋮ Measures of dynamism and urgency in logistics ⋮ 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) ⋮ Heuristics for dynamic and stochastic routing in industrial shipping ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services ⋮ A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem ⋮ Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems ⋮ Étude comparative de divers modèles pour le problème de transport à la demande ⋮ Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. ⋮ A multi-start local search heuristic for ship scheduling -- a computational study ⋮ A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows ⋮ 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 ⋮ A neural-tabu search heuristic for the real time vehicle routing problem ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments ⋮ Minimizing the maximal ergonomic burden in intra-hospital patient transportation ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ The dial-a-ride problem: Models and algorithms ⋮ Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering ⋮ Dynamic transportation of patients in hospitals ⋮ An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones ⋮ A tabu search heuristic for the dynamic transportation of patients between care units ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints ⋮ A two-stage model for a day-ahead paratransit planning problem ⋮ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem ⋮ Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects ⋮ Dynamic pickup and delivery problems ⋮ The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method ⋮ Management Policies in a Dynamic Multi Period Routing Problem ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
Cites Work
- k-interchange procedures for local search in a precedence-constrained routing problem
- 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
- Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
- An Asymptotic, Probabilistic Analysis of a Routing Problem
This page was built for publication: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
