A multi-start algorithm for a balanced real-world open vehicle routing problem
DOI10.1016/J.EJOR.2014.04.008zbMATH Open1339.90014OpenAlexW1996875951MaRDI QIDQ296700FDOQ296700
Authors: Alfredo G. Hernández-Díaz, Daniele Vigo, Rafael Caballero, Julian Molina, A. D. López-Sánchez
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
Recommendations
- The school bus routing problem: a case study
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- A multi-start local search algorithm for the vehicle routing problem with time windows
- A hybrid genetic algorithm for the multi-depot open vehicle routing problem
- scientific article; zbMATH DE number 1683927
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06)
Cites Work
- A hybrid evolution strategy for the open vehicle routing problem
- Title not available (Why is that?)
- A new tabu search heuristic for the open vehicle routing problem
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
- 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.
- Title not available (Why is that?)
- Tabu search for a multi-objective routing problem
- Use of Ranks in One-Criterion Variance Analysis
- An ILP improvement procedure for the open vehicle routing problem
Cited In (6)
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
- A matheuristic for the MinMax capacitated open vehicle routing problem
- A practical vehicle routing problem with desynchronized arrivals to depot
- The open vehicle routing problem with decoupling points
- The probabilistic uncapacitated open vehicle routing location problem
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
Uses Software
This page was built for publication: A multi-start algorithm for a balanced real-world open vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296700)