Local search heuristics for the probabilistic dial-a-ride problem
type: Item
instance of: scholarly article
title: Local search heuristics for the probabilistic dial-a-ride problem
zbMATH Open document ID: 1229.90024
author: Sin C. Ho
author: Dag Haugland
published in: OR Spectrum
publication date: 2012-01-13T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5997691
zbMATH Keywords: probabilistic dial-a-ride problem
zbMATH Keywords: neighborhood evaluation
zbMATH Keywords: local search
zbMATH Keywords: tabu search
describes a project that uses: VRP
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s00291-009-0175-6
OpenAlex ID: W2069358952
cites work: Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
cites work: A Priori Optimization
cites work: Q4699387
cites work: Statistical Analysis of Computational Tests of Algorithms and Heuristics
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
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: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Q4532231
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Stochastic vehicle routing
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Q4352217
cites work: Q4354785
cites work: A new extension of local search applied to the Dial-A-Ride problem
cites work: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
cites work: Q3677509
cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
cites work: Solving the Dial-a-Ride problem using genetic algorithms
cites work: The planar dimer model boundary: A survey
cites work: A Priori Optimization of the Probabilistic Traveling Salesman Problem
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: The General Pickup and Delivery Problem
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: Parallel iterative search methods for vehicle routing problems
cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem
cites work: Vehicle-scheduling Problems with Uncertainty and Omitted Customers
DOI: 10.1007/S00291-009-0175-6
description: scientific article; zbMATH DE number 5997691