• Title/Summary/Keyword: Large-scale optimization

Search Result 374, Processing Time 0.027 seconds

A Permanent Magnet Pole Shape Optimization for a 6MW BLDC Motor by using Response Surface Method (I) (RSM을 이용한 6MW BLDC용 영구자석의 형상 최적화 연구 (I))

  • Woo, Sung-Hyun;Chung, Hyun-Koo;Shin, Pan-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2008.04c
    • /
    • pp.65-67
    • /
    • 2008
  • An adaptive response surface method with Latin Hypercube sampling strategy is employed to optimize a magnet pole shape of large scale BLDC motor to minimize the cogging torque. The proposed algorithm consists of the multi-objective Pareto optimization and ($1+{\lambda}$) evolution strategy to find the global optimal points with relatively fewer sampling data. In the adaptive RSM, an adaptive sampling point insertion method is developed utilizing the design sensitivities computed by using finite element method to set a reasonable response surface with a relatively small number of sampling points. The developed algorithm is applied to the shape optimization of PM poles for 6MW BLDC motor.

  • PDF

A Study on the Job Shop Scheduling Using CSP and SA (CSP와 SA를 이용한 Job Shop 일정계획에 관한 연구)

  • 윤종준;손정수;이화기
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.61
    • /
    • pp.105-114
    • /
    • 2000
  • Job Shop Problem which consists of the m different machines and n jobs is a NP-hard problem of the combinatorial optimization. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. Each machine can process at most one operation at a time. The purpose of this paper is to develop the heuristic method to solve large scale scheduling problem using Constraint Satisfaction Problem method and Simulated Annealing. The proposed heuristic method consists of the search algorithm and optimization algorithm. The search algorithm is to find the solution in the solution space using CSP concept such as backtracking and domain reduction. The optimization algorithm is to search the optimal solution using SA. This method is applied to MT06, MT10 and MT20 Job Shop Problem, and compared with other heuristic method.

  • PDF

Optimizing Content Duration for Mobile Ads

  • Truong, Vinh
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.4
    • /
    • pp.283-288
    • /
    • 2016
  • Optimizing the number of ad clicks is a large-scale learning problem that is central to the multi-billion-dollar mobile advertising industry. There are currently several optimization methods being used, including ad mediation and ad positioning. Recently, researchers have recommended using ad refresh interval as a new method for optimizing mobile advertising. This paper applies that new method to optimize content duration for mobile ads. The result achieved from this optimization study could further increase revenue for mobile advertisers and publishers. This research has high applicability for the growing mobile advertising industry. It also lays out a solid background for future research in this promising area.

Optimal Production Cost Evaluation Using Karmarkar Algorithm (Karmarkar 알고리듬을 이용한 최적 발전시뮬레이션)

  • Song, K.Y.;Kim, Y.H.;Oh, K.H.
    • Proceedings of the KIEE Conference
    • /
    • 1995.11a
    • /
    • pp.113-116
    • /
    • 1995
  • In this study, we formulate production costing problem with environmental and operational constraints into an optimization problem of LP form. In the process of formulation, auxiliary constraints on which reflect unit loading order are constructed to reduce the size of optimization problem by economic operation rules. As a solution of the optimization problem in LP form, we use Karmarkar's method which performs much faster than simplex method in solving large scale LP problem. The proposed production costing algorithm is applied to IEEE Reliability Test System, and performs production simulation under environmental and operational constraints. Test and computer results are given to show the accuracy and usefulness of the proposed algorithm in the field of power system planning.

  • PDF

A Permanent Magnet Pole Shape Optimization for a 6MW BLDC Motor by using Response Surface Method (II) (RSM을 이용한 6MW BLDC용 영구자석의 형상 최적화 연구 (II))

  • Woo, Sung-Hyun;Chung, Hyun-Koo;Shin, Pan-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.701-702
    • /
    • 2008
  • An adaptive response surface method with Latin Hypercube sampling strategy is employed to optimize a magnet pole shape of large scale BLDC motor to minimize the cogging torque. The proposed algorithm consists of the multi-objective Pareto optimization and (1+${\lambda}$) evolution strategy to find the global optimal points with relatively fewer sampling data. In the adaptive RSM, an adaptive sampling point insertion method is developed utilizing the design sensitivities computed by using finite element method to get a reasonable response surface with a relatively small number of sampling points. The developed algorithm is applied to the shape optimization of PM poles for 6 MW BLDC motor, and the cogging torque is reduced to 19% of the initial one.

  • PDF

Multi-Level Response Surface Approximation for Large-Scale Robust Design Optimization Problems (다층분석법을 이용한 대규모 파라미터 설계 최적화)

  • Kim, Young-Jin
    • Korean Management Science Review
    • /
    • v.24 no.2
    • /
    • pp.73-80
    • /
    • 2007
  • Robust Design(RD) is a cost-effective methodology to determine the optimal settings of control factors that make a product performance insensitive to the influence of noise factors. To better facilitate the robust design optimization, a dual response surface approach, which models both the process mean and standard deviation as separate response surfaces, has been successfully accepted by researchers and practitioners. However, the construction of response surface approximations has been limited to problems with only a few variables, mainly due to an excessive number of experimental runs necessary to fit sufficiently accurate models. In this regard, an innovative response surface approach has been proposed to investigate robust design optimization problems with larger number of variables. Response surfaces for process mean and standard deviation are partitioned and estimated based on the multi-level approximation method, which may reduce the number of experimental runs necessary for fitting response surface models to a great extent. The applicability and usefulness of proposed approach have been demonstrated through an illustrative example.

Towards Resource-Generative Skyscrapers

  • Imam, Mohamed;Kolarevic, Branko
    • International Journal of High-Rise Buildings
    • /
    • v.7 no.2
    • /
    • pp.161-170
    • /
    • 2018
  • Rapid urbanization, resource depletion, and limited land are further increasing the need for skyscrapers in city centers; therefore, it is imperative to enhance tall building performance efficiency and energy-generative capability. Potential performance improvements can be explored using parametric multi-objective optimization, aided by evaluation tools, such as computational fluid dynamics and energy analysis software, to visualize and explore skyscrapers' multi-resource, multi-system generative potential. An optimization-centered, software-based design platform can potentially enable the simultaneous exploration of multiple strategies for the decreased consumption and large-scale production of multiple resources. Resource Generative Skyscrapers (RGS) are proposed as a possible solution to further explore and optimize the generative potentials of skyscrapers. RGS can be optimized with waste-energy-harvesting capabilities by capitalizing on passive features of integrated renewable systems. This paper describes various resource-generation technologies suitable for a synergetic integration within the RGS typology, and the software tools that can facilitate exploration of their optimal use.

Reduced record method for efficient time history dynamic analysis and optimal design

  • Kaveh, A.;Aghakouchak, A.A.;Zakian, P.
    • Earthquakes and Structures
    • /
    • v.8 no.3
    • /
    • pp.639-663
    • /
    • 2015
  • Time history dynamic structural analysis is a time consuming procedure when used for large-scale structures or iterative analysis in structural optimization. This article proposes a new methodology for approximate prediction of extremum point of the response history via wavelets. The method changes original record into a reduced record, decreasing the computational time of the analysis. This reduced record can be utilized in iterative structural dynamic analysis of optimization and hence significantly reduces the overall computational effort. Design examples are included to demonstrate the capability and efficiency of the Reduced Record Method (RRM) when utilized in optimal design of frame structures using meta-heuristic algorithms.

Cooperative Coevolution Differential Evolution (협력적 공진화 차등진화)

  • Shin, Seong-Yoon;Lee, Hyun-Chang;Shin, Kwang-Seong;Kim, Hyung-Jin;Lee, Jae-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.559-560
    • /
    • 2021
  • Differential evolution is an efficient algorithm for solving continuous optimization problems. However, applying differential evolution to solve large-scale optimization problems dramatically degrades performance and exponentially increases runtime. Therefore, a novel cooperative coevolution differential evolution based on Spark (known as SparkDECC) is proposed. The divide-and-conquer strategy is used in SparkDECC.

  • PDF

A Study on the Comparison of Performances Between Direct Method and Approximation Method in Structural Optimization (구조최적설계시 직접법 및 근사법 알고리즘의 성능 비교에 관한 연구)

  • 박영선;이상헌;박경진
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.2
    • /
    • pp.313-322
    • /
    • 1994
  • Structural optimization has been developed by two methods. One is the direct method which applies the Nonlinear Programming (NLP) algorithm directly to the structural optimization problem. This method is known to be very excellent mathematically. However, it is very expensive for large-scale problems due to the one-dimensional line search. The other method is the approximation method which utilizes the engineering senses very well. The original problem is approximated to a simple problem and an NLP algorithm is adopted for solving the approximated problems. Practical solutions are obtained with low cost by this method. The two methods are compared through standard structural optimization problems. The Finite element method with truss and beam elements is used for the structural and sensitivity analyses. The results are analyzed based on the convergence performances, the number is function calculations, the quality of the cost functions, and etc. The applications of both methods are also discussed.