• 제목/요약/키워드: NSGA-III algorithm

검색결과 3건 처리시간 0.018초

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

  • Hong, Taehoon;Lee, Myeonghwi;Kim, Jimin;Koo, Choongwan;Jeong, Jaemin
    • 국제학술발표논문집
    • /
    • The 6th International Conference on Construction Engineering and Project Management
    • /
    • 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
    • /
    • 제55권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)

  • 김진주;방수혁
    • 한국ITS학회 논문지
    • /
    • 제21권1호
    • /
    • pp.17-34
    • /
    • 2022
  • 본 논문은 수요대응형 모빌리티 이용객의 출발지와 목적지까지 최적 경로 산정을 위한 동적정류장 배정 모형을 개발하였다. 여기서 최적화를 위한 변수로는, 운영자 측면에서 버스통행시간과 이용자 측면에서 서비스 이용 시 추가로 소요되는 정류장까지 도보시간 및 대기시간, 우회시간을 사용하였다. 미국 캘리포니아주 애너하임과 주변 도시를 포함하는 네트워크를 대상으로 승객이 예약한 시종점에서 접근 가능한 동적정류장 리스트를 산정하고 K-means 클러스터링 기법을 이용하여 시종점 그룹들을 각기 차량에 배정하였다. 버스통행시간과 이용자 추가소요시간을 최소화하는 동적정류장 위치 및 버스노선 결정을 위한 모형을 개발하고 다목적 최적화를 위해 NSGA-III 알고리즘을 적용하였다. 최종적으로, 모델의 효용성을 평가하기 위해 이용자 추가소요시간 간의 변수를 조정하여 7개의 시나리오를 설정하였고 이를 통해 목적함수의 타당성을 분석하였다. 그 결과, 운영자 측면에서는 버스통행시간과 승객 대기시간만 고려한 시나리오가, 이용자 측면에서는 버스통행시간, 도보시간, 우회시간을 적용한 시나리오가 가장 우수하였다.