A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem

DOI10.1080/00207160210948zbMath1024.90018OpenAlexW2057071759MaRDI QIDQ4543518

Christos D. Tarantilis, Chris T. Kiranoudis, V. S. Vassiladis

Publication date: 30 November 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160210948

zbMATH Keywords

logistics networksstochastic search meta-heuristic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items

An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ Dispatching of small containers via coastal freight liners: The case of the Aegean sea. ⋮ A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm ⋮ AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS ⋮ Honey bees mating optimization algorithm for large scale vehicle routing problems ⋮ Solving the vehicle routing problem with adaptive memory programming methodology ⋮ Threshold accepting heuristic for fair flow optimization in wireless mesh networks

Cites Work

• Unnamed Item
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The savings algorithm for the vehicle routing problem
• A tabu search algorithm for the vehicle routing problem
• Extensions to the generalised assignment heuristic for vehicle routing
• An improved ant system algorithm for the vehicle routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Parallel iterative search methods for vehicle routing problems
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• A Location Based Heuristic for General Routing Problems
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem