An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
From MaRDI portal
(Redirected from Publication:1040972)
Recommendations
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- A new tabu search heuristic for the open vehicle routing problem
- A variable neighbourhood search algorithm for the open vehicle routing problem
- An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems
- A heuristic method for the open vehicle routing problem
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- A general heuristic for vehicle routing problems
- A heuristic method for the open vehicle routing problem
- A hybrid evolution strategy for the open vehicle routing problem
- 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
- A tabu search algorithm for the open vehicle routing problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A threshold accepting approach to the Open Vehicle Routing problem
- A variable neighbourhood search algorithm for the open vehicle routing problem
- An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems
- Combination of geographical information system and efficient routing algorithms for real life distribution operations.
- Fibonacci heaps and their uses in improved network optimization algorithms
- Future paths for integer programming and links to artificial intelligence
- Integrating multi-product production and distribution in newspaper logistics
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
- The attribute based hill climber
- The granular tabu search and its application to the vehicle-routing problem
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- The school bus routing problem: a case study
- Variable neighborhood search: Principles and applications
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited in
(13)- A hybrid genetic 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
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
- A multi-start algorithm for a balanced real-world open vehicle routing problem
- A hybrid algorithm for a class of vehicle routing problems
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- The close-open mixed vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A unified solution framework for multi-attribute vehicle routing problems
- The open vehicle routing problem with decoupling points
- On the exact solution of the multi-depot open vehicle routing problem
This page was built for publication: An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040972)
