An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
type: Item
instance of: scholarly article
title: An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
zbMATH Open document ID: 1208.90019
author: Lauri Häme
published in: European Journal of Operational Research
publication date: 2011-01-21T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 5840129
zbMATH Keywords: transportation
zbMATH Keywords: dial-a-ride problem
zbMATH Keywords: exact algorithm
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.08.021
OpenAlex ID: W2161549814
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: Dynamic pickup and delivery problems
cites work: Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
cites work: The dial-a-ride problem: Models and algorithms
cites work: Indecomposable permutations, hypermaps and labeled Dyck paths
cites work: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
cites work: The pickup and delivery problem with time windows
cites work: Vehicle routing problems with alternative paths: an application to on-demand transportation
cites work: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
cites work: Efficient feasibility testing for dial-a-ride problems
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: A dial-a-ride problem for client transportation in a health-care organization
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: Variable neighborhood search for the dial-a-ride problem
cites work: Q5687194
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem
cites work: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
cites work: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
cites work: The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
DOI: 10.1016/J.EJOR.2010.08.021
description: scientific article; zbMATH DE number 5840129