An efficient implementation of local search algorithms for constrained routing problems
From MaRDI portal
Publication:918421
DOI10.1016/0377-2217(90)90091-OzbMath0705.90068OpenAlexW2069903872MaRDI QIDQ918421
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90091-o
Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The discrete lot-sizing and scheduling problem with sequence-dependent setup costs, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Routing problems: A bibliography, The simulated trading heuristic for solving vehicle routing problems, Exact algorithms for the multi-pickup and delivery problem with time windows, The prisoner transportation problem, The traveling salesman problem with job-times (\textit{TSPJ}), Coupling ant colony systems with strong local searches, A new extension of local search applied to the Dial-A-Ride problem, Improvement heuristics for the vehicle routing problem based on simulated annealing, An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows, A hybrid particle swarm optimization approach for the sequential ordering problem, Designing granular solution methods for routing problems with time windows, In-depth analysis of granular local search for capacitated vehicle routing, Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems, An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading, A heuristic algorithm for solving hazardous materials distribution problems., A heuristic manipulation technique for the sequential ordering problem, The multi-pickup and delivery problem with time windows, Vehicle Routing Problems with Inter-Tour Resource Constraints, The pickup and delivery traveling salesman problem with handling costs, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, The pickup and delivery traveling salesman problem with first-in-first-out loading, On the one-to-one pickup-and-delivery problem with time windows and trailers, A heuristic for the pickup and delivery traveling salesman problem, Perturbation heuristics for the pickup and delivery traveling salesman problem
Cites Work
- k-interchange procedures for local search in a precedence-constrained routing problem
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- A Method for Solving Traveling-Salesman Problems
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
