Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Federico Pagnozzi"'
Autor:
Federico Pagnozzi, Mauro Birattari
Publikováno v:
Frontiers in Robotics and AI, Vol 8 (2021)
Due to the decentralized, loosely coupled nature of a swarm and to the lack of a general design methodology, the development of control software for robot swarms is typically an iterative process. Control software is generally modified and refined re
Externí odkaz:
https://doaj.org/article/6d8241e285bc49b08713e63da657d475
Autor:
Federico Pagnozzi, Thomas Stützle
Publikováno v:
Operations Research Perspectives, Vol 8, Iss , Pp 100180- (2021)
Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic d
Externí odkaz:
https://doaj.org/article/85f0adee03584a308e8e7a851840eaad
Autor:
Mauro Birattari, Antoine Ligot, Darko Bozhinoski, Manuele Brambilla, Gianpiero Francesca, Lorenzo Garattoni, David Garzón Ramos, Ken Hasselmann, Miquel Kegeleirs, Jonas Kuckling, Federico Pagnozzi, Andrea Roli, Muhammad Salman, Thomas Stützle
Publikováno v:
Frontiers in Robotics and AI, Vol 6 (2019)
Designing collective behaviors for robot swarms is a difficult endeavor due to their fully distributed, highly redundant, and ever-changing nature. To overcome the challenge, a few approaches have been proposed, which can be classified as manual, sem
Externí odkaz:
https://doaj.org/article/25062b53f32b461abea37a38502c2fad
Autor:
Thomas Stützle, Federico Pagnozzi
Publikováno v:
Operations Research Perspectives, Vol 8, Iss, Pp 100180-(2021)
Operations Research Perspectives, 8
Operations Research Perspectives, 8
Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef7b24fe2ebc71d6f001d75fb93ea194
http://www.sciencedirect.com/science/article/pii/S2214716021000038
http://www.sciencedirect.com/science/article/pii/S2214716021000038
Autor:
Federico Pagnozzi, Thomas Stützle
Publikováno v:
International Transactions in Operational Research
International transactions in operational research
International transactions in operational research
info:eu-repo/semantics/published
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbbf4b3ad52b16706c27bb8b9c637a24
Publikováno v:
Computers & Operations Research. 81:160-166
We present a new iterated greedy algorithm for the permutation flowshop problem under makespan objective.Our algorithm applies local search on partial solutions after the destruction phase.Our algorithm compares favorably with others from the literat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a30e5f58d8a9b1f148457061b6969ca
https://doi.org/10.1016/j.cor.2016.12.021
https://doi.org/10.1016/j.cor.2016.12.021
Autor:
Federico Pagnozzi, Thomas Stützle
Publikováno v:
European journal of operational research, 276 (2
Stochastic local search methods are at the core of many effective heuristics for tackling different permutation flowshop problems (PFSPs). Usually, such algorithms require a careful, manual algorithm engineering effort to reach high performance. An a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a43c2e251ba5149ec0d28b431e1de4e5
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/286627
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/286627
Publikováno v:
European journal of operational research
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
Industrial production scheduling problems are challenges that researchers have been trying to solve for decades. Many practical scheduling problems such as the hybrid flowshop are NP-hard. As a result, researchers resort to metaheuristics to obtain e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80e9634b12ac3224fde9cbac90cf70c7
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/296900
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/296900
Autor:
Federico Pagnozzi, Thomas Stützle
Publikováno v:
Optimization Letters. 11:1283-1292
Many algorithms for minimizing the weighted tardiness in the permutation flowshop problem rely on local search procedures. An increase in the efficiency of evaluating the objective function for neighboring candidate solutions directly also improves t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e5bf9205d0ea5391ce9c6d05c5fa910
https://doi.org/10.1007/s11590-016-1086-5
https://doi.org/10.1007/s11590-016-1086-5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319781327
Artificial Evolution
Artificial Evolution
Automatic algorithm configuration techniques have proved to be successful in finding performance-optimizing parameter settings of many search-based decision and optimization algorithms. A recurrent, important step in software development is the compi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c28dfebd04053d53de24e763778390d
https://doi.org/10.1007/978-3-319-78133-4_15
https://doi.org/10.1007/978-3-319-78133-4_15