Temat: hybrid metaheuristics - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: An adaptive hybrid metaheuristic for permutation flowshop scheduling
Autorzy:: Moccellin, J.
Santos, M.
Powiązania:: https://bibliotekanauki.pl/articles/206870.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: flowshop sequencing
hybrid metaheuristics
simulated annealing
tabu search
Opis:: In this paper we present a hybrid Tabu Search - Simulated Annealing heuristic fox the minimal makespan flowshop sequencing problem. In order to evaluate the effectiveness of the hybridization we compare the hybrid metaheuristic with pure Tabu Search and Simulated Annealing heuristics. The results from computational experience are discussed.
Źródło:: Control and Cybernetics; 2000, 29, 3; 761-771
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Energy redistribution in autonomous hybridization of agent-based computing
Autorzy:: Godzik, Mateusz
Powiązania:: https://bibliotekanauki.pl/articles/2097959.pdf
Data publikacji:: 2021
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: agent-based computing
hybrid metaheuristics
nature-inspired algorithms
Opis:: Evolutionary multi-agent systems (EMAS) are very good at dealing with diffi cult, multi-dimensional problems. Research is currently underway to improve this algorithm, giving agents even more freedom not only to solve the problem, but also to make decisions about the behavior of the algorithm. One way is to hybridize this algorithm with other existing algorithms to create the Hybrid Evolutionary Multi Agent-System (HEMAS). Unfortunately, such connections generate problems in the form of unbalanced agent energy levels. One solution is to use an agent energy redistribution operator. The article presents three different proposals for such redistribution operators, compared them with each other and selected the best based on the results of numerous experiments.
Źródło:: Computer Science; 2021, 22 (3); 345-365
1508-2806
2300-7036
Pojawia się w:: Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: A critical review of the newest biologically-inspired algorithms for the flowshop scheduling problem
Autorzy:: Duda, J.
Powiązania:: https://bibliotekanauki.pl/articles/1943277.pdf
Data publikacji:: 2007
Wydawca:: Politechnika Gdańska
Tematy:: flowshop scheduling
metaheuristics
local search
hybrid algorithms
Opis:: The three most recent bio-inspired heuristics proposed in the OR literature for solving the flowshop scheduling problem are revised in the paper. All of these algorithms use local search procedures to improve solutions achieved by the main procedure. The author tries to asses the gains from hybridizing such heuristics with local search procedures. The achieved results confirm that simple local search algorithms can compete successfully with much complex hybrids.
Źródło:: TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2007, 11, 1-2; 7-19
1428-6394
Pojawia się w:: TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja