Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Boldizsár Tüű-Szabó"'
Publikováno v:
Mathematics, Vol 12, Iss 19, p 2960 (2024)
In this paper, we address the challenge of creating candidate sets for large-scale Traveling Salesman Problem (TSP) instances, where choosing a subset of edges is crucial for efficiency. Traditional methods for improving tours, such as local searches
Externí odkaz:
https://doaj.org/article/1060a96143a041fab6d18c7d4cd617c7
Publikováno v:
Algorithms, Vol 16, Iss 9, p 406 (2023)
Flow-shop scheduling problems are classic examples of multi-resource and multi-operation scheduling problems where the objective is to minimize the makespan. Because of the high complexity and intractability of the problem, apart from some exceptiona
Externí odkaz:
https://doaj.org/article/f6f8d2a1c91c4d79b317eb1003acaa3c
Publikováno v:
International Journal of Computational Intelligence Systems, Vol 13, Iss 1 (2020)
In this paper we revisit the memetic evolutionary family of metaheuristics, called Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), whose members combine Furuhashi's Bacterial Evolutionary Algorithm and various discrete local search techniq
Externí odkaz:
https://doaj.org/article/86f7f53296f848aeac9f5e5b356a0bcd
Publikováno v:
Axioms, Vol 9, Iss 2, p 53 (2020)
This study proposes a new model and approach for solving a realistic extension of the Time-Dependent Traveling Salesman Problem, by using the concept of distance between interval-valued intuitionistic fuzzy sets. For this purpose, we developed an int
Externí odkaz:
https://doaj.org/article/889aabf46bb84be9bee07e5acf1c7dc6
Publikováno v:
Infocommunications journal. 14:72-78
There are many factors that affect the performance of the evolutionary and memetic algorithms. One of these factors is the proper selection of the initial population, as it represents a very important criterion contributing to the convergence speed.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3b00f0c5d96ee3514820b0e5940aea1
https://doi.org/10.36244/icj.2022.3.9
https://doi.org/10.36244/icj.2022.3.9
Publikováno v:
Computational Intelligence and Mathematics for Tackling Complex Problems 4 ISBN: 9783031077067
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51cf1fd38643e8d9954a83d77d4c68f5
https://doi.org/10.1007/978-3-031-07707-4_11
https://doi.org/10.1007/978-3-031-07707-4_11
Publikováno v:
Computational Intelligence and Mathematics for Tackling Complex Problems 2 ISBN: 9783030888169
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f66a048ab9a72bd6b000a4075eecb555
https://doi.org/10.1007/978-3-030-88817-6_8
https://doi.org/10.1007/978-3-030-88817-6_8
Publikováno v:
Studies in Computational Intelligence ISBN: 9783030749699
Studies in Computational Intelligence
Studies in Computational Intelligence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfa62ea02683bb9b774512b562b74d84
https://doi.org/10.1007/978-3-030-74970-5_21
https://doi.org/10.1007/978-3-030-74970-5_21
Autor:
Péter Földesi, Boldizsár Tüű-Szabó, Forwarding, Szilvia Nagy, László T. Kóczy, Media Informatics, Gábor L. Kovács, Gergő Fogarasi
Publikováno v:
Acta Polytechnica Hungarica. 16:137-155
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1113bc2bb8c1230376a7fc70865dcdda
https://doi.org/10.12700/aph.16.10.2019.10.9
https://doi.org/10.12700/aph.16.10.2019.10.9
Publikováno v:
International Journal of Computational Intelligence Systems, Vol 13, Iss 1 (2020)
In this paper we revisit the memetic evolutionary family of metaheuristics, called Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), whose members combine Furuhashi's Bacterial Evolutionary Algorithm and various discrete local search techniq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8407273c4710259c0ae3e0f110094cc2
https://www.atlantis-press.com/article/125941267/view
https://www.atlantis-press.com/article/125941267/view