Bio-inspired metaheuristics for the vehicle routing problem

Authors:
Daniela Ponce
Affiliations:
Department of Information Technologies, Faculty of Informatics and Management, University of Hradec Králové, Hradec Králové, Czech Republic
Venue:
ACS'09 Proceedings of the 9th WSEAS international conference on Applied computer science
Year:
2009

Citing 7
Cited 1

An overview of vehicle routing problems

The vehicle routing problem
Classical heuristics for the capacitated VRP

The vehicle routing problem
Metaheuristics for the capacitated VRP

The vehicle routing problem
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
Analysis of the publications on the applications of particle swarm optimisation

Journal of Artificial Evolution and Applications - Regular issue
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery

Computers and Operations Research

Software framework for vehicle routing problem with hybrid metaheuristic algorithms

ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

The paper proposes a metaheuristic algorithm based on particle swarm optimization (PSO) for the problem of vehicle routing (VRP). A direct sequence-based representation of VRP solution is defined, i.e. each particle represents a set of feasible vehicle routes. After initial routes have been constructed, a modified edge recombination crossover operator is used to move particles towards better solutions. The paper presents early results on application of the proposed PSO algorithm to VRP.