An iterated local search algorithm for the vehicle routing problem with backhauls
From MaRDI portal
Publication:2514876
DOI10.1016/j.ejor.2014.02.011zbMath1304.90041OpenAlexW2007907580MaRDI QIDQ2514876
Peter Goos, Kenneth Sörensen, Daniel Palhazi Cuervo, Emely Arráiz
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://repository.uantwerpen.be/docman/irua/731304/09ef1d8e.pdf
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music ⋮ A deterministic iterated local search algorithm for the vehicle routing problem with backhauls ⋮ A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls ⋮ The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ Vehicle routing for milk collection with gradual blending: a case arising in Chile ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ A multilevel evaluation method for heuristics with an application to the VRPTW ⋮ Order matters -- a variable neighborhood search for the swap-body vehicle routing problem ⋮ Solution strategies for the vehicle routing problem with backhauls ⋮ A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs ⋮ Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Iterated local search for the team orienteering problem with time windows
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- The vehicle routing problem with backhauls
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- Guided local search and its application to the traveling salesman problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- A new tabu search algorithm for the vehicle routing problem with backhauls
- Iterated local search for the quadratic assignment problem
- The Truck Dispatching Problem
- An Exact Method for the Vehicle Routing Problem with Backhauls
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Encyclopedia of Operations Research and Management Science
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: An iterated local search algorithm for the vehicle routing problem with backhauls
