Temat: search algorithms - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Efficiency of selected meta-heuristics applied to the TSP problem: a simulation study
Autorzy:: Kwaśnicka, H.
Powiązania:: https://bibliotekanauki.pl/articles/1931573.pdf
Data publikacji:: 2003
Wydawca:: Politechnika Gdańska
Tematy:: ant colony
genetic algorithms
simulated annealing
tabu search
neural networks
Opis:: The paper presents a simulation study of the usefulness of a numberof meta-heuristicsused as optimisation methods forTSPproblems. The five considered approaches are outlined: GeneticAlgorithm, Simulated Annealing, Ant Colony System, Tabu Search and Hopfield Neural Network.Using a purpose-developed computer program, efficiency of the meta-heuriticshas been studied andcompared. Results obtained from about 40000 simulation runs are briefly presented and discussed.
Źródło:: TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2003, 7, 1; 73-91
1428-6394
Pojawia się w:: TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Linear programming & metaheuristic approach for scheduling in the hybrid flowshop with resource constraints
Autorzy:: Figielska, E.
Powiązania:: https://bibliotekanauki.pl/articles/206283.pdf
Data publikacji:: 2011
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: flowshop
parallel machines
resource constraints
heuristics
linear programming
genetic algorithms
simulated annealing
tabu search
Opis:: This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which join the linear programming based procedures with metaheuristic algorithms: genetic, simulated annealing and tabu search algorithm. The performance of the proposed algorithms is experimentally evaluated by comparing the solutions with a lower bound on the optimal makespan. Results of a computational experiment show that these algorithms are able to produce good solutions in short computation time and that the metaheuristics significantly improve the results for the most difficult problems.
Źródło:: Control and Cybernetics; 2011, 40, 4; 1209-1230
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja