A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem

DOI10.1287/ijoc.1110.0454zbMath1460.90083OpenAlexW2128811073MaRDI QIDQ2815449

Gilbert Laporte, Gerardo Berbeglia, Jean-François Cordeau

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c3030cf020fbea01355c60c4bf2de5b8a7ad590c

zbMATH Keywords

dynamicschedulingtabu searchconstraint programmingdial-a-ride problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

An ant colony system for responsive dynamic vehicle routing, Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed, Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems, Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system, Graph representation of the fixed route dial-a-ride problem, A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs, The Synchronized Dynamic Vehicle Dispatching Problem, Typology and literature review for dial-a-ride problems, Routing by ranking: a link analysis method for the constrained dial-a-ride problem, Scheduling issues in vehicle routing

Uses Software

• TSPTW
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic pickup and delivery problems
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Dynamic transportation of patients in hospitals
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
• The dial-a-ride problem: Models and algorithms
• A Hybrid Exact Algorithm for the TSPTW
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows