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
相关论文
共 50 条
  • [1] Novel discrete Particle Swarm Optimization to solve Traveling Salesman Problem
    Zhong, Wen-liang
    Zhang, Jun
    Chen, Wei-neng
    [J]. 2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 3283 - 3287
  • [2] A discrete particle swarm optimization algorithm for travelling salesman problem
    Shi, X. H.
    Zhou, Y.
    Wang, L. M.
    Wang, Q. X.
    Liang, Y. C.
    [J]. COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 1063 - +
  • [3] Intuitionistic Fuzzy Hybrid Discrete Particle Swarm Optimization for Solving Travelling Salesman Problem
    Mei, Hai-Tao
    Hua, Ji-Xue
    Wang, Yi
    Wen, Tong
    [J]. PROCEEDINGS OF THE 2016 5TH INTERNATIONAL CONFERENCE ON ADVANCED MATERIALS AND COMPUTER SCIENCE, 2016, 80 : 765 - 771
  • [4] A Novel Discrete Particle Swarm Optimization Algorithm for the Travelling Salesman Problems
    Sequeiros, Jose A.
    Silva, Rui
    Santos, Andre S.
    Bastos, J.
    Varela, M. L. R.
    Madureira, A. M.
    [J]. INNOVATIONS IN INDUSTRIAL ENGINEERING, 2022, : 48 - 55
  • [5] A Novel Approach to Solve Graph based Travelling Salesman Problem using Particle Swarm Optimization Technique
    Afaq, H.
    Saini, S.
    [J]. 2012 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH (ICCIC), 2012, : 675 - 678
  • [6] A Novel Discrete Particle Swarm Optimization For Travelling Salesman Problem Based on Dissipative Structure Theory
    Lai, TingHao
    Sun, HeMin
    Li, Hao
    [J]. PROCEEDINGS OF 2020 3RD INTERNATIONAL CONFERENCE ON UNMANNED SYSTEMS (ICUS), 2020, : 423 - 427
  • [7] A hybrid discrete particle swarm optimization for the traveling salesman problem
    Li, Xiangyong
    Tian, Peng
    Hua, Jing
    Zhong, Ning
    [J]. SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 181 - 188
  • [8] A Novel Adaptive Particle Swarm Optimization to Solve Traveling Salesman Problem
    Song, Weitang
    Zhang, Shumei
    [J]. 2009 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL II, 2009, : 459 - 462
  • [9] Discrete cuttlefish optimization algorithm to solve the travelling salesman problem
    Riffi, Mohammed Essaid
    Bouzidi, Morad
    [J]. PROCEEDINGS OF 2015 THIRD IEEE WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS), 2015,
  • [10] A Novel Hybrid Penguins Search Optimization Algorithm to Solve Travelling Salesman Problem
    Mzili, Ilyass
    Bouzidi, Morad
    Riffi, Mohammed Essaid
    [J]. PROCEEDINGS OF 2015 THIRD IEEE WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS), 2015,
12345