A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints

DOI10.1016/j.ejor.2004.09.060zbMath1103.90022OpenAlexW2031102078WikidataQ57185891 ScholiaQ57185891MaRDI QIDQ2503082

Chengbin Chu, Zhihai Xiang, Haoxun Chen

Publication date: 13 September 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.060

zbMATH Keywords

heuristicstransportationvehicle routing problemdial-a-ride problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (15)

Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems ⋮ Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation ⋮ A hybrid genetic algorithm for the heterogeneous dial-a-ride 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 ⋮ Planification des tournées dans le domaine de la messagerie rapide ⋮ Typology and literature review for dial-a-ride problems ⋮ The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments ⋮ Column generation for vehicle routing problems with multiple synchronization constraints ⋮ The dial-a-ride problem: Models and algorithms ⋮ A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM ⋮ A tabu search heuristic for the dynamic transportation of patients between care units ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem ⋮ Optimal charging and repositioning of electric vehicles in a free-floating carsharing system

Uses Software

• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• The pickup and delivery problem with time windows
• A new extension of local search applied to the Dial-A-Ride problem
• k-interchange procedures for local search in a precedence-constrained routing problem
• Efficient feasibility testing for dial-a-ride problems
• Drive: Dynamic Routing of Independent Vehicles
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• A heuristic for the vehicle routing problem with time windows
• Solving vehicle routing problems using constraint programming and metaheuristics

This page was built for publication: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints