Solving the vehicle routing problem with adaptive memory programming methodology

Authors:
C. D. Tarantilis
Affiliations:
Management Science Laboratory (MSL), Department of Management Science and Technology, Athens University of Economics and Business, 9th Floor, Room 913, 47A Evelpidon Street and 33 Lefkados Street, ...
Venue:
Computers and Operations Research
Year:
2005

Citing 17
Cited 24

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem

Management Science
A Subpath Ejection Method for the Vehicle Routing Problem

Management Science
A tabu search algorithm for the vehicle routing problem

Computers and Operations Research
Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms

Parallel Computing
The vehicle routing problem

The vehicle routing problem
An overview of vehicle routing problems

The vehicle routing problem
Metaheuristics for the capacitated VRP

The vehicle routing problem
Tabu Search

Tabu Search
Using Experimental Design to Find Effective Parameter Settings for Heuristics

Journal of Heuristics
A Savings Based Ant System For The Vehicle Routing Problem

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A genetic algorithm for the vehicle routing problem

Computers and Operations Research
A backtracking adaptive threshold accepting algorithm for the vehicle routing problem

Systems Analysis Modelling Simulation
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
A hybrid genetic algorithm for the capacitated vehicle routing problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

An adaptive memory programming method for risk logistics operations

International Journal of Systems Science
Guest Editors' Introduction: Advanced Heuristics in Transportation and Logistics

IEEE Intelligent Systems
Path relinking for the vehicle routing problem

Journal of Heuristics
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
Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering

Computers and Operations Research
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

Journal of Heuristics
Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem

Transportation Science
A hybrid evolution strategy for the open vehicle routing problem

Computers and Operations Research
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem

Expert Systems with Applications: An International Journal
A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem

Expert Systems with Applications: An International Journal
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows

IEEE Transactions on Evolutionary Computation
Fifty Years of Vehicle Routing

Transportation Science
Honey Bees Mating Optimization algorithm for large scale vehicle routing problems

Natural Computing: an international journal
A hybrid particle swarm optimization algorithm for the vehicle routing problem

Engineering Applications of Artificial Intelligence
Efficient local search limitation strategies for vehicle routing problems

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Computers and Operations Research
A self-adaptive local search algorithm for the classical vehicle routing problem

Expert Systems with Applications: An International Journal
A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem

Expert Systems with Applications: An International Journal
A template-based Tabu Search algorithm for the Consistent Vehicle Routing Problem

Expert Systems with Applications: An International Journal
A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing Problem

Expert Systems with Applications: An International Journal
Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands

Applied Soft Computing
Adaptive Path Relinking for Vehicle Routing and Scheduling Problems with Product Returns

Transportation Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

In this paper we develop an adaptive memory programming method for solving the capacitated vehicle routing problem called Solutions' Elite PArts Search (SEPAS). This iterative method, first generates initial solutions via a systematic diversification technique and stores their routes in an adaptive memory. Subsequently, a constructive heuristic merges route components (called elite parts) from those in the adaptive memory. Finally, a tabu search approach improves the heuristically constructed solution and the adaptive memory is appropriately updated. SEPAS has been tested on two benchmark data sets and provides high quality solutions in short computational times for all problem instances. The method reaches several new best solutions for benchmark instances with a large number of customers.