Discrete Novel Hybrid Particle Swarm Optimization To Solve Travelling Salesman Problem

被引：0

作者：

Bouzidi, Morad ^{[1
]}

Essaid Riffi, Mohammed ^{[1
]}

机构：

[1] Chouaib Doukkali Univ, Fac Sci, Dept Comp Sci, Lab LAROSERI, EI Jadida, Morocco

来源：

2014 5TH WORKSHOP ON CODES, CRYPTOGRAPHY AND COMMUNICATION SYSTEMS (WCCCS' 14) | 2014年

关键词：

Metaheuristics; optimization problem; harmony search; particle swarm optimization; discrete new hybrid particle swarm optimization; travelling salesman problem; ALGORITHM; SEARCH;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

Metaheuristics is a set of intelligent nature inspired method, it aims to solve some optimization problems, such as quadratic assignment problem, knapsack problem, and graph colouring problem. Resolving an optimization problem consist in applying a mathematic process to find the minimum or the maximum solution depending on the constraints of the problem. In this paper, the travelling salesman problem is chosen to test the performance of a new proposed discrete novel hybrid particle swarm optimization. This method presents a combination between particle swarm optimization and harmony search algorithm, where harmony search improved the swarm. An experimental result of a different methaheuristics shows the efficiency of the proposed method for solving some benchmarks instances of TSPLib.

引用

页码：17 / 20

页数：4

共 19 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness

[2]

[Anonymous], NEW OPTIMIZATION TEC

[3]

[Anonymous], P P 6 INT S MICR HUM

[4]

Bouzidi M., 2014, J THEORETICAL APPL I, V62

[5]

Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892

[6] A PARALLEL TABU SEARCH ALGORITHM FOR LARGE TRAVELING SALESMAN PROBLEMS [J].

FIECHTER, CN .

DISCRETE APPLIED MATHEMATICS, 1994, 51 (03) :243-267

[7]

Filip Exnar, 2011, WSEAS Transactions on Business and Economics, V8, P163

[8]

GAVISH B, 1978, OR07878 MIT

[9] A new heuristic optimization algorithm: Harmony search [J].

Geem, ZW ;

Kim, JH ;

Loganathan, GV .

SIMULATION, 2001, 76 (02) :60-68

[10]

Hua-fu D., 2011, COMP SCI AUT ENG CSA, V1, P58

← 1 2 →