Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Ignacio G. del Amo"'
Publikováno v:
Applied Soft Computing. 14:577-593
The best performing methods for Dynamic Optimization Problems (DOPs) are usually based on a set of agents that can have different complexity (like solutions in Evolutionary Algorithms, particles in Particle Swarm Optimization, or metaheuristics in hy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4908b33590adea571a557c7de94e9b2
https://doi.org/10.1016/j.asoc.2013.08.006
https://doi.org/10.1016/j.asoc.2013.08.006
Publikováno v:
Applied Soft Computing. 12:3176-3192
This work presents a study on the performance of several algorithms on different continuous dynamic optimization problems. Eight algorithms have been used: SORIGA (an Evolutionary Algorithm), an agents-based algorithm, the mQSO (a widely used multi-p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69b7f8b556c8b23f9d41e56ecf12b073
https://doi.org/10.1016/j.asoc.2012.05.021
https://doi.org/10.1016/j.asoc.2012.05.021
Autor:
David A. Pelta, Ignacio G. del Amo
Publikováno v:
Metaheuristics for Dynamic Optimization ISBN: 9783642306648
Metaheuristics for Dynamic Optimization
Metaheuristics for Dynamic Optimization
Performance comparison among several algorithms is an essential task. This is already a difficult process when dealing with stationary problems where the researcher usually tests many algorithms, with several parameters, under different problems. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::935914a8106be5204875b013a8eb5a1c
https://doi.org/10.1007/978-3-642-30665-5_4
https://doi.org/10.1007/978-3-642-30665-5_4
Publikováno v:
Nature Inspired Cooperative Strategies for Optimization (NICSO 2011) ISBN: 9783642240935
NICSO
NICSO
This work presents the results obtained when using a decentralised multiagent strategy (Agents) to solve dynamic optimization problems of a combinatorial nature. To improve the results of the strategy, we also include a simple adaptive scheme for sev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49f5134d656cd2ebfdb396fa6d20c3fe
https://doi.org/10.1007/978-3-642-24094-2_3
https://doi.org/10.1007/978-3-642-24094-2_3
Publikováno v:
IEEE Congress on Evolutionary Computation
The Particle Swarm Optimization (PSO) algorithm has been successfully applied to dynamic optimization problems with very competitive results. One of its best performing variants, the mQSO is based on an atomic model, with quantum and trajectory parti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1177d34688bc559567a191a9670045b9
https://doi.org/10.1109/cec.2010.5586051
https://doi.org/10.1109/cec.2010.5586051
Publikováno v:
IEEE Congress on Evolutionary Computation
Optimisation in dynamic environments is a very active and important area which tackles problems that change with time (as most real-world problems do). The possibility to use a new centralised cooperative strategy based on trajectory methods (tabu se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d53164181d7526ed7ee84ab7cfa93fa
https://doi.org/10.1109/cec.2010.5586063
https://doi.org/10.1109/cec.2010.5586063
Publikováno v:
Current Topics in Artificial Intelligence ISBN: 9783642142635
CAEPIA
CAEPIA
The particle swarm optimization (PSO) algorithm has successfully been applied to dynamic optimization problems with very competitive results. One of its best performing variants is the one based on the atomic model, with quantum and trajectory partic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e9abbca7870e8e653e248db807cb1bc
https://doi.org/10.1007/978-3-642-14264-2_4
https://doi.org/10.1007/978-3-642-14264-2_4
Publikováno v:
Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira’s Scientific Legacy ISBN: 9783642022630
IWINAC (1)
IWINAC (1)
In recent years, particle swarm optimization has emerged as a suitable optimization technique for dynamic environments, mainly its multi-swarm variant. However, in the search for good solutions some particles may produce transitions between non impro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c52f1b7dc7f9d9883fa1114898ecad94
https://doi.org/10.1007/978-3-642-02264-7_30
https://doi.org/10.1007/978-3-642-02264-7_30
Publikováno v:
Metaheuristic Procedures for Training Neutral Networks ISBN: 9780387334158
The basic idea of VNS is the change of neighbourhoods in the search for a better solution. VNS proceeds by a descent method to a local minimum exploring then, systematically or at random, increasingly distant neighbourhoods of this solution. Each tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d73a5aab5f7c185c6da58236cde9c21f
https://doi.org/10.1007/0-387-33416-5_4
https://doi.org/10.1007/0-387-33416-5_4