10,252 research outputs found
An Interactive Fuzzy Satisficing Method for Fuzzy Random Multiobjective 0-1 Programming Problems through Probability Maximization Using Possibility
In this paper, we focus on multiobjective 0-1 programming problems under the situation where stochastic uncertainty and vagueness exist at the same time. We formulate them as
fuzzy random multiobjective 0-1 programming problems where coefficients of objective functions are fuzzy random variables. For the formulated problem, we propose an interactive fuzzy satisficing method through probability maximization using of possibility
On the usefulness of gradient information in multi-objective deformable image registration using a B-spline-based dual-dynamic transformation model: comparison of three optimization algorithms
The use of gradient information is well-known to be highly useful in single-objective optimization-based image
registration methods. However, its usefulness has not yet been investigated for deformable image registration from a
multi-objective optimization perspective. To this end, within a previously introduced multi-objective optimization
framework, we use a smooth B-spline-based dual-dynamic transformation model that allows us to derive gradient
information analytically, while still being able to account for large deformations. Within the multi-objective framework,
we previously employed a powerful evolutionary algorithm (EA) that computes and advances multiple outcomes at once,
resulting in a set of solutions (a so-called Pareto front) that represents efficient trade-offs between the objectives. With
the addition of the B-spline-based transformation model, we studied the usefulness of gradient information in multiobjective
deformable image registration using three different optimization algorithms: the (gradient-less) EA, a gradientonly
algorithm, and a hybridization of these two. We evaluated the algorithms to register highly deformed images: 2D
MRI slices of the breast in prone and supine positions. Results demonstrate that gradient-based multi-objective
optimization significantly speeds up optimization in the initial stages of optimization. However, allowing sufficient
computational resources, better results could still be obtained with the EA. Ultimately, the hybrid EA found the best
overall approximation of the optimal Pareto front, further indicating that adding gradient-based optimization for multiobjective optimization-based deformable image registration can indeed be beneficial
The Kalai-Smorodinski solution for many-objective Bayesian optimization
An ongoing aim of research in multiobjective Bayesian optimization is to
extend its applicability to a large number of objectives. While coping with a
limited budget of evaluations, recovering the set of optimal compromise
solutions generally requires numerous observations and is less interpretable
since this set tends to grow larger with the number of objectives. We thus
propose to focus on a specific solution originating from game theory, the
Kalai-Smorodinsky solution, which possesses attractive properties. In
particular, it ensures equal marginal gains over all objectives. We further
make it insensitive to a monotonic transformation of the objectives by
considering the objectives in the copula space. A novel tailored algorithm is
proposed to search for the solution, in the form of a Bayesian optimization
algorithm: sequential sampling decisions are made based on acquisition
functions that derive from an instrumental Gaussian process prior. Our approach
is tested on four problems with respectively four, six, eight, and nine
objectives. The method is available in the Rpackage GPGame available on CRAN at
https://cran.r-project.org/package=GPGame
PasMoQAP: A Parallel Asynchronous Memetic Algorithm for solving the Multi-Objective Quadratic Assignment Problem
Multi-Objective Optimization Problems (MOPs) have attracted growing attention
during the last decades. Multi-Objective Evolutionary Algorithms (MOEAs) have
been extensively used to address MOPs because are able to approximate a set of
non-dominated high-quality solutions. The Multi-Objective Quadratic Assignment
Problem (mQAP) is a MOP. The mQAP is a generalization of the classical QAP
which has been extensively studied, and used in several real-life applications.
The mQAP is defined as having as input several flows between the facilities
which generate multiple cost functions that must be optimized simultaneously.
In this study, we propose PasMoQAP, a parallel asynchronous memetic algorithm
to solve the Multi-Objective Quadratic Assignment Problem. PasMoQAP is based on
an island model that structures the population by creating sub-populations. The
memetic algorithm on each island individually evolve a reduced population of
solutions, and they asynchronously cooperate by sending selected solutions to
the neighboring islands. The experimental results show that our approach
significatively outperforms all the island-based variants of the
multi-objective evolutionary algorithm NSGA-II. We show that PasMoQAP is a
suitable alternative to solve the Multi-Objective Quadratic Assignment Problem.Comment: 8 pages, 3 figures, 2 tables. Accepted at Conference on Evolutionary
Computation 2017 (CEC 2017
Evolutionary multiobjective optimization in engineering management: an empirical study on bridge deck rehabilitation
There exist multiple objectives in engineering management such as minimum cost and maximum service capacity. Although solution methods of multiobjective optimization problems have undergone continual development over the past several decades, the methods available to date are not particularly robust, and none of them performs well on the broad classes. Because genetic algorithms work with a population of points, they can capture a number of solutions simultaneously, and easily incorporate the concept of Pareto optimal set in their optimization process. In this paper, a genetic algorithm is modified to deal with the rehabilitation planning of bridge decks at a network level by minimizing the rehabilitation cost and deterioration degree simultaneously
Search based software engineering: Trends, techniques and applications
© ACM, 2012. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version is available from the link below.In the past five years there has been a dramatic increase in work on Search-Based Software Engineering (SBSE), an approach to Software Engineering (SE) in which Search-Based Optimization (SBO) algorithms are used to address problems in SE. SBSE has been applied to problems throughout the SE lifecycle, from requirements and project planning to maintenance and reengineering. The approach is attractive because it offers a suite of adaptive automated and semiautomated solutions in situations typified by large complex problem spaces with multiple competing and conflicting objectives.
This article provides a review and classification of literature on SBSE. The work identifies research trends and relationships between the techniques applied and the applications to which they have been applied and highlights gaps in the literature and avenues for further research.EPSRC and E
Comparison of Direct Multiobjective Optimization Methods for the Design of Electric Vehicles
"System design oriented methodologies" are discussed in this paper through the comparison of multiobjective optimization methods applied to heterogeneous devices in electrical engineering. Avoiding criteria function derivatives, direct optimization algorithms are used. In particular, deterministic geometric methods such as the Hooke & Jeeves heuristic approach are compared with stochastic evolutionary algorithms (Pareto genetic algorithms). Different issues relative to convergence rapidity and robustness on mixed (continuous/discrete), constrained and multiobjective problems are discussed. A typical electrical engineering heterogeneous and multidisciplinary system is considered as a case study: the motor drive of an electric vehicle. Some results emphasize the capacity of each approach to facilitate system analysis and particularly to display couplings between optimization parameters, constraints, objectives and the driving mission
- …