Mixed Climbing Particle Swarm Algorithm in the VRP

In the vehicle routing problem (VRP), it is usually difficult to confederate the cargo and arrange vehicles path. Due to performance reasons, the traditional shortest path algorithm can not be applied to the large scale of VRP. On the basis of the VRP mathematical model, this paper constructs a mixe...

Full description

Saved in:
Bibliographic Details
Published in2012 Second International Conference on Business Computing and Global Informatization pp. 554 - 557
Main Authors Binda Wang, Kejing Wang, Fuguang Bao, Lei Zhang, Li Shen
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2012
Subjects
cycling path optimization
Equations
Logistics
Mathematical model
mixed climbing particle swarm algorithm
Optimization
Particle swarm optimization
Resource management
task allocation
Vehicles
VRP
Online AccessGet full text

Cover

More Information
Summary:In the vehicle routing problem (VRP), it is usually difficult to confederate the cargo and arrange vehicles path. Due to performance reasons, the traditional shortest path algorithm can not be applied to the large scale of VRP. On the basis of the VRP mathematical model, this paper constructs a mixed climbing particle swarm algorithms to solve the problem. First, through coding, the VRP problem is divided into two sub-problems: task allocation and single vehicle path optimization. Particle swarm algorithm is in charge of controlling the overall situation and allocating task, while hill-climbing algorithm is responsible for calculating the vehicle path optimization (fitness). Finally, by performing experiments in MATLAB programming and comparison of the operational results of the matrix method and genetic algorithm, the algorithm is shown to be feasible in solving VRP and have higher practicability.
ISBN:1467344699
9781467344692
ISSN:2378-8941
2378-895X
DOI:10.1109/BCGIN.2012.150