An effective and fast heuristic for the dial-a-ride problem

DOI10.1007/S10288-006-0018-0zbMath1121.90019OpenAlexW2088322639MaRDI QIDQ2644373

Roberto Wolfler Calvo, Alberto Colorni

Publication date: 31 August 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-006-0018-0

zbMATH Keywords

schedulingvehicle routingheuristicroutingdial-a-ride

Mathematics Subject Classification ID

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

Related Items (9)

Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ Étude comparative de divers modèles pour le problème de transport à la demande ⋮ Approximation algorithms for multi-vehicle stacker crane problems ⋮ The dial-a-ride problem: Models and algorithms ⋮ Dynamic transportation of patients in hospitals ⋮ Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem

Cites Work

• Unnamed Item
• An exact algorithm for the maximum clique problem
• The pickup and delivery problem with time windows
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A New Heuristic for the Traveling Salesman Problem with Time Windows
• Integer Programming Formulation of Traveling Salesman Problems
• 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
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• A GRASP for the Vehicle Routing Problem with Time Windows
• The General Pickup and Delivery Problem
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation

This page was built for publication: An effective and fast heuristic for the dial-a-ride problem