Active-guided evolution strategies for large-scale capacitated vehicle routing problems

Authors:
David Mester;Olli Bräysy
Affiliations:
Mathematical and Population Genetics Laboratory, Institute of Evolution, University of Haifa, 31905 Haifa, Israel;Agora Innoroad Laboratory, Agora Center, University of Jyväskylä, P.O. Box 35, FI-40014, Finland
Venue:
Computers and Operations Research
Year:
2007

Citing 15
Cited 37

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

Annals of Operations Research - Special issue on Tabu search
Branch-and-bound algorithms for the capacitated VRP

The vehicle routing problem
Branch-and-cut algorithms for the capacitated VRP

The vehicle routing problem
Set-covering-based algorithms for the capacitated VRP

The vehicle routing problem
Classical heuristics for the capacitated VRP

The vehicle routing problem
Metaheuristics for the capacitated VRP

The vehicle routing problem
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
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows

Transportation Science
Fast and high precision algorithms for optimization in large-scale genomic problems

Computational Biology and Chemistry

A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service

Expert Systems with Applications: An International Journal
An evolutionary-based decision support system for vehicle routing: The case of a public utility

Decision Support Systems
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem

Applied Soft Computing
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
Fifty Years of Vehicle Routing

Transportation Science
A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem

IEEE Transactions on Intelligent Transportation Systems
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
Balanced K-means algorithm for partitioning areas in large-scale vehicle routing problem

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Computers and Operations Research
Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism

Journal of Heuristics
Survey: matheuristics for rich vehicle routing problems

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A self-adaptive local search algorithm for the classical vehicle routing problem

Expert Systems with Applications: An International Journal
A Parallel Algorithm for the Vehicle Routing Problem

INFORMS Journal on Computing
Solving the capacitated vehicle routing problem with maximum traveling distance and service time requirements: an approach based on Monte Carlo simulation

Winter Simulation Conference
An agent-based guided local search for the capacited vehicle routing problem

KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Multi-cellular-ant algorithm for large scale capacity vehicle route problem

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints

Computers and Operations Research
A (μ, λ)-coordination mechanism for agent-based multi-project scheduling

OR Spectrum
Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing Problem

Expert Systems with Applications: An International Journal
Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem

Annals of Mathematics and Artificial Intelligence
Development of a maritime transportation planning support system for car carriers based on genetic algorithm

Applied Intelligence
Fast and high precision algorithms for optimization in large-scale genomic problems

Computational Biology and Chemistry
Hybrid artificial intelligence approaches on vehicle routing problem in logistics distribution

HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
Vehicle routing problem with time windows considering overtime and outsourcing vehicles

Expert Systems with Applications: An International Journal
The Pallet-Packing Vehicle Routing Problem

Transportation Science
A Parallel Algorithm for the Vehicle Routing Problem

INFORMS Journal on Computing
Efficient local search on the GPU-Investigations on the vehicle routing problem

Journal of Parallel and Distributed Computing
Packing first, routing second-a heuristic for the vehicle routing and loading problem

Computers and Operations Research
Combinatorial neighborhood topology particle swarm optimization algorithm for the vehicle routing problem

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows

Computers and Industrial Engineering
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas

Transportation Science
Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem

Computers and Operations Research
A cooperative parallel metaheuristic for the capacitated vehicle routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present an adaptation of the active-guided evolution strategies metaheuristic for the capacitated vehicle routing problem. The capacitated vehicle routing problem is a classical problem in operations research in which a set of minimum total cost routes must be determined for a fleet of identical capacitated vehicles in order to service a number of demand or supply points. The applied metaheuristic combines the strengths of the well-known guided local search and evolution strategies metaheuristics into an iterative two-stage procedure. The computational experiments were carried out on a set of 76 benchmark problems. The results demonstrate that the suggested method is highly competitive, providing the best-known solutions to 70 test instances.