Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
From MaRDI portal
Publication:1694919
DOI10.1016/j.ejor.2017.04.046zbMath1380.90046OpenAlexW2613474978MaRDI QIDQ1694919
Martin Josef Geiger, Sandra Huber
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.04.046
vehicle routing problemvariable neighborhood searchorder of neighborhood operatorsparallel heuristicVeRoLog solver challenge
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
The doubly open park-and-loop routing problem ⋮ Stochastic local search with learning automaton for the swap-body vehicle routing problem ⋮ An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping ⋮ The road train optimization problem with load assignment ⋮ An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots ⋮ A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles ⋮ Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
Cites Work
- Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
- The \(k\)-dissimilar vehicle routing problem
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- An iterated local search heuristic for the split delivery vehicle routing problem
- Truck and trailer routing -- problems, heuristics and computational experience
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- Variable neighbourhood search: methods and applications
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Variable neighborhood search
- A general variable neighborhood search for the swap-body vehicle routing problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A matheuristic for the truck and trailer routing problem
- A variable neighborhood search heuristic for periodic routing problems
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- First vs. best improvement: an empirical study
- An iterated local search algorithm for the vehicle routing problem with backhauls
- A tabu search heuristic for the truck and trailer routing problem
- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
- Parallel Variable Neighborhood Search
- Computer Solutions of the Traveling Salesman Problem
- Handbook of metaheuristics
This page was built for publication: Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
