A multi-start algorithm for a balanced real-world open vehicle routing problem
DOI10.1016/j.ejor.2014.04.008zbMath1339.90014OpenAlexW1996875951MaRDI QIDQ296700
Alfredo G. Hernández-Díaz, Daniele Vigo, Ana D. López-Sánchez, Julian Molina, Rafael Caballero
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.008
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An ILP improvement procedure for the open vehicle routing problem
- A hybrid evolution strategy for the open vehicle routing problem
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Combination of geographical information system and efficient routing algorithms for real life distribution operations.
- Tabu search for a multi-objective routing problem
- A new tabu search heuristic for the open vehicle routing problem
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
- Use of Ranks in One-Criterion Variance Analysis
This page was built for publication: A multi-start algorithm for a balanced real-world open vehicle routing problem