Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Christian Horoba"'
Publikováno v:
GECCO
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which enables the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4456195422c1b8da462f3ac2d703267a
https://doi.org/10.1016/j.tcs.2011.07.024
https://doi.org/10.1016/j.tcs.2011.07.024
Publikováno v:
Theoretical Computer Science. 412(17):1546-1556
It is widely assumed that evolutionary algorithms for multi-objective optimization problems should use certain mechanisms to achieve a good spread over the Pareto front. In this paper, we examine such mechanisms from a theoretical point of view and a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80535a33a6c9f9ded3a5f0d19c7548d8
Autor:
Christian Horoba, Dirk Sudholt
Publikováno v:
GECCO
We consider Ant Colony Optimization (ACO) for stochastic shortest path problems where edge weights are subject to noise that reflects delays and uncertainty. The question is whether the ants can find or approximate shortest paths in the presence of n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ceba49293ab24cbf07b70a6c50936ae7
https://doi.org/10.1145/1830483.1830750
https://doi.org/10.1145/1830483.1830750
Publikováno v:
GECCO
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of algorithms maximizing the hypervolume for a given problem by distributing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ba32326584fa586a37ed8e82914c709
https://doi.org/10.1145/1569901.1569981
https://doi.org/10.1145/1569901.1569981
Publikováno v:
GECCO
The concept of aging has been introduced and applied in many different variants in many different randomized search heuristics. The most important parameter is the maximal age of search points. Considering static pure aging known from artificial immu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b39a19f2dafd59010026533db3684ab
https://doi.org/10.1145/1569901.1570012
https://doi.org/10.1145/1569901.1570012
Autor:
Frank Neumann, Christian Horoba
Publikováno v:
FOGA
Often the Pareto front of a multi-objective optimization problem grows exponentially with the problem size. In this case, it is not possible to compute the whole Pareto front efficiently and one is interested in good approximations. We consider how e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ace5c06997799c46d55b71a6407c3e60
https://doi.org/10.1145/1527125.1527137
https://doi.org/10.1145/1527125.1527137
Autor:
Dirk Sudholt, Christian Horoba
Publikováno v:
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics ISBN: 9783642037504
SLS
SLS
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO systems for shortest path problems. First, we improve running time boun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::933011dcd132e686241c64a805a92cf3
https://doi.org/10.1007/978-3-642-03751-1_6
https://doi.org/10.1007/978-3-642-03751-1_6
Autor:
Christian Horoba
Publikováno v:
FOGA
We present a natural fitness function f for the multiobjective shortest path problem, which is a fundamental multiobjective combinatorial optimization problem known to be NP-hard. Thereafter, we conduct a rigorous runtime analysis of a simple evoluti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff9e761ce08e7ad9ffce8a77d7eae473
http://hdl.handle.net/2003/26165
http://hdl.handle.net/2003/26165
Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization
Autor:
Christian Horoba, Frank Neumann
Publikováno v:
GECCO
Using diversity mechanisms in evolutionary algorithms for multi-objective optimization problems is considered as an important issue for the design of successful algorithms. This is in particular the case for problems where the number of non-dominated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c9cce07e18c3ee37d31219ca19da416
https://doi.org/10.1145/1389095.1389224
https://doi.org/10.1145/1389095.1389224
Publikováno v:
Parallel Problem Solving from Nature – PPSN X ISBN: 9783540876991
PPSN
PPSN
It is widely assumed that evolutionary algorithms for multi-objective optimization problems should use certain mechanisms to achieve a good spread over the Pareto front. In this paper, we examine such mechanisms from a theoretical point of view and a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0b7c74c513ab03dbd386c54440ca446
https://doi.org/10.1007/978-3-540-87700-4_67
https://doi.org/10.1007/978-3-540-87700-4_67