9 research outputs found
A multi-objective DIRECT algorithm for ship hull optimization
The paper is concerned with black-box nonlinear constrained multi-objective optimization problems. Our interest is the definition of a multi-objective deterministic partition-based algorithm. The main target of the proposed algorithm is the solution of a real ship hull optimization problem. To this purpose and in pursuit of an efficient method, we develop an hybrid algorithm by coupling a multi-objective DIRECT-type algorithm with an efficient derivative-free local algorithm. The results obtained on a set of “hard” nonlinear constrained multi-objective test problems show viability of the proposed approach. Results on a hull-form optimization of a high-speed catamaran (sailing in head waves in the North Pacific Ocean) are also presented. In order to consider a real ocean environment, stochastic sea state and speed are taken into account. The problem is formulated as a multi-objective optimization aimed at (i) the reduction of the expected value of the mean total resistance in irregular head waves, at variable speed and (ii) the increase of the ship operability, with respect to a set of motion-related constraints. We show that the hybrid method performs well also on this industrial problem
Hybridization of multi-objective deterministic particle swarm with derivative-free local searches
The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems. The objective is to show how the hybridization of two multi-objective derivative-free global and local algorithms achieves better performance than the separate use of the two algorithms in solving specific SBDO problems for hull-form design. The proposed method belongs to the class of memetic algorithms, where the global exploration capability of multi-objective deterministic particle swarm optimization is enriched by exploiting the local search accuracy of a derivative-free multi-objective line-search method. To the authors best knowledge, studies are still limited on memetic, multi-objective, deterministic, derivative-free, and evolutionary algorithms for an effective and efficient solution of SBDO for hull-form design. The proposed formulation manages global and local searches based on the hypervolume metric. The hybridization scheme uses two parameters to control the local search activation and the number of function calls used by the local algorithm. The most promising values of these parameters were identified using forty analytical tests representative of the SBDO problem of interest. The resulting hybrid algorithm was finally applied to two SBDO problems for hull-form design. For both analytical tests and SBDO problems, the hybrid method achieves better performance than its global and local counterparts
Effects of the Application of a Stern Foil on Ship Resistance: A Case Study of an Orela Crew Boat
The effects of the application of a stern hydrofoil on ship resistance were studied numerically using computational fluid dynamics (CFD) and were verified using data from model tests. A 40 m planing-hull Orela crew boat, with target top speed of 28 knots (Froude number, Fr = 0.73), was considered. The stern foil (NACA 64(1)212) was installed with the leading edge positioned precisely below the transom with angle of attack of 2 degrees at elevation 0.853 T below the water surface (where T is the boat’s draft). At relatively low speed (Fr < ~0.45) the application of a stern foil results in an increase in ship resistance (of up to 13.9%), while at relatively high speed (Fr > ~0.55) it results in a decrease in ship resistance (of up to 10.0%). As the Froude number increases, the resistance coefficient (CT) first increases, reaches a maximum value, and then decreases. Its maximum value occurs at Fr ? 0.5, which is consistent with the prediction of a resistance barrier at approximately this Froude number
Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
In this paper, we consider multi-objective optimization problems with a
sparsity constraint on the vector of variables. For this class of problems,
inspired by the homonymous necessary optimality condition for sparse
single-objective optimization, we define the concept of L-stationarity and we
analyze its relationships with other existing conditions and Pareto optimality
concepts. We then propose two novel algorithmic approaches: the first one is an
Iterative Hard Thresholding method aiming to find a single L-stationary
solution, while the second one is a two-stage algorithm designed to construct
an approximation of the whole Pareto front. Both methods are characterized by
theoretical properties of convergence to points satisfying necessary conditions
for Pareto optimality. Moreover, we report numerical results establishing the
practical effectiveness of the proposed methodologies.Comment: 20 pages, 7 figures, 1 tabl
Designing a Framework for Solving Multiobjective Simulation Optimization Problems
Multiobjective simulation optimization (MOSO) problems are optimization
problems with multiple conflicting objectives, where evaluation of at least one
of the objectives depends on a black-box numerical code or real-world
experiment, which we refer to as a simulation. This paper describes the design
goals driving the development of the parallel MOSO library ParMOO. We derive
these goals from the research trends and real-world requirements that arise
when designing and deploying solvers for generic MOSO problems. Our specific
design goals were to provide a customizable MOSO framework that allows for
exploitation of simulation-based problem structures, ease of deployment in
scientific workflows, maintainability, and flexibility in our support for many
problem types. We explain how we have achieved these goals in the ParMOO
library and provide two examples demonstrating how customized ParMOO solvers
can be quickly built and deployed in real-world MOSO problems
Nonconvex and mixed integer multiobjective optimization with an application to decision uncertainty
Multiobjective optimization problems commonly arise in different fields like economics or engineering. In general, when dealing with several conflicting objective functions, there is an infinite number of optimal solutions which cannot usually be determined analytically.
This thesis presents new branch-and-bound-based approaches for computing the globally optimal solutions of multiobjective optimization problems of various types. New algorithms are proposed for smooth multiobjective nonconvex optimization problems with convex constraints as well as for multiobjective mixed integer convex optimization problems. Both algorithms guarantee a certain accuracy of the computed solutions, and belong to the first deterministic algorithms within their class of optimization problems. Additionally, a new approach to compute a covering of the optimal solution set of multiobjective optimization problems with decision uncertainty is presented. The three new algorithms are tested numerically. The results are evaluated in this thesis as well.
The branch-and-bound based algorithms deal with box partitions and use selection rules, discarding tests and termination criteria. The discarding tests are the most important aspect, as they give criteria whether a box can be discarded as it does not contain any optimal solution. We present discarding tests which combine techniques from global single objective optimization with outer approximation techniques from multiobjective convex optimization and with the concept of local upper bounds from multiobjective combinatorial optimization. The new discarding tests aim to find appropriate lower bounds of subsets of the image set in order to compare them with known upper bounds numerically.Multikriterielle Optimierungprobleme sind in diversen Anwendungsgebieten wie beispielsweise in den Wirtschafts- oder Ingenieurwissenschaften zu finden. Da hierbei mehrere konkurrierende Zielfunktionen auftreten, ist die Lösungsmenge eines derartigen Optimierungsproblems im Allgemeinen unendlich groß und kann meist nicht in analytischer Form berechnet werden.
In dieser Dissertation werden neue Branch-and-Bound basierte Algorithmen zur Lösung verschiedener Klassen von multikriteriellen Optimierungsproblemen entwickelt und vorgestellt. Der Branch-and-Bound Ansatz ist eine typische Methode der globalen Optimierung. Einer der neuen Algorithmen löst glatte multikriterielle nichtkonvexe Optimierungsprobleme mit konvexen Nebenbedingungen, während ein zweiter zur Lösung multikriterieller gemischt-ganzzahliger konvexer Optimierungsprobleme dient. Beide Algorithmen garantieren eine gewisse Genauigkeit der berechneten Lösungen und gehören damit zu den ersten deterministischen Algorithmen ihrer Art. Zusätzlich wird ein Algorithmus zur Berechnung einer Überdeckung der Lösungsmenge multikriterieller Optimierungsprobleme mit Entscheidungsunsicherheit vorgestellt. Alle drei Algorithmen wurden numerisch getestet. Die Ergebnisse werden ebenfalls in dieser Arbeit ausgewertet.
Die neuen Algorithmen arbeiten alle mit Boxunterteilungen und nutzen Auswahlregeln, sowie Verwerfungs- und Terminierungskriterien. Dabei spielen gute Verwerfungskriterien eine zentrale Rolle. Diese entscheiden, ob eine Box verworfen werden kann, da diese sicher keine Optimallösung enthält. Die neuen Verwerfungskriterien nutzen Methoden aus der globalen skalarwertigen Optimierung, Approximationstechniken aus der multikriteriellen konvexen Optimierung sowie ein Konzept aus der kombinatorischen Optimierung. Dabei werden stets untere Schranken der Bildmengen konstruiert, die mit bisher berechneten oberen Schranken numerisch verglichen werden können
A Multi-objective DIRECT algorithm for ship hull optimization
The paper is concerned with black-box nonlinear constrained multiobjective
optimization problems. Our interest is the definition of a multi-objective
deterministic partition-based algorithm. The main target of the proposed algorithm is
the solution of a real ship hull optimization problem. To this purpose and in pursuit
of an efficient method, we develop an hybrid algorithm by coupling a multi-objective
DIRECT-type algorithm with an efficient derivative-free local algorithm. The results
obtained on a set of “hard” nonlinear constrained multi-objective test problems show
viability of the proposed approach. Results on a hull-form optimization of a high-speed
catamaran (sailing in head waves in the North Pacific Ocean) are also presented. In
order to consider a real ocean environment, stochastic sea state and speed are taken
into account. The problem is formulated as a multi-objective optimization aimed at
(i) the reduction of the expected value of the mean total resistance in irregular head
waves, at variable speed and (ii) the increase of the ship operability, with respect to a
set of motion-related constraints.We show that the hybrid method performs well also
on this industrial problem