Particle swarm optimization for open vehicle routing problem

Authors:
Wanliang Wang;Bin Wu;Yanwei Zhao;Dingzhong Feng
Affiliations:
College of Information Engineering, Zhejiang University of Technology, Hangzhou, China;College of Information Engineering, Zhejiang University of Technology, Hangzhou, China;College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou, China;College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou, China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
Year:
2006

Citing 2
Cited 1

New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Parameter Selection in Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII

A honey bees mating optimization algorithm for the open vehicle routing problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Open Vehicle Routing Problem was brought forward several decades ago, but it has still received little attention from researchers for a satisfactory solution. In this paper, a novel real number encoding method of Particle Swarm Optimization (PSO) for Open Vehicle Routing Problem is proposed. The vehicle is mapped into the integer part of the real number; and the sequence of customers in the vehicle is mapped into the decimal fraction of the real number. After decoding, several heurist methods are applied into the post-optimization procedure, such as Nearest Insertion algorithm, GENI algorithm, and 2-Opt. They are used to optimize the inner or outer routes and modify illegal solutions. In the experiments, a number of numerical examples are carried out for testing and verification. The performance of the proposed postoptimization algorithm is analyzed and the particle swarm optimization algorithm is compared with other heuristic methods for the same problem.