Temat: metaheuristics - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: A new metaheuristic algorithm for long-term open-pit production planning
Nowy meta-heurystyczny algorytm wspomagający długoterminowe planowanie produkcji w kopalni odkrywkowej
Autorzy:: Sattarvand, J.
Niemann-Delius, C.
Powiązania:: https://bibliotekanauki.pl/articles/219597.pdf
Data publikacji:: 2013
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: optymalizacja kopalń odkrywkowych
planowanie produkcji
optymalizacja metodą kolonii mrówek
metaheurystyka
open pit optimization
production planning
ant colony optimization
metaheuristics
Opis:: Paper describes a new metaheuristic algorithm which has been developed based on the Ant Colony Optimisation (ACO) and its efficiency have been discussed. To apply the ACO process on mine planning problem, a series of variables are considered for each block as the pheromone trails that represent the desirability of the block for being the deepest point of the mine in that column for the given mining period. During implementation several mine schedules are constructed in each iteration. Then the pheromone values of all blocks are reduced to a certain percentage and additionally the pheromone value of those blocks that are used in defining the constructed schedules are increased according to the quality of the generated solutions. By repeated iterations, the pheromone values of those blocks that define the shape of the optimum solution are increased whereas those of the others have been significantly evaporated.
W artykule zaprezentowano nowy meta-heurystyczny algorytm oparty na zasadach optymalizacji mrowiska i zbadano jego skuteczność w zastosowaniach do planowania wydobycia w kopalniach. Uwzględniono szereg zmiennych w każdym bloku schematu i przeanalizowano „ślady feromonów” które przedstawiają „dążność” poszczególnych bloków w danej kolumnie do stania się najgłębszym punktem kopalni w trakcie określonego okresu prowadzenia prac wydobywczych. W ramach kolejnych iteracji generuje się kilka harmonogramów prowadzenia wydobycia. Następnie wartości poziomu feromonów przypisane do kolejnych bloków redukowane są do wielkości wyrażonych w procentach a wartości poziomu feromonów przypisane do bloków wykorzystywanych do wygenerowania danego harmonogramu zostają powiększone, zgodnie z wymogami odnośnie jakości uzyskanych rozwiązań. Drogą kolejnych iteracji, wartości poziomu feromonów przypisane do bloków generujących rozwiązania optymalne zostają powiększane podczas gdy wartości przypisane do bloków pozostałych zostają odpowiednio pomniejszone.
Źródło:: Archives of Mining Sciences; 2013, 58, 1; 107-118
0860-7001
Pojawia się w:: Archives of Mining Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: A Short Introduction to Stochastic Optimization
Autorzy:: Ombach, Jerzy
Powiązania:: https://bibliotekanauki.pl/articles/1373633.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:: global optimization
stochastic algorithm
random search
convergence of metaheuristics
Opis:: We present some typical algorithms used for finding global minimum/ maximum of a function defined on a compact finite dimensional set, discuss commonly observed procedures for assessing and comparing the algorithms’ performance and quote theoretical results on convergence of a broad class of stochastic algorithms.
Źródło:: Schedae Informaticae; 2014, 23; 9-20
0860-0295
2083-8476
Pojawia się w:: Schedae Informaticae
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Advanced helical gear reducer design optimization through nature inspired algorithms
Autorzy:: Ebenezer, N. Godwin Raja
Saravanan, R.
Ramabalan, S.
Navaneethasanthakumar, S.
Powiązania:: https://bibliotekanauki.pl/articles/1178368.pdf
Data publikacji:: 2017
Wydawca:: Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:: CS
DIN Standards
FA
GA
Helical gear reducer design
MATLAB solvers fmincon
Nature inspired Algorithms SA
metaheuristics
optimization
Opis:: In this paper a high power helical gear pair design optimization problem is solved. It is a multi variable, complex non linear problem with derived objective function and constraints. The objective is to minimize the volume of the gear. The design parameters considered are module, face width, number of teeth on drive and driven and helix angle. The various factors for sizing and strength of gear geometry parameters are based on German Institute for Standardization (DIN) Standards. Nature inspired algorithms, namely, Simulated Annealing (SA), Fire fly (FA) and Cuckoo Search (CS) and MATLAB solvers fmincon, GA are used. Simulation results are analysed and compared with literature.
Źródło:: World Scientific News; 2017, 77, 2; 267-280
2392-2192
Pojawia się w:: World Scientific News
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

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ł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: An Analytical Study for the Role of Fuzzy Logic in Improving Metaheuristic Optimization Algorithms
Autorzy:: Vij, Sonakshi
Jain, Amita
Tayal, Devendra
Castillo, Oscar
Powiązania:: https://bibliotekanauki.pl/articles/385121.pdf
Data publikacji:: 2018
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:: fuzzy logic
metaheuristics
evolutionary computing
genetic algorithm
particle swarm optimization (PSO)
ant colony optimization
fuzzy evolutionary algorithm
fuzzy cuckoo
fuzzy simulated annealing
fuzzy swarm intelligence
fuzzy differential evolution
tabu
fuzzy mutation
fuzzy natural selection
fuzzy fitness function
big bang big crunch
fuzzy bacterial
neuro fuzzy logic
logika rozmyta
metaheurystyka
obliczenia ewolucyjne
algorytm genetyczny
optymalizacja roju cząstek
optymalizacja kolonii mrówek
Opis:: The research applications of fuzzy logic have always been multidisciplinary in nature due to its ability in handling vagueness and imprecision. This paper presents an analytical study in the role of fuzzy logic in the area of metaheuristics using Web of Science (WoS) as the data source. In this case, 178 research papers are extracted from it in the time span of 1989-2016. This paper analyzes various aspects of a research publication in a scientometric manner. The top cited research papers, country wise contribution, topmost organizations, top research areas, top source titles, control terms and WoS categories are analyzed. Also, the top 3 fuzzy evolutionary algorithms are extracted and their top research papers are mentioned along with their topmost research domain. Since neuro fuzzy logic poses feasible options for solving numerous research problems, hence a section is also included by the authors to present an analytical study regarding research in it. Overall, this study helps in evaluating the recent research patterns in the field of fuzzy metaheuristics along with envisioning the future trends for the same. While on one hand this helps in providing a new path to the researchers who are beginners in this field as they can start exploring it through the analysis mentioned here, on the other hand it provides an insight to professional researchers too who can dig a little deeper in this field using knowledge from this study.
Źródło:: Journal of Automation Mobile Robotics and Intelligent Systems; 2018, 12, 4; 11-27
1897-8649
2080-2145
Pojawia się w:: Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Benchmark Tests on Heuristic Methods in the Darts Game
Autorzy:: Książek, K.
Połap, D.
Woźniak, M.
Powiązania:: https://bibliotekanauki.pl/articles/226713.pdf
Data publikacji:: 2018
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: metaheuristics
optimization
computational intelligence
Opis:: Games are among problems that can be reduced to optimization, for which one of the most universal and productive solving method is a heuristic approach. In this article we present results of benchmark tests on using 5 heuristic methods to solve a physical model of the darts game. Discussion of the scores and conclusions from the research have shown that application of heuristic methods can simulate artificial intelligence as a regular player with very good results.
Źródło:: International Journal of Electronics and Telecommunications; 2018, 64, 2; 115-121
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 8.

Tytuł:: Challenges for nurse rostering problem and opportunities in hospital logistics
Autorzy:: Simić, D.
Simić, S.
Milutinović, D.
Djordjević, J.
Powiązania:: https://bibliotekanauki.pl/articles/333351.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:: nurse rostering problem
scheduling
healthcare
metaheuristics
logistic approach
problem dyżurów pielęgniarskich
harmonogram
opieka zdrowotna
metaheurystyka
podejście logistyczne
Opis:: In the last 45 years nurse scheduling has received considerable attention in the research community. Nurse rostering can be described as a task of finding a duty roster for a set of nurses in such a way that the rosters comply with work regulations and meet the management’s requests. The objective varies from minimizing the costs of float nurses or minimizing under-staffing to maximizing the degree to which the nurses’ requests are met. In logistics, one aspect is optimization of the steady flow of materials through a network of transport links and storage nodes, and the other is, coordination of a sequence of resources, such as staffing and scheduling clinical resources. The period up to 2000 is characterized by using mathematical programming and objective functions to solve nurse rostering problem. In the period after 2000 the focus of researches aimed at solving nurse rostering and scheduling problem becomes implementation of meta-heuristics and multi-objective functions. The aim of this paper is to present the latest researches conducted in last ten years.
Źródło:: Journal of Medical Informatics & Technologies; 2014, 23; 195-202
1642-6037
Pojawia się w:: Journal of Medical Informatics & Technologies
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 9.

Tytuł:: Contemporary Methods for Graph Coloring as an Example of Discrete Optimization
Autorzy:: Bilski, Adrian
Powiązania:: https://bibliotekanauki.pl/articles/226705.pdf
Data publikacji:: 2019
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: graph coloring
chromatic number
metaheuristics
Opis:: This paper provides an insight into graph coloring application of the contemporary heuristic methods. It discusses a variety of algorithmic solutions for The Graph Coloring Problem (GCP) and makes recommendations for implementation. The GCP is the NP-hard problem, which aims at finding the minimum number of colors for vertices in such a way, that none of two adjacent vertices are marked with the same color.With the advent of multicore processing technology, the metaheuristic approach to solving GCP reemerged as means of discrete optimization. To explain the phenomenon of these methods, the author makes a thorough survey of AI-based algorithms for GCP, while pointing out the main differences between all these techniques.
Źródło:: International Journal of Electronics and Telecommunications; 2019, 65, 2; 235-243
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 10.

Tytuł:: Determining hop-constrained spanning trees with repetitive heuristics
Autorzy:: Fernandes, M.
Gouveia, L.
Voß, S.
Powiązania:: https://bibliotekanauki.pl/articles/308588.pdf
Data publikacji:: 2007
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: hop-constrained spanning tree problem
metaheuristics
pilot method
rollout method
Opis:: The hop-constrained minimum spanning tree problem is the problem of determining a rooted spanning tree of minimum cost in which each path from the root node to any other node contains at most H hops or edges. This problem relates to the design of centralized tree networks with quality of service requirements (in telecommunications) and has a close relation with other tree problems. In this paper we investigate the adaptation of some well-known "repetitive" heuristics used for the capacitated minimum spanning tree problem to the hop-constrained minimum spanning tree problem and investigate some simple look ahead mechanisms for enhancing the quality of a savings heuristic. Computational results for a set of benchmark tests with up to 80 nodes are presented.
Źródło:: Journal of Telecommunications and Information Technology; 2007, 4; 16-22
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 11.

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ł

Zmień widok

na półce

Skocz do pozycji: 12.

Tytuł:: Extensions of the minimum labelling spanning tree problem
Autorzy:: Cerulli, R.
Fink, A.
Gentili, M.
Voss, S.
Powiązania:: https://bibliotekanauki.pl/articles/308930.pdf
Data publikacji:: 2006
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: network design
metaheuristics
spanning trees
labelling trees
Steiner tree problem
Opis:: In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected subgraph of G with the minimum number of different colors covering all the basic vertices. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by means of homogeneous connections. Numerical results for several metaheuristics to solve the problem are presented.
Źródło:: Journal of Telecommunications and Information Technology; 2006, 4; 39-45
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 13.

Tytuł:: Fine tuning of agent-based evolutionary computing
Autorzy:: Mizera, Michal
Nowotarski, Pawel
Byrski, Aleksander
Kisiel-Dorohinicki, Marek
Powiązania:: https://bibliotekanauki.pl/articles/91820.pdf
Data publikacji:: 2019
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: multi-agent systems
metaheuristics
evolutionary computing
Opis:: Evolutionary Multi-agent System introduced by late Krzysztof Cetnarowicz and developed further at the AGH University of Science and Technology became a reliable optimization system, both proven experimentally and theoretically. This paper follows a work of Byrski further testing and analyzing the efficacy of this metaheuristic based on popular, high-dimensional benchmark functions. The contents of this paper will be useful for anybody willing to apply this computing algorithm to continuous and not only optimization.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 2; 81-97
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 14.

Tytuł:: FLC control for tuning exploration phase in bio-inspired metaheuristic
Autorzy:: Kiełkowicz, K.
Grela, D.
Powiązania:: https://bibliotekanauki.pl/articles/106299.pdf
Data publikacji:: 2016
Wydawca:: Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:: Bat algorithm
swarm intelligence
metaheuristics
optimization
fuzzy logic
Mamdami-Type inference system
Opis:: Growing popularity of the Bat Algorithm has encouraged researchers to focus their work on its further improvements. Most work has been done within the area of hybridization of Bat Algorithm with other metaheuristics or local search methods. Unfortunately, most of these modifications not only improves the quality of obtained solutions, but also increases the number of control parameters that are needed to be set in order to obtain solutions of expected quality. This makes such solutions quite impractical. What more, there is no clear indication what these parameters do in term of a search process. In this paper authors are trying to incorporate Mamdani type Fuzzy Logic Controller (FLC) to tackle some of these mentioned shortcomings by using the FLC to control the exploration phase of a bio-inspired metaheuristic. FLC also allows us to incorporate expert knowledge about the problem at hand and define expected behaviors of system – here process of searching in multidimensional search space by modeling the process of bats hunting for their prey.
Źródło:: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2016, 16, 2; 32-38
1732-1360
2083-3628
Pojawia się w:: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 15.

Tytuł:: Fundamentals of scatter search and path relinking
Autorzy:: Glover, F.
Laguna, M.
Marti, R.
Powiązania:: https://bibliotekanauki.pl/articles/205907.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: optymalizacja
evolutionary methods
metaheuristics
optimization
tabu search
Opis:: The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions (in both Euclidean and neighborhood spaces) and by utilizing strategic designs where other approaches resort to randomization. Scatter Search and Path Relinking are also intimately related to the Tabu Search metaheuristic, and derive additional advantages by making use of adaptive memory and associated memory-exploiting mechanisms that are capable of being adapted to particular contexts. We describe the features of Scatter Search and Path Relinking that set them apart from other evolutionary approaches, and that offer opportunities for creating increasingly more versatile and effective methods in the future.
Źródło:: Control and Cybernetics; 2000, 29, 3; 653-684
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "metaheuristics" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język