Journal of Computational Physics
The vehicle routing problem
Classical heuristics for the capacitated VRP
The vehicle routing problem
A backtracking adaptive threshold accepting algorithm for the vehicle routing problem
Systems Analysis Modelling Simulation
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
INFORMS Journal on Computing
D-Ants: savings based ants divide and conquer the vehicle routing problem
Computers and Operations Research
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
Solving the vehicle routing problem with adaptive memory programming methodology
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Operations Research
Tuning Metaheuristics: A Machine Learning Perspective
Tuning Metaheuristics: A Machine Learning Perspective
Parameter control in evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Vehicle routing problem with time windows considering overtime and outsourcing vehicles
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows
Computers and Industrial Engineering
Hi-index | 12.06 |
The purpose of this study is introduction of a local search heuristic free from parameter tuning to solve classical vehicle routing problem (VRP). The VRP can be described as the problem of designing optimal delivery of routes from one depot to a number of customers under the limitations of side constraints to minimize the total traveling cost. The importance of this problem comes from practical as well as theoretical point of view. The proposed heuristic, self-adaptive local search (SALS), has one generic parameter which is learnt throughout the search process. Computational experiments confirm that SALS gives high qualified solutions to the VRP and ensures at least an average performance, in terms of efficiency and effectiveness, on the problem when compared with the recent and sophisticated approaches from the literature. The most important advantage of the proposed heuristic is the application convenience for the end-users. SALS also is flexible that can be easily applied to variations of VRP.