• Title/Summary/Keyword: cost optimization

Search Result 2,325, Processing Time 0.026 seconds

Economic Dispatch Algorithm as Combinatorial Optimization Problems (조합최적화문제로 접근한 경제급전 알고리즘 개발)

  • Min, Kyung-Il;Lee, Su-Won;Choi, In-Kyu;Moon, Young-Hyun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.8
    • /
    • pp.1485-1495
    • /
    • 2009
  • This paper presents a novel approach to economic dispatch (ED) with nonconvex fuel cost function as combinatorial optimization problems (COP) while most of the conventional researches have been developed as function optimization problems (FOP). One nonconvex fuel cost function can be divided into several convex fuel cost functions, and each convex function can be regarded as a generation type (G-type). In that case, ED with nonconvex fuel cost function can be considered as COP finding the best case among all feasible combinations of G-types. In this paper, a genetic algorithm is applied to solve the COP, and the ${\lambda}-P$ function method is used to calculate ED for the fitness function of GA. The ${\lambda}-P$ function method is reviewed briefly and the GA procedure for COP is explained in detail. This paper deals with two kinds of ED problems, namely ED with multiple fuel units (EDMF) and ED with prohibited operating zones (EDPOZ). The proposed method is tested for all the ED problems, and the test results show an improvement in solution cost compared to the results obtained from conventional algorithms.

The Development of New Cost-Effective Optimization Technology for OLED Market Entry

  • Kwon, Woo-Taeg;Kwon, Lee-Seung;Lee, Woo-Sik
    • Journal of Distribution Science
    • /
    • v.17 no.4
    • /
    • pp.51-57
    • /
    • 2019
  • Purpose - This study aims to improve the distribution structure of the OLED market and develop cost-effective optimization techniques. Specifically, it is a study on the optimization of ferric chloride to improve the etch of SUS MASK for OLED. Research design, data, and methodology - Applying the optimal conditions of the experiment, the final confirmation was evaluated for improvement by the Process Capability Index (Cpk). It is possible to derive social performance such as improvement of precision of SUS MASK manufacturing, economic performance such as defect rate, reduction of waste generation and treatment cost, technological achievement such as SUS MASK production technology, improvement of profit structure of technology development and process improvement do. Results - The improvement of the Cpk before the improvement was made was confirmed to be 0.57% with a defect estimate of 25.07% with a failure estimate of 0.57% after the improvement, and 8.84% with a failure estimate of 0.57% level after the improvement. Conclusions - If the conclusions obtained from the specimen experiment are applied to the manufacturing process of SUS MASK, it will be possible to expect excellent cost-effective competitiveness due to the improvement of precision and reduction of defect rate to enhance the OLED market penetration.

Life-cycle-cost optimization for the wind load design of tall buildings equipped with TMDs

  • Venanzi, Ilaria;Ierimonti, Laura;Caracoglia, Luca
    • Wind and Structures
    • /
    • v.30 no.4
    • /
    • pp.379-392
    • /
    • 2020
  • The paper presents a Life-Cycle Cost-based optimization framework for wind-excited tall buildings equipped with Tuned Mass Dampers (TMDs). The objective is to minimize the Life-Cycle Cost that comprises initial costs of the structure, the control system and costs related to repair, maintenance and downtime over the building's lifetime. The integrated optimization of structural sections and mass ratio of the TMDs is carried out, leading to a set of Pareto optimal solutions. The main advantage of the proposed methodology is that, differently from the traditional optimal design approach, it allows to perform the unified design of both the structure and the control system in a Life Cycle Cost Analysis framework. The procedure quantifies wind-induced losses, related to structural and nonstructural damage, considering the stochastic nature of the loads (wind velocity and direction), the specificity of the structural modeling (e.g., non-shear-type vibration modes and torsional effects) and the presence of the TMDs. Both serviceability and ultimate limit states related to the structure and the TMDs' damage are adopted for the computation of repair costs. The application to a case study tall building allows to demonstrate the efficiency of the procedure for the integrated design of the structure and the control system.

Development of Query Transformation Method by Cost Optimization

  • Altayeva, Aigerim Bakatkaliyevna;Yoon, Youngmi;Cho, Young Im
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.1
    • /
    • pp.36-43
    • /
    • 2016
  • The transformation time among queries in the database management system (DBMS) is responsible for the execution time of users' queries, because a conventional DBMS does not consider the transformation cost when queries are transformed for execution. To reduce the transformation time (cost reduction) during execution, we propose an optimal query transformation method by exploring queries from a cost-based point of view. This cost-based point of view means considering the cost whenever queries are transformed for execution. Toward that end, we explore and compare set off heuristic, linear, and exhaustive cost-based transformations. Further, we describe practical methods of cost-based transformation integration and some query transformation problems. Our results show that, some cost-based transformations significantly improve query execution time. For instance, linear and heuristic transformed queries work 43% and 74% better than exhaustive queries.

A new hybrid meta-heuristic for structural design: ranked particles optimization

  • Kaveh, A.;Nasrollahi, A.
    • Structural Engineering and Mechanics
    • /
    • v.52 no.2
    • /
    • pp.405-426
    • /
    • 2014
  • In this paper, a new meta-heuristic algorithm named Ranked Particles Optimization (RPO), is presented. This algorithm is not inspired from natural or physical phenomena. However, it is based on numerous researches in the field of meta-heuristic optimization algorithms. In this algorithm, like other meta-heuristic algorithms, optimization process starts with by producing a population of random solutions, Particles, located in the feasible search space. In the next step, cost functions corresponding to all random particles are evaluated and some of those having minimum cost functions are stored. These particles are ranked and their weighted average is calculated and named Ranked Center. New solutions are produced by moving each particle along its previous motion, the ranked center, and the best particle found thus far. The robustness of this algorithm is verified by solving some mathematical and structural optimization problems. Simplicity of implementation and reaching to desired solution are two main characteristics of this algorithm.

A Study on Route Optimization Scheme using Correspondent Information for in the PMIPv6 considering Inter-MAG (Inter-MAG이 고려된 PMIPv6 환경에서 전달자 정보를 이용한 경로 최적화 기법에 관한 연구)

  • Choi, Young Hyun;Park, Min Woo;Eom, Jung Ho;Chung, Tai M
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.3
    • /
    • pp.59-68
    • /
    • 2010
  • In the paper, we proposed the Using Correspondent Information for Route Optimization on PMIPv6 over Inter-MAG. Proxy Mobile IPv6 has the problem that a mobile node sends data packets through inefficient routing paths when communicating other mobile node. Route optimization schemes are proposed to solve the triangle routing problem that creates the shortest routing path by leaving the inefficient routing paths. We proposed Correspondent Information Route Optimization scheme to reduce signaling cost as compared with other route optimization scheme. We can reduce signaling cost of route optimization through the Correspondent Information message on basic PMIPv6 and hand-off environment.

One-Sided Optimal Assignment and Swap Algorithm for Two-Sided Optimization of Assignment Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.75-82
    • /
    • 2015
  • Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm of two-sided optimization with time complexity $O(n^4)$. This paper suggests one-sided optimal assignment and swap optimization algorithm with time complexity $O(n^2)$ can be achieve the goal of two-sided optimization. This algorithm selects the minimum cost for each row, and reassigns over-assigned to under-assigned cell. Next, that verifies the existence of swap optimization candidates, and swap optimizes with ${\kappa}-opt({\kappa}=2,3)$. For 27 experimental data, the swap-optimization performs only 22% of data, and 78% of data can be get the two-sided optimal result through one-sided optimal result. Also, that can be improves on the solution of best known solution for partial problems.

Cost optimization of composite floor trusses

  • Klansek, Uros;Silih, Simon;Kravanja, Stojan
    • Steel and Composite Structures
    • /
    • v.6 no.5
    • /
    • pp.435-457
    • /
    • 2006
  • The paper presents the cost optimization of composite floor trusses composed from a reinforced concrete slab of constant depth and steel trusses consisting of hot rolled channel sections. The optimization was performed by the nonlinear programming approach, NLP. Accordingly, a NLP optimization model for composite floor trusses was developed. An accurate objective function of the manufacturing material, power and labour costs was proposed to be defined for the optimization. Alongside the costs, the objective function also considers the fabrication times, and the electrical power and material consumption. Composite trusses were optimized according to Eurocode 4 for the conditions of both the ultimate and the serviceability limit states. A numerical example of the optimization of the composite truss system presented at the end of the paper demonstrates the applicability of the proposed approach.

A Study on the Burn-in Optimization of Computer Monitor (Computer용 Monitor 완제품의 Burn-in 최적화에 관한 연구)

  • Park, Jong-Man
    • Journal of Korean Society for Quality Management
    • /
    • v.23 no.4
    • /
    • pp.148-156
    • /
    • 1995
  • The past approach to burn-in optimization have been focused mainly in cost minimization problem during entire product life cycle. But in the case of practical application, burn-in optimization under reliability restriction might be preferred to burn-in optimization by cost minimization. Accordingly this paper shows real examples which estimate the practical burn-in period through application of heuristic method and select the best reliability model through comparison of reliability performance measures.

  • PDF

An Application of Harmony Search Algorithm for Operational Cost Minimization of MicroGrid System (마이크로 그리드 운영비용 최소화를 위한 Harmony Search 알고리즘 응용)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;Kim, Chul-Hwan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.7
    • /
    • pp.1287-1293
    • /
    • 2009
  • This paper presents an application of Harmony Search (HM) meta-heuristic optimization algorithm for optimal operation of microgrid system. The microgrid system considered in this paper consists of a wind turbine, a diesel generator, and a fuel cell. An one day load profile which divided 20 minute data and wind resource for wind turbine generator were used for the study. In optimization, the HS algorithm is used for solving the problem of microgrid system operation which a various generation resources are available to meet the customer load demand with minimum operating cost. The application of HS algorithm to optimal operation of microgrid proves its effectiveness to determine optimally the generating resources without any differences of load mismatch and having its nature of fast convergency time as compared to other optimization method.