Hybrid particle swarm algorithm for grain logistics vehicle routing problem

Authors:
Yuhua Zhu;Hongyi Ge;Tong Zhen
Affiliations:
School of Journalism and Communication, Henan University of Technology, Zhengzhou, China;College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China;College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 1
Cited 3

Particle swarm optimization method in multiobjective problems

Proceedings of the 2002 ACM symposium on Applied computing

Hybrid particle swarm optimization for vehicle routing problem with time windows

MAMECTIS/NOLASC/CONTROL/WAMUS'11 Proceedings of the 13th WSEAS international conference on mathematical methods, computational techniques and intelligent systems, and 10th WSEAS international conference on non-linear analysis, non-linear systems and chaos, and 7th WSEAS international conference on dynamical systems and control, and 11th WSEAS international conference on Wavelet analysis and multirate systems: recent researches in computational techniques, non-linear systems and control
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
Evaluation of vehicle routing problem with time windows by using metaheuristics algorithm

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.00

Visualization

Abstract

In this study, we consider the application of a hybrid particle swarm algorithm to the grain logistics vehicle routing problem with time windows (VRPTW). VRPTW is a variant of the well-known well-studied vehicle routing problem (VRP), which the objective is to use the limited vehicles so that the maximum number of jobs can be completed with minimum cost. Aiming at the characteristics of the large batch and multipoint to multi-point transportation of grain logistics, a hybrid particle swarm optimization (PSO) with simulated annealing (SA) algorithm is proposed to solve grain logistics VRPTM in this paper. In contrast to other existing algorithms, the experimental results manifest that the hybrid algorithm of PSO can solve grain logistics VRPTM quickly, the proposed algorithm is effective, and can reduce the cost of distribution.