A multi-start local search algorithm for the vehicle routing problem with time windows
From MaRDI portal
Publication:1887956
DOI10.1016/S0377-2217(03)00435-1zbMath1065.90013OpenAlexW2065031863WikidataQ110035112 ScholiaQ110035112MaRDI QIDQ1887956
Geir Hasle, Olli Bräysy, Wout E. H. Dullaert
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00435-1
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (16)
An integrated approach to the vehicle routing and container loading problems ⋮ A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows ⋮ The vehicle routing problem with flexible time windows and traveling times ⋮ A general heuristic for vehicle routing problems ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands ⋮ A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times ⋮ A hybrid search method for the vehicle routing problem with time windows ⋮ A multi-start local search heuristic for ship scheduling -- a computational study ⋮ An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics ⋮ An iterated local search algorithm for the vehicle routing problem with convex time penalty functions ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ Supplier-initiated outsourcing: a methodology to exploit synergy in transportation ⋮ Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Local search with annealing-like restarts to solve the VRPTW
- A threshold accepting metaheuristic for the vehicle routing problem with time windows.
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Probabilistic diversification and intensification in local search for vehicle routing
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- A Subpath Ejection Method for the Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- A greedy look-ahead heuristic for the vehicle routing problem with time windows
- A unified tabu search heuristic for vehicle routing problems with time windows
- A GRASP for the Vehicle Routing Problem with Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- Equation of State Calculations by Fast Computing Machines
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
- A heuristic for the vehicle routing problem with time windows
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- Using constraint-based operators to solve the vehicle routing problem with time windows
- A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
This page was built for publication: A multi-start local search algorithm for the vehicle routing problem with time windows
