A threshold accepting approach to the Open Vehicle Routing problem
From MaRDI portal
Publication:5693012
DOI10.1051/ro:2004029zbMath1114.90063MaRDI QIDQ5693012
Christos D. Tarantilis, Chris T. Kiranoudis, George Ioannou, Gregory P. Prastacos
Publication date: 28 September 2005
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2004__38_4_345_0
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90B80: Discrete location and assignment
Related Items
The open vehicle routing problem: algorithms, large-scale test problems, and computational results, 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
Uses Software
Cites Work
- Optimization by Simulated Annealing
- A tabu search algorithm for the open vehicle routing problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A threshold accepting metaheuristic for the vehicle routing problem with time windows.
- BoneRoute: An adaptive memory-based method for effective fleet management
- A heuristic method for the open vehicle routing problem
- A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A guide to vehicle routing heuristics
- A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
