Multi-threaded Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem

Krisztian Balazs, Zoltan Horvath, L. Kóczy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper proposes approaches for combining Iterated Greedy techniques, as state-of-the-art methods, with bacterial evolutionary algorithms based on a hybrid technique involving the Multi-Threaded Iterated Greedy heuristic and a memetic algorithm in order to efficiently solve the Permutation Flow Shop Problem on parallel computing architectures. In the present work three novel approaches are proposed by combining a variant of the Bacterial Memetic Algorithm and the recently proposed Bacterial Iterated Greedy technique with the mentioned hybrid multi-threaded approach. The techniques thus obtained are evaluated via simulation runs carried out on a series of data from the well-known Taillard's benchmark problem set. Based on the experimental results the multi-threaded hybrid methods are compared to each other and to the original techniques (i.e. to the techniques without bacterial algorithms).

Original languageEnglish
Title of host publicationCINTI 2012 - 13th IEEE International Symposium on Computational Intelligence and Informatics, Proceedings
Pages63-66
Number of pages4
DOIs
Publication statusPublished - 2012
Event13th IEEE International Symposium on Computational Intelligence and Informatics, CINTI 2012 - Budapest, Hungary
Duration: Nov 20 2012Nov 22 2012

Other

Other13th IEEE International Symposium on Computational Intelligence and Informatics, CINTI 2012
CountryHungary
CityBudapest
Period11/20/1211/22/12

Fingerprint

Parallel processing systems
Evolutionary algorithms

Keywords

  • Bacterial methods
  • Combinatorial optimization
  • Hybrid Iterated Greedy techniques
  • Memetic algorithms
  • Multiple threads
  • Parallel architectures
  • Permutation Flow Shop Problem

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Information Systems

Cite this

Balazs, K., Horvath, Z., & Kóczy, L. (2012). Multi-threaded Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem. In CINTI 2012 - 13th IEEE International Symposium on Computational Intelligence and Informatics, Proceedings (pp. 63-66). [6496734] https://doi.org/10.1109/CINTI.2012.6496734

Multi-threaded Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem. / Balazs, Krisztian; Horvath, Zoltan; Kóczy, L.

CINTI 2012 - 13th IEEE International Symposium on Computational Intelligence and Informatics, Proceedings. 2012. p. 63-66 6496734.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Balazs, K, Horvath, Z & Kóczy, L 2012, Multi-threaded Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem. in CINTI 2012 - 13th IEEE International Symposium on Computational Intelligence and Informatics, Proceedings., 6496734, pp. 63-66, 13th IEEE International Symposium on Computational Intelligence and Informatics, CINTI 2012, Budapest, Hungary, 11/20/12. https://doi.org/10.1109/CINTI.2012.6496734
Balazs K, Horvath Z, Kóczy L. Multi-threaded Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem. In CINTI 2012 - 13th IEEE International Symposium on Computational Intelligence and Informatics, Proceedings. 2012. p. 63-66. 6496734 https://doi.org/10.1109/CINTI.2012.6496734
Balazs, Krisztian ; Horvath, Zoltan ; Kóczy, L. / Multi-threaded Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem. CINTI 2012 - 13th IEEE International Symposium on Computational Intelligence and Informatics, Proceedings. 2012. pp. 63-66
@inproceedings{84084dde78e24810aaa1129d4c6deb09,
title = "Multi-threaded Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem",
abstract = "This paper proposes approaches for combining Iterated Greedy techniques, as state-of-the-art methods, with bacterial evolutionary algorithms based on a hybrid technique involving the Multi-Threaded Iterated Greedy heuristic and a memetic algorithm in order to efficiently solve the Permutation Flow Shop Problem on parallel computing architectures. In the present work three novel approaches are proposed by combining a variant of the Bacterial Memetic Algorithm and the recently proposed Bacterial Iterated Greedy technique with the mentioned hybrid multi-threaded approach. The techniques thus obtained are evaluated via simulation runs carried out on a series of data from the well-known Taillard's benchmark problem set. Based on the experimental results the multi-threaded hybrid methods are compared to each other and to the original techniques (i.e. to the techniques without bacterial algorithms).",
keywords = "Bacterial methods, Combinatorial optimization, Hybrid Iterated Greedy techniques, Memetic algorithms, Multiple threads, Parallel architectures, Permutation Flow Shop Problem",
author = "Krisztian Balazs and Zoltan Horvath and L. K{\'o}czy",
year = "2012",
doi = "10.1109/CINTI.2012.6496734",
language = "English",
isbn = "9781467352062",
pages = "63--66",
booktitle = "CINTI 2012 - 13th IEEE International Symposium on Computational Intelligence and Informatics, Proceedings",

}

TY - GEN

T1 - Multi-threaded Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem

AU - Balazs, Krisztian

AU - Horvath, Zoltan

AU - Kóczy, L.

PY - 2012

Y1 - 2012

N2 - This paper proposes approaches for combining Iterated Greedy techniques, as state-of-the-art methods, with bacterial evolutionary algorithms based on a hybrid technique involving the Multi-Threaded Iterated Greedy heuristic and a memetic algorithm in order to efficiently solve the Permutation Flow Shop Problem on parallel computing architectures. In the present work three novel approaches are proposed by combining a variant of the Bacterial Memetic Algorithm and the recently proposed Bacterial Iterated Greedy technique with the mentioned hybrid multi-threaded approach. The techniques thus obtained are evaluated via simulation runs carried out on a series of data from the well-known Taillard's benchmark problem set. Based on the experimental results the multi-threaded hybrid methods are compared to each other and to the original techniques (i.e. to the techniques without bacterial algorithms).

AB - This paper proposes approaches for combining Iterated Greedy techniques, as state-of-the-art methods, with bacterial evolutionary algorithms based on a hybrid technique involving the Multi-Threaded Iterated Greedy heuristic and a memetic algorithm in order to efficiently solve the Permutation Flow Shop Problem on parallel computing architectures. In the present work three novel approaches are proposed by combining a variant of the Bacterial Memetic Algorithm and the recently proposed Bacterial Iterated Greedy technique with the mentioned hybrid multi-threaded approach. The techniques thus obtained are evaluated via simulation runs carried out on a series of data from the well-known Taillard's benchmark problem set. Based on the experimental results the multi-threaded hybrid methods are compared to each other and to the original techniques (i.e. to the techniques without bacterial algorithms).

KW - Bacterial methods

KW - Combinatorial optimization

KW - Hybrid Iterated Greedy techniques

KW - Memetic algorithms

KW - Multiple threads

KW - Parallel architectures

KW - Permutation Flow Shop Problem

UR - http://www.scopus.com/inward/record.url?scp=84876929329&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876929329&partnerID=8YFLogxK

U2 - 10.1109/CINTI.2012.6496734

DO - 10.1109/CINTI.2012.6496734

M3 - Conference contribution

SN - 9781467352062

SP - 63

EP - 66

BT - CINTI 2012 - 13th IEEE International Symposium on Computational Intelligence and Informatics, Proceedings

ER -