A new extension of local search applied to the Dial-A-Ride problem
From MaRDI portal
(Redirected from Publication:1388930)
Recommendations
- Sequential search and its application to vehicle-routing problems
- Local search heuristics for the probabilistic dial-a-ride problem
- AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS
- Sequential and parallel local search for the time-constrained traveling salesman problem
- scientific article; zbMATH DE number 1766758
Cites work
- A method for solving traveling-salesman problems
- An Efficient Heuristic Procedure for Partitioning Graphs
- An efficient implementation of local search algorithms for constrained routing problems
- Computer Solutions of the Traveling Salesman Problem
- Hill Climbing with Multiple Local Optima
- scientific article; zbMATH DE number 432754 (Why is no real title available?)
- scientific article; zbMATH DE number 18531 (Why is no real title available?)
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- k-interchange procedures for local search in a precedence-constrained routing problem
- Optimization by simulated annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Simulated Annealing – An Annotated Bibliography
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Tabu Search—Part I
- Using tabu search techniques for graph coloring
Cited in
(25)- The pickup and delivery traveling salesman problem with first-in-first-out loading
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
- A heuristic for the pickup and delivery traveling salesman problem
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- An efficient implementation of a static move descriptor-based local search heuristic
- Typology and literature review for dial-a-ride problems
- The pickup and delivery traveling salesman problem with handling costs
- Metaheuristics: A bibliography
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- Comparison of anticipatory algorithms for a dial-a-ride problem
- Pricing and allocation algorithm designs in dynamic ridesharing system
- Optimal charging and repositioning of electric vehicles in a free-floating carsharing system
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
- Local search heuristics for the probabilistic dial-a-ride problem
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms
This page was built for publication: A new extension of local search applied to the Dial-A-Ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388930)
