Discrete cat swarm optimization algorithm applied to combinatorial optimization problems

Author

Bouzidi, Abdelhamid ; Riffi, Mohammed Essaid

Author_Institution

Dept. of Comput. Sci., Chouaib Doukkali Univ., El-Jadida, Morocco

fYear

2014

Firstpage

30

Lastpage

34

Abstract

The traveling salesman problem (TSP), and the quadratic assignment problem (QAP) are two combinatorial optimization problems with a diverse set of applications. This research paper aims to apply the adaptation of discrete cat swarm optimization algorithm inspired by the natural behavior of cats to solve TSP and QAP. Simulated experiments were conducted on several benchmark instances taken from the OR-library. The results show the effectiveness of the proposed adaptation to solve real applications area based on the two-studied problems.

Keywords

swarm intelligence; travelling salesman problems; OR-library; combinatorial optimization problems; discrete cat swarm optimization algorithm; quadratic assignment problem; traveling salesman problem; Cats; Optimized production technology; Particle swarm optimization; Computationally intelligent; Discrete cat swarm optimization; Quadratic assignment problem; Traveling salesman problem; combinatorial optimization problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Codes, Cryptography and Communication Systems (WCCCS), 2014 5th Workshop on

Print_ISBN

978-1-4799-7053-7

Type

conf

DOI

10.1109/WCCCS.2014.7107914

Filename

7107914