An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
From MaRDI portal
Publication:875422
DOI10.1016/J.COR.2005.10.010zbMATH Open1141.90429OpenAlexW2008146930WikidataQ110038537 ScholiaQ110038537MaRDI QIDQ875422FDOQ875422
Authors: Jari Kytöjoki, Teemu Nuortio, Olli Bräysy, Michel Gendreau 
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
Recommendations
- Efficiently solving very large-scale routing problems
- Very large-scale vehicle routing: new test problems, algorithms, and results
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- A general heuristic for vehicle routing problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- BoneRoute: An adaptive memory-based method for effective fleet management
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Title not available (Why is that?)
- A genetic algorithm for the vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- The truck dispatching problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A unified tabu search heuristic for vehicle routing problems with time windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- Variable neighborhood search
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- The savings algorithm for the vehicle routing problem
- Fast local search and guided local search and their application to British Telecom's workforce scheduling 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
- Parallel iterative search methods for vehicle routing problems
- Title not available (Why is that?)
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- A tabu search algorithm for the vehicle routing problem
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints
- The granular tabu search and its application to the vehicle-routing problem
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- The traveling-salesman problem
- New heuristics for the vehicle routing problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A visual interactive approach to vehicle routing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A guide to vehicle routing heuristics
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- Title not available (Why is that?)
- An improved ant system algorithm for the vehicle routing problem
- Title not available (Why is that?)
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
Cited In (52)
- A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation
- Waste collection routing: a survey on problems and methods
- Solving the petroleum replenishment and routing problem with variable demands and time windows
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- Heuristics for vehicle routing problems: sequence or set optimization?
- Knowledge-guided local search for the vehicle routing problem
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search
- Heuristics for large constrained vehicle routing problems
- A fast multi-neighborhood iterated local search algorithm for vehicle routing problems
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- Efficiently solving very large-scale routing problems
- Solving the vehicle routing problem with adaptive memory programming methodology
- Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses
- Dynamic vehicle routing using an improved variable neighborhood search algorithm
- Variable neighbourhood search: Methods and applications
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
- Variable neighbourhood search: methods and applications
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- On the integrated charge planning with flexible jobs in primary steelmaking processes
- Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders
- An integrated local-search/set-partitioning refinement heuristic for the capacitated 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
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- An adaptive large neighborhood search for relocating vehicles in electric carsharing services
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
- Constructing Two-Level Designs by Concatenation of Strength-3 Orthogonal Arrays
- Collaborative vehicle routing: a survey
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Variable neighbourhood structures for cycle location problems
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows
- Algorithms for the maximum \(k\)-club problem in graphs
- New variable-length data compression scheme for solution representation of meta-heuristics
- Robust data-driven vehicle routing with time windows
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- A library of local search heuristics for the vehicle routing problem
- Neighborhood structures for the container loading problem: a VNS implementation
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- An integer linear programming local search for capacitated vehicle routing problems
- An iterated local search algorithm for the vehicle routing problem with backhauls
- A construction heuristic for finding an initial solution to a very large-scale capacitated vehicle routing problem
- Adaptive large neighborhood search on the graphics processing unit
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Scheduling of automated guided vehicles for tandem quay cranes in automated container terminals
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
- A practical heuristic for a large scale vehicle routing problem
- A variable neighborhood search for solving the multi-vehicle covering tour problem
Uses Software
This page was built for publication: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875422)
