Journal Search Engine
Search Advanced Search Adode Reader(link)
Download PDF Export Citaion korean bibliography PMC previewer
ISSN : 2005-0461(Print)
ISSN : 2287-7975(Online)
Journal of Society of Korea Industrial and Systems Engineering Vol.33 No.4 pp.58-68
DOI :

순서화 문제에서 01산적 Particle Swarm Optimization들의 성능 비교

임동순
한남대학교 산업경영공학과

Performance Comparison of Discrete Particle Swarm Optimizations in Sequencing Problems

D S Yim
Dept. of Industrial and Management Engineering, Hannam University
[$AuthorMark7$]

Abstract

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

Reference