Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2410.03708

Multi-objective optimization for a composite pressure vessel with unequal polar openings

Lyudmyla Rozova·Bilal Meemary·Salim Chaki·Mylène Deléglise-Lagardère·Dmytro Vasiukov
View original source ↗Read source document ↗Export metadata ↓

Abstract

Multi-objective parametric optimization problem is presented for overwrapped composite pressure vessels under internal pressure for storage and heating water. It is solved using the developed iterative optimization algorithm. Optimal values of design parameters for the vessel are obtained by varying the set of parameters for composite layers, such as the thickness of layers and radii of polar openings, which influence the distribution of fiber angles along the vessel. The suggested optimization methodology is based on the mechanical solution for composite vessels and the satisfaction of the main failure criteria. An innovative approach lies in the possibility of using the developed optimization methodology for designing vessels with non-symmetrical filament winding, which have unequal polar openings on the domes. This became possible due to the development of a special numerical mechanical finite element model of a composite vessel. A specific Python program provides the creation of a model and controls the exchange of data between the modules of the iterative optimization process. The numerical model includes the determination of the distribution of fiber angles on the domes and cylindrical part of the vessel as well as changes in layer thicknesses. The optimization problem solution is provided using a Multi-Island Genetic Algorithm, this type of method showed its efficiency for such applications, by allowing to avoid local solutions. Thus, optimal parameters of a composite vessel were found by minimizing composite mass and thickness and maximizing the strain energy. Test solutions using the developed methodology are presented for three types of composite materials to evaluate their possibility for integration into the vessel design model.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lyudmyla Rozova, Bilal Meemary, Salim Chaki, Mylène Deléglise-Lagardère, Dmytro Vasiukov. 2024-09-26. Multi-objective optimization for a composite pressure vessel with unequal polar openings. https://doi.org/10.1016/j.compstruct.2024.118594

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC↗
arXiv2026

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC↗
arXiv2026

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC↗