• Title/Summary/Keyword: Pareto solutions

Search Result 142, Processing Time 0.016 seconds

Design Optimization for 3D Woven Materials Based on Regression Analysis (회귀 분석에 기반한 3차원 엮임 재료의 최적설계)

  • Byungmo, Kim;Kichan, Sim;Seung-Hyun, Ha
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.35 no.6
    • /
    • pp.351-356
    • /
    • 2022
  • In this paper, we present the regression analysis and design optimization for improving the permeability of 3D woven materials based on numerical analysis data. First, the parametric analysis model is generated with variables that define the gap sizes between each directional wire of the woven material. Then, material properties such as bulk modulus, thermal conductivity coefficient, and permeability are calculated using numerical analysis, and these material data are used in the polynomial-based regression analysis. The Pareto optimal solution is obtained between bulk modulus and permeability by using multi-objective optimization and shows their trade-off relation. In addition, gradient-based design optimization is applied to maximize the fluid permeability for 3D woven materials, and the optimal designs are obtained according to the various minimum bulk modulus constraints. Finally, the optimal solutions from regression equations are verified to demonstrate the accuracy of the proposed method.

An Optimal Intermodal-Transport Algorithm using Dynamic Programming (동적 프로그래밍을 이용한 최적복합운송 알고리즘)

  • Cho Jae-Hyung;Kim Hyun-Soo;Choi Hyung-Rim;Park Nam-Kyu;Kim So-Yeon
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2006.05a
    • /
    • pp.95-108
    • /
    • 2006
  • Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. Cargoes and stopovers can be changed numerously according to the change of transportation modes, thus being a NP-hard problem. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range and effective cost range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

  • PDF