Local search heuristics for the probabilistic dial-a-ride problem
From MaRDI portal
(Redirected from Publication:657055)
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
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A new extension of local search applied to the Dial-A-Ride problem
- A Priori Optimization
- A Priori Optimization of the Probabilistic Traveling Salesman 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 tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
- Future paths for integer programming and links to artificial intelligence
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1749228 (Why is no real title available?)
- scientific article; zbMATH DE number 1361564 (Why is no real title available?)
- 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
- Parallel iterative search methods for vehicle routing problems
- Solving the Dial-a-Ride problem using genetic algorithms
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
- Stochastic vehicle routing
- Tabu Search—Part I
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- The dial-a-ride problem: Models and algorithms
- The General Pickup and Delivery Problem
- The planar dimer model boundary: A survey
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Vehicle-scheduling Problems with Uncertainty and Omitted Customers
Cited in
(11)- A new extension of local search applied to the Dial-A-Ride problem
- Typology and literature review for dial-a-ride problems
- A probabilistic approach to pickup and delivery problems with time window uncertainty
- Probabilistic local search algorithms for concave cost transportation network problems
- The probabilistic travelling salesman problem with crowdsourcing
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- Variable neighborhood search for the dial-a-ride problem
- A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
- HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
- Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
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)
