Comparison of firefly and cockroach algorithms in selected discrete and combinatorial problems

被引：11
|
作者：
Kwiecien, J. [1 ]
Filipowicz, B. [1 ]
机构：
[1] AGH Univ Sci & Technol, PL-30059 Krakow, Poland
来源：
BULLETIN OF THE POLISH ACADEMY OF SCIENCES-TECHNICAL SCIENCES | 2014年 / 62卷 / 04期
关键词：
queueing systems; flow shop scheduling; firefly algorithm; cockroach algorithm; TABU SEARCH ALGORITHM; OPTIMIZATION;
D O I：
10.2478/bpasts-2014-0087
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In recent years, newer algorithms inspired by nature have been created and used to solve various problems. Therefore, in the paper we present the application of firefly and cockroach algorithms to optimize two queueing systems and permutation flow shop problems with the objective of minimizing the makespan. The article briefly describes these algorithms to solve selected problems and their results. Because these algorithms were originally developed for continuous optimization problems, we introduce a new formula to transform the position of ith individual to solve the discrete problems.
引用
收藏
页码：797 / 804
页数：8
相关论文
共 50 条
  • [31] Comparison of Selected Steganography Algorithms
    Piotrowski, Zbigniew
    Wojtun, Jaroslaw
    2014 SIGNAL PROCESSING: ALGORITHMS, ARCHITECTURES, ARRANGEMENTS, AND APPLICATIONS (SPA), 2014, : 19 - 24
  • [32] APPROXIMATION ALGORITHMS FOR DISCRETE OPTIMIZATION PROBLEMS
    LIU, CL
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 22 (05): : A597 - A597
  • [33] Discrete visibility problems and graph algorithms
    Puppo, E
    Marzano, P
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 1997, 11 (02) : 139 - 161
  • [34] Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling
    Yang, Zishen
    Wang, Wei
    Shi, Majun
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2021, 188 (03) : 673 - 695
  • [35] Polynomial and Pseudopolynomial Algorithms for Solving Combinatorial Problems.
    Blazewicz, Jacek
    Archiwum Automatyki i Telemechaniki, 1980, 25 (03): : 355 - 366
  • [36] On Class of Genetic Algorithms in Optimization Problems on Combinatorial Configurations
    Yakovlev, Sergiy
    Kartashov, Oleksiy
    Yarovaya, Olga
    2018 IEEE 13TH INTERNATIONAL SCIENTIFIC AND TECHNICAL CONFERENCE ON COMPUTER SCIENCES AND INFORMATION TECHNOLOGIES (CSIT), VOL 1, 2018, : 374 - 377
  • [37] GENERAL APPROXIMATION ALGORITHMS FOR SOME ARITHMETICAL COMBINATORIAL PROBLEMS
    MORAN, S
    THEORETICAL COMPUTER SCIENCE, 1981, 14 (03) : 289 - 303
  • [38] Differential approximation algorithms for some combinatorial optimization problems
    Demange, M
    Grisoni, P
    Paschos, VT
    THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) : 107 - 122
  • [39] Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
    Bourgeois, Nicolas
    Escoffier, Bruno
    Paschos, Vangelis Th.
    ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 507 - +
  • [40] APPROXIMATION ALGORITHMS FOR COMBINATORIAL FRACTIONAL-PROGRAMMING PROBLEMS
    HASHIZUME, S
    FUKUSHIMA, M
    KATOH, N
    IBARAKI, T
    MATHEMATICAL PROGRAMMING, 1987, 37 (03) : 255 - 267
12345