Local search heuristics for the probabilistic dial-a-ride problem
From MaRDI portal
Publication:657055
DOI10.1007/s00291-009-0175-6zbMath1229.90024OpenAlexW2069358952MaRDI QIDQ657055
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
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The probabilistic travelling salesman problem with crowdsourcing ⋮ A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction ⋮ Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system ⋮ Typology and literature review for dial-a-ride problems ⋮ A probabilistic approach to pickup and delivery problems with time window uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Future paths for integer programming and links to artificial intelligence
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- The dial-a-ride problem: Models and algorithms
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Solving the Dial-a-Ride problem using genetic algorithms
- 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 Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Tabu Search—Part I
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Vehicle-scheduling Problems with Uncertainty and Omitted Customers
- Parallel iterative search methods for vehicle routing problems
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem
- The General Pickup and Delivery Problem
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
- A Priori Optimization
