z-logo
open-access-imgOpen Access
A Hybrid Particle Swarm Optimization with Genetic Operator for Vehicle Routing Problem
Author(s) -
Geetha Shanmugam,
G. Poonthalir,
P. T. Vanathi
Publication year - 2010
Publication title -
journal of advances in information technology
Language(s) - English
Resource type - Journals
ISSN - 1798-2340
DOI - 10.4304/jait.1.4.181-188
Subject(s) - particle swarm optimization , computer science , mathematical optimization , vehicle routing problem , operator (biology) , multi swarm optimization , routing (electronic design automation) , mathematics , algorithm , computer network , biology , genetics , gene , repressor , transcription factor

The Vehicle Routing Problem (VRP) is a NP-hard and Combinatorial optimization problem. Combinatorial optimization problem can be viewed as searching for best element in a set of discrete items, which can be solved using search algorithm or meta heuristic. In this work, VRP is solved using population based search algorithm, Particle Swarm Optimization (PSO) with crossover and mutation operators. In this paper, the PSO for VRP is considered from two aspects: the hybrid PSO algorithm and particle encoding method. The technical details required for this application are discussed. The computational result shows that the results of hybrid PSO for VRP are competitive.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here