Stochastic local search with learning automaton for the swap-body vehicle routing problem
DOI10.1016/j.cor.2017.08.002zbMath1391.90095OpenAlexW2742448892MaRDI QIDQ1652446
Jan Christiaens, Sam Van Malderen, Túlio A. M. Toffolo, Tony Wauters, Greet vanden Berghe
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.08.002
learning automatametaheuristicslocal searchdecomposition strategiesneighborhood size reductionswap-body vehicle routing problemVeRoLog challenge
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- Vehicle routing problem with trailers
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- A cluster-first route-second approach for the swap body vehicle routing problem
- The late acceptance hill-climbing heuristic
- New benchmark instances for the capacitated vehicle routing problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- A matheuristic for the truck and trailer routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- A tabu search heuristic for the truck and trailer routing problem
- A heuristic approach for the truck and trailer routing problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Method for Solving Traveling-Salesman Problems
- A tabu search method for the truck and trailer routing problem
This page was built for publication: Stochastic local search with learning automaton for the swap-body vehicle routing problem