An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows

DOI10.1016/j.ejor.2010.08.021zbMath1208.90019OpenAlexW2161549814MaRDI QIDQ617511

Lauri Häme

Publication date: 21 January 2011

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

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

zbMATH Keywords

heuristicstransportationexact algorithmdial-a-ride problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (6)

Model-based organizational decision making: a behavioral lens ⋮ An adaptive large neighborhood search heuristic for the share-a-ride problem ⋮ Planification des tournées dans le domaine de la messagerie rapide ⋮ Typology and literature review for dial-a-ride problems ⋮ Routing by ranking: a link analysis method for the constrained dial-a-ride problem ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem

Cites Work

• Unnamed Item
• Dynamic pickup and delivery problems
• Indecomposable permutations, hypermaps and labeled Dyck paths
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The pickup and delivery problem with time windows
• The Euclidean traveling salesman problem is NP-complete
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• 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
• 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
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
• 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 two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• Vehicle routing problems with alternative paths: an application to on-demand transportation
• Variable neighborhood search for the dial-a-ride problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride 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
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints

This page was built for publication: An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows