A backtracking adaptive threshold accepting algorithm for the vehicle routing problem

Authors:
C. D. Tarantilis;C. T. Kiranoudis;V. S. Vassiliadis
Affiliations:
Department of Chemical Engineering, National Technical University of Athens, Zografou Campus, Athens 15780, Greece;Department of Chemical Engineering, National Technical University of Athens, Zografou Campus, Athens 15780, Greece;Department of Chemical Engineering, University of Cambridge, Pembroke Street, Cambridge CB2 3RA, United Kingdom
Venue:
Systems Analysis Modelling Simulation
Year:
2002

Citing 13
Cited 6

Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Parallel savings based heuristics for the delivery problem

Operations Research
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
New optimization heuristics

Journal of Computational Physics
Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
A tabu search heuristic for the vehicle routing problem

Management Science
A tabu search heuristic for the multi-depot vehicle routing problem

Computers and Operations Research
A tabu search algorithm for the vehicle routing problem

Computers and Operations Research
Classical heuristics for the capacitated VRP

The vehicle routing problem
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

INFORMS Journal on Computing
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

INFORMS Journal on Computing

Solving the vehicle routing problem with adaptive memory programming methodology

Computers and Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems

Computers and Operations Research
A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem

Expert Systems with Applications: An International Journal
A hybrid particle swarm optimization algorithm for the vehicle routing problem

Engineering Applications of Artificial Intelligence
A self-adaptive local search algorithm for the classical vehicle routing problem

Expert Systems with Applications: An International Journal
Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing Problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this study is to describe a new stochastic search metaheuristic algorithm for solving the capacitated Vehicle Routing Problem, termed as the Backtracking Adaptive Threshold Accepting (BATA) algorithm. Our effort focuses on developing an innovative method, which produces reliable and high quality solutions in a reasonable amount of time, without requiring substantial parameter tuning. BATA belongs to the class of threshold accepting algorithms. Its main difference over a typical threshold-accepting algorithm is that during the optimization process, the value of the threshold not only is lowered but also raised, or backtracked, depending on the success of the inner loop iterations to provide an acceptable new configuration (set of routes) replacing the previous one. This adaptation of the value of the threshold, plays an important role in finding the high quality solutions demonstrated in computational results presented in this study.