An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
From MaRDI portal
Publication:1040972
DOI10.1016/j.cor.2009.06.021zbMath1175.90052DBLPjournals/cor/ZachariadisK10OpenAlexW2089659548WikidataQ58646231 ScholiaQ58646231MaRDI QIDQ1040972
Chris T. Kiranoudis, Emmanouil E. Zachariadis
Publication date: 27 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.021
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
A multi-start algorithm for a balanced real-world open vehicle routing problem ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ A hybrid algorithm for a class of vehicle routing problems ⋮ A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ The close-open mixed vehicle routing problem ⋮ The open vehicle routing problem with decoupling points ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- The attribute based hill climber
- A tabu search algorithm for the open vehicle routing problem
- A general heuristic for vehicle routing problems
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- A hybrid evolution strategy for the open vehicle routing problem
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Combination of geographical information system and efficient routing algorithms for real life distribution operations.
- Future paths for integer programming and links to artificial intelligence
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Integrating multi-product production and distribution in newspaper logistics
- Very large-scale vehicle routing: new test problems, algorithms, and results
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A heuristic method for the open vehicle routing problem
- An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- The school bus routing problem: a case study
- A new tabu search heuristic for the open vehicle routing problem
- A simple and efficient tabu search heuristic for solving the open vehicle routing problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
- A threshold accepting approach to the Open Vehicle Routing problem
- Variable neighborhood search: Principles and applications
This page was built for publication: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods