A new extension of local search applied to the Dial-A-Ride problem
From MaRDI portal
Publication:1388930
DOI10.1016/0377-2217(93)E0292-6zbMath0903.90135OpenAlexW2081313488MaRDI QIDQ1388930
Publication date: 5 January 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0292-6
Related Items
Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem, Comparison of anticipatory algorithms for a dial-a-ride problem, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, Metaheuristics: A bibliography, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, Typology and literature review for dial-a-ride problems, A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem, Local search heuristics for the probabilistic dial-a-ride problem, The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments, The pickup and delivery traveling salesman problem with handling costs, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports, The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms, A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints, Pricing and allocation algorithm designs in dynamic ridesharing system, The pickup and delivery traveling salesman problem with first-in-first-out loading, A heuristic for the pickup and delivery traveling salesman problem, 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, Optimal charging and repositioning of electric vehicles in a free-floating carsharing system, Perturbation heuristics for the pickup and delivery traveling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- An efficient implementation of local search algorithms for constrained routing problems
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- k-interchange procedures for local search in a precedence-constrained routing problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Hill Climbing with Multiple Local Optima
- Simulated Annealing – An Annotated Bibliography
- Tabu Search—Part I
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Method for Solving Traveling-Salesman Problems
- Computer Solutions of the Traveling Salesman Problem
