Discrete Particle Swarm Optimization Algorithm for Weighted Traveling Salesman Problem

被引：1

作者：

Zeng, Hua ^{[1
]}

Liu, Peng ^{[1
]}

Shen, Changpeng ^{[1
]}

Wu, Yaohua ^{[1
]}

机构：

[1] Shandong Univ, Sch Control Sci & Engn, Jinan 250100, Shandong, Peoples R China

来源：

2010 8TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA) | 2010年

关键词：

combinatorial optimization; traveling salesman problem; discrete particle swarm optimization; cargo weight;

D O I：

10.1109/WCICA.2010.5554674

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In traveling salesman problem, transportation cost is determined by not only distance, but also the cargo weight on the way. Influence of cargo weight on transportation cost is analyzed, and a weighted traveling salesman problem (WTSP) model is given. In WTSP model, cities with larger demands should have priority to be served for minimal cost. A discrete particle swarm optimization algorithm named DPSO is proposed, in which the inertia weight is adjusted by a linear decreasing function of time. Comparison analysis between DPSO and existing algorithms has been done, and simulation results show that the new algorithm is reasonable and effective.

引用

页码：2008 / 2013

页数：6

共 4 条

[1] Clerc M., 2000, Discrete particle swarm optimization illustrated by the traveling salesman problem
[2] THE TRUCK DISPATCHING PROBLEM
DANTZIG, GB
RAMSER, JH
[J]. MANAGEMENT SCIENCE, 1959, 6 (01) : 80 - 91
[3] Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[4] A modified particle swarm optimizer
Shi, YH
Eberhart, R
[J]. 1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 69 - 73

← 1 →