A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
DOI10.1016/j.cor.2019.04.021zbMath1458.90138OpenAlexW2943166133WikidataQ127937402 ScholiaQ127937402MaRDI QIDQ2003572
Mahdi Moeini, Oliver Wendt, Daniel Schermer
Publication date: 9 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.021
heuristicsmetaheuristicstabu searchvalid inequalitiesvehicle routing problemvariable neighborhood searchdroneslast-mile delivery
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (24)
Uses Software
Cites Work
- Unnamed Item
- The vehicle routing problem with drones: several worst-case results
- Parallel depth first search. I: Implementation
- Parallel depth first search. II: Analysis
- Variable neighborhood search
- Variable neighborhood search: basics and variants
- Future paths for integer programming and links to artificial intelligence
- The Vehicle Routing Problem
- Integer Programming Formulation of Traveling Salesman Problems
- The vehicle routing problem with drones: Extended models and connections
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Handbook of metaheuristics
This page was built for publication: A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations