An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
From MaRDI portal
Publication:875422
DOI10.1016/j.cor.2005.10.010zbMath1141.90429OpenAlexW2008146930WikidataQ110038537 ScholiaQ110038537MaRDI QIDQ875422
Jari Kytöjoki, Michel Gendreau, Teemu Nuortio, Olli Bräysy
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.010
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Fleet design optimisation from historical data using constraint programming and large neighbourhood search, Solving the petroleum replenishment and routing problem with variable demands and time windows, On the integrated charge planning with flexible jobs in primary steelmaking processes, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, An adaptive large neighborhood search for relocating vehicles in electric carsharing services, Dynamic vehicle routing using an improved variable neighborhood search algorithm, A variable neighbourhood search algorithm for the open vehicle routing problem, Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem, Testing local search move operators on the vehicle routing problem with split deliveries and time windows, New variable-length data compression scheme for solution representation of meta-heuristics, Algorithms for the maximum \(k\)-club problem in graphs, Variable neighbourhood structures for cycle location problems, A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times, Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses, Adaptive large neighborhood search on the graphics processing unit, Efficiently solving very large-scale routing problems, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation, Collaborative vehicle routing: a survey, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, A cooperative parallel metaheuristic for the capacitated vehicle routing problem, Variable neighbourhood search: methods and applications, An adaptive memory algorithm for the split delivery vehicle routing problem, Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm, Neighborhood structures for the container loading problem: a VNS implementation, A library of local search heuristics for the vehicle routing problem, Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders, Variable neighborhood search for the stochastic and dynamic vehicle routing problem, An iterated local search algorithm for the vehicle routing problem with backhauls, Variable neighbourhood search: Methods and applications, Robust Data-Driven Vehicle Routing with Time Windows, A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- The savings algorithm for the vehicle routing problem
- A tabu search algorithm for the vehicle routing problem
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Variable neighborhood search
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Solving the vehicle routing problem with adaptive memory programming methodology
- An improved ant system algorithm for the vehicle routing problem
- BoneRoute: An adaptive memory-based method for effective fleet management
- A visual interactive approach to vehicle routing
- A genetic algorithm for the vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- The Truck Dispatching Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Parallel iterative search methods for vehicle routing problems
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- A guide to vehicle routing heuristics
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- The Traveling-Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
