A threshold accepting approach to the Open Vehicle Routing problem
DOI10.1051/RO:2004029zbMATH Open1114.90063OpenAlexW2084767430MaRDI QIDQ5693012FDOQ5693012
Authors: 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
Recommendations
- A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- The open vehicle routing problem with decoupling points
- A heuristic method for the open vehicle routing problem
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- A threshold accepting metaheuristic for the vehicle routing problem with time windows.
- A matheuristic for the MinMax capacitated open vehicle routing problem
- A tabu search algorithm for the open vehicle routing problem
- The open vehicle routing problem with time windows
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- BoneRoute: An adaptive memory-based method for effective fleet management
- Optimization by simulated annealing
- A heuristic method for the open vehicle routing problem
- Title not available (Why is that?)
- A tabu search algorithm for the open vehicle routing problem
- Title not available (Why is that?)
- A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Title not available (Why is that?)
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- New heuristics for the vehicle routing problem
- A guide to vehicle routing heuristics
- Title not available (Why is that?)
- A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
- A threshold accepting metaheuristic for the vehicle routing problem with time windows.
Cited In (10)
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
- A hybrid evolution strategy for the open vehicle routing problem
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
- An ILP improvement procedure for the open vehicle routing problem
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- A tabu search algorithm with controlled randomization for constructing feasible university course timetables
- A simulated annealing heuristic for the open location-routing problem
- The open vehicle routing problem with decoupling points
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
Uses Software
This page was built for publication: A threshold accepting approach to the Open Vehicle Routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693012)