Autor: Kwiecien, J - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Comparison of firefly and cockroach algorithms in selected discrete and combinatorial problems
Autorzy:: Kwiecień, J.
Filipowicz, B.
Powiązania:: https://bibliotekanauki.pl/articles/200148.pdf
Data publikacji:: 2014
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: queueing systems
flow shop scheduling
firefly algorithm
cockroach algorithm
systemy kolejkowe
planowanie przepływów
algorytm świetlika
algorytm karaluch
Opis:: 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.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 797-804
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Firefly algorithm in optimization of queueing systems
Autorzy:: Kwiecień, J.
Filipowicz, B.
Powiązania:: https://bibliotekanauki.pl/articles/201299.pdf
Data publikacji:: 2012
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: queueing systems
firefly algorithm
Opis:: Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 363-368
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: A comparison of nature inspired algorithms for the quadratic assignment problem
Autorzy:: Chmiel, W.
Kadłuczka, P.
Kwiecień, J.
Filipowicz, B.
Powiązania:: https://bibliotekanauki.pl/articles/202135.pdf
Data publikacji:: 2017
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: permutation problem
quadratic assignment problem
ant algorithm
bees algorithm
problem permutacji
problem przydziału kwadratowego
algorytm Ant Colony
algorytm pszczół
Opis:: This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 513-522
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja