5 research outputs found
Multi-Objective Archiving
Most multi-objective optimisation algorithms maintain an archive explicitly
or implicitly during their search. Such an archive can be solely used to store
high-quality solutions presented to the decision maker, but in many cases may
participate in the search process (e.g., as the population in evolutionary
computation). Over the last two decades, archiving, the process of comparing
new solutions with previous ones and deciding how to update the
archive/population, stands as an important issue in evolutionary
multi-objective optimisation (EMO). This is evidenced by constant efforts from
the community on developing various effective archiving methods, ranging from
conventional Pareto-based methods to more recent indicator-based and
decomposition-based ones. However, the focus of these efforts is on empirical
performance comparison in terms of specific quality indicators; there is lack
of systematic study of archiving methods from a general theoretical
perspective. In this paper, we attempt to conduct a systematic overview of
multi-objective archiving, in the hope of paving the way to understand
archiving algorithms from a holistic perspective of theory and practice, and
more importantly providing a guidance on how to design theoretically desirable
and practically useful archiving algorithms. In doing so, we also present that
archiving algorithms based on weakly Pareto compliant indicators (e.g.,
epsilon-indicator), as long as designed properly, can achieve the same
theoretical desirables as archivers based on Pareto compliant indicators (e.g.,
hypervolume indicator). Such desirables include the property limit-optimal, the
limit form of the possible optimal property that a bounded archiving algorithm
can have with respect to the most general form of superiority between solution
sets.Comment: 21 pages, 4 figures, journa
Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization
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 feasible objective vectors is exponential with respect to the problem size. In this case the goal is to compute a good approximation of the Pareto front. We investigate how this goal can be achieved by using the diversity mechanism of ε-dominance and point out where this concept is provably helpful to obtain a good approximation of an exponentially large Pareto front in expected polynomial time. Afterwards, we consider the drawbacks of this approach and point out situations where the use of ε-dominance slows down the optimization process significantly. Copyright 2008 ACM.Christian Horoba, Frank Neumannhttp://www.sigevo.org/gecco-2008
Automated Test Case Generation as a Many-Objective Optimisation Problem with Dynamic Selection of the Targets
The test case generation is intrinsically a multi-objective problem, since the goal is covering multiple test targets (e.g., branches). Existing search-based approaches either consider one target at a time or aggregate all targets into a single fitness function (whole-suite approach). Multi and many-objective optimisation algorithms (MOAs) have never been applied to this problem, because existing algorithms do not scale to the number of coverage objectives that are typically found in real-world software. In addition, the final goal for MOAs is to find alternative trade-off solutions in the objective space, while in test generation the interesting solutions are only those test cases covering one or more uncovered targets. In this paper, we present DynaMOSA (Dynamic Many-Objective Sorting Algorithm), a novel many-objective solver specifically designed to address the test case generation problem in the context of coverage testing. DynaMOSA extends our previous many-objective technique MOSA (Many-Objective Sorting Algorithm) with dynamic selection of the coverage targets based on the control dependency hierarchy. Such extension makes the approach more effective and efficient in case of limited search budget. We carried out an empirical study on 346 Java classes using three coverage criteria (i.e., statement, branch, and strong mutation coverage) to assess the performance of DynaMOSA with respect to the whole-suite approach (WS), its archive-based variant (WSA) and MOSA. The results show that DynaMOSA outperforms WSA in 28% of the classes for branch coverage (+8% more coverage on average) and in 27% of the classes for mutation coverage (+11% more killed mutants on average). It outperforms WS in 51% of the classes for statement coverage, leading to +11% more coverage on average. Moreover, DynaMOSA outperforms its predecessor MOSA for all the three coverage criteria in 19% of the classes with +8% more code coverage on average
Recommended from our members
Multi-Objective Optimization in Multiagent Systems
Cooperative multiagent systems are used as solution concepts in many application domains including air traffic control, satellite communications, and extra planetary exploration. As systems become more distributed and complex, we observe three phenomena. First, these systems cannot be accurately modeled, rendering traditional model based control methods inadequate. Second, system parameters are highly coupled in a nonlinear manner, making it difficult for humans to develop heuristic based control policies. Finally, these systems are distributed to the point that a centralized controller is either impractical or infeasible. These types of systems are often inherently multi-objective; unfortunately, they are not treated as such in most multiagent research. To date, there has been little research attention given to multi-objective multiagent systems.
This dissertation addresses these systems from a learning-based approach to optimize system performance in four ways: (i) deriving a form of credit assignment compatible for use with multi-objective problems (ii) deriving multiagent equivalents to state-of-the-art multi-objective evolutionary algorithms (MOEAs); (iii) developing a fast, effective multiagent multi-objective algorithm that outperforms state-of the art MOEAs in as little as one tenth of the computation time; and (iv) integrating the previously developed algorithm into a multiagent system
Theoretical and Empirical Evaluation of Diversity-preserving Mechanisms in Evolutionary Algorithms: On the Rigorous Runtime Analysis of Diversity-preserving Mechanisms in Evolutionary Algorithms
Evolutionary algorithms (EAs) simulate the natural evolution of species by iteratively applying evolutionary operators such as mutation, recombination, and selection to a set of solutions for a given problem. One of the major advantages of these algorithms is that they can be easily implemented when the optimisation problem is not well understood, and the design of problem-specific algorithms cannot be performed due to lack of time, knowledge, or expertise to design problem-specific algorithms. Also, EAs can be used as a first step to get insights when the problem is just a black box to the developer/programmer. In these cases, by evaluating candidate solutions it is possible to gain knowledge on the problem at hand.
EAs are well suited to dealing with multimodal problems due to their use of a population. A diverse population can explore several hills in the fitness landscape simultaneously and offer several good solutions to the user, a feature desirable for decision making, multi-objective optimisation and dynamic optimisation. However, a major difficulty when applying EAs is that the population may converge to a sub-optimal individual before the fitness landscape is explored properly.
Many diversity-preserving mechanisms have been developed to reduce the risk of such premature convergence and given such a variety of mechanisms to choose from, it is often not clear which mechanism is the best choice for a particular problem. We study the (expected/average) time for such algorithms to find satisfactory solutions for multimodal and multi-objective problems and to extract guidelines for the informed design of efficient and effective EAs. The resulting runtime bounds are used to predict and to judge the performance of algorithms for arbitrary problem sizes, further used to clarify important design issues from a theoretical perspective.
We combine theoretical research with empirical applications to test the theoretical recommendations for their practicality, and to engage in rapid knowledge transfer from theory to practice. With this approach, we provide a better understanding of the working principles of EAs with diversity-preserving mechanisms. We provide theoretical foundations and we explain when and why certain diversity mechanisms are effective, and when they are not. It thus contributes to the informed design of better EAs