Local search heuristics for the probabilistic dial-a-ride problem

DOI10.1007/S00291-009-0175-6zbMATH Open1229.90024OpenAlexW2069358952MaRDI QIDQ657055FDOQ657055

Authors: Sin C. Ho, Dag Haugland 

Publication date: 13 January 2012

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

Full work available at URL: https://doi.org/10.1007/s00291-009-0175-6

Recommendations

• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
• Variable neighborhood search for the dial-a-ride problem
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM

zbMATH Keywords

local searchtabu searchneighborhood evaluationprobabilistic dial-a-ride problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Tabu Search—Part I
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A unified tabu search heuristic for vehicle routing problems with time windows
• Title not available (Why is that?)
• Stochastic vehicle routing
• A new extension of local search applied to the Dial-A-Ride problem
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-a-ride problem: Models and algorithms
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Title not available (Why is that?)
• A Priori Optimization
• The General Pickup and Delivery Problem
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• The planar dimer model boundary: A survey
• Parallel iterative search methods for vehicle routing problems
• Title not available (Why is that?)
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• Title not available (Why is that?)
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Statistical Analysis of Computational Tests of Algorithms and Heuristics
• Vehicle-scheduling Problems with Uncertainty and Omitted Customers
• 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
• Solving the Dial-a-Ride problem using genetic algorithms
• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

Cited In (9)

• A probabilistic approach to pickup and delivery problems with time window uncertainty
• Probabilistic local search algorithms for concave cost transportation network problems
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
• The probabilistic travelling salesman problem with crowdsourcing
• Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
• A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
• Variable neighborhood search for the dial-a-ride problem
• Typology and literature review for dial-a-ride problems

Uses Software

• VRP
• Tabu search

This page was built for publication: Local search heuristics for the probabilistic dial-a-ride problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657055)