• Title/Summary/Keyword: NSGA-III algorithm

Search Result 3, Processing Time 0.02 seconds

A comparison of three multi-objective evolutionary algorithms for optimal building design

  • Hong, Taehoon;Lee, Myeonghwi;Kim, Jimin;Koo, Choongwan;Jeong, Jaemin
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.656-657
    • /
    • 2015
  • Recently, Multi-Objective Optimization of design elements is an important issue in building design. Design variables that considering the specificities of the different environments should use the appropriate algorithm on optimization process. The purpose of this study is to compare and analyze the optimal solution using three evolutionary algorithms and energy modeling simulation. This paper consists of three steps: i)Developing three evolutionary algorithm model for optimization of design elements ; ii) Conducting Multi-Objective Optimization based on the developed model ; iii) Conducting comparative analysis of the optimal solution from each of the algorithms. Including Non-dominated Sorted Genetic Algorithm (NSGA-II), Multi-Objective Particle Swarm Optimization (MOPSO) and Random Search were used for optimization. Each algorithm showed similar range of result data. However, the execution speed of the optimization using the algorithm was shown a difference. NSGA-II showed the fastest execution speed. Moreover, the most optimal solution distribution is derived from NSGA-II.

  • PDF

An intelligent optimization method for the HCSB blanket based on an improved multi-objective NSGA-III algorithm and an adaptive BP neural network

  • Wen Zhou;Guomin Sun;Shuichiro Miwa;Zihui Yang;Zhuang Li;Di Zhang;Jianye Wang
    • Nuclear Engineering and Technology
    • /
    • v.55 no.9
    • /
    • pp.3150-3163
    • /
    • 2023
  • To improve the performance of blanket: maximizing the tritium breeding rate (TBR) for tritium self-sufficiency, and minimizing the Dose of backplate for radiation protection, most previous studies are based on manual corrections to adjust the blanket structure to achieve optimization design, but it is difficult to find an optimal structure and tends to be trapped by local optimizations as it involves multiphysics field design, which is also inefficient and time-consuming process. The artificial intelligence (AI) maybe is a potential method for the optimization design of the blanket. So, this paper aims to develop an intelligent optimization method based on an improved multi-objective NSGA-III algorithm and an adaptive BP neural network to solve these problems mentioned above. This method has been applied on optimizing the radial arrangement of a conceptual design of CFETR HCSB blanket. Finally, a series of optimal radial arrangements are obtained under the constraints that the temperature of each component of the blanket does not exceed the limit and the radial length remains unchanged, the efficiency of the blanket optimization design is significantly improved. This study will provide a clue and inspiration for the application of artificial intelligence technology in the optimization design of blanket.

Development of a Model for Dynamic Station Assignmentto Optimize Demand Responsive Transit Operation (수요대응형 모빌리티 최적 운영을 위한 동적정류장 배정 모형 개발)

  • Kim, Jinju;Bang, Soohyuk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.1
    • /
    • pp.17-34
    • /
    • 2022
  • This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.