• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.15 no.3
• /
• pp.8-14
• /
• 2016

Medical bed head consoles (BHC) are generally used to increase the efficiency of medical equipment and speed the medical treatment response time. The BHC design has been consistently improved including a movable shelf unit that is embedded to mount stably medical instruments on the lower part of the main console. The cost of a BHC can be reduced through design optimization to limit the overall weight. However, as the size of a head console might decrease due to design optimization, the BHC deflection could be increased. In this study, multi-objective optimal design was adopted to consider this BHC design problem. In order to reduce the cost of optimization planning, an approximate model was applied for the design optimization. In the context of approximate optimization, we used the response surface method and non-dominant sorting genetic algorithm developed from various fields. Multi-objective optimal solutions were also compared with a single objective optimal design.

• Journal of the Korean Society for Precision Engineering
• /
• v.32 no.9
• /
• pp.815-824
• /
• 2015

In this study, we conducted the approximate multi-objective optimization of gap sizes of pressurized-water reactor (PWR) annular fuels. To determine the contacting tendency of the inner-outer gaps between the annular fuel pellets and cladding, thermoelastic-plastic-creep (TEPC)analysis of PWR annular fuels was performed, using in-house FE code. For the efficient heat transfer at certain levels of stress, we investigated the tensile, compressive hoop stress and temperature, and optimized the gap sizes using the non-dominant sorting genetic algorithm (NSGA-II). For this, response surface models of objective and constraint functions were generated, using central composite (CCD) and D-optimal design. The accuracy of approximate models was evaluated through $R^2$ value. The obtained optimal solutions by NSGA-II were verified through the TEPC analysis, and we compared the obtained optimum solutions and generated errors from the CCD and D-optimal design. We observed that optimum solutions differ, according to design of experiments (DOE) method.

• Membrane and Water Treatment
• /
• v.10 no.1
• /
• pp.75-82
• /
• 2019

In a highly urbanized area, land availability is limited for the installation of space consuming stormwater systems for best management practices (BMPs), leading to the consideration of underground stormwater treatment devices connected to the stormwater pipe system. The configuration of a stormwater pipe network determines the hydrological and pollutant transport characteristics of the stormwater discharged through the pipe network, and thus should be an important design consideration for effective management of stormwater quantity and quality. This article presents a multi-objective optimization approach for designing a stormwater pipe network with on-line stormwater treatment devices to achieve an optimal trade-off between the total installation cost and the annual removal efficiency of total suspended solids (TSS). The Non-dominated Sorted Genetic Algorithm-II (NSGA-II) was adapted to solve the multi-objective optimization problem. The study site used to demonstrate the developed approach was a commercial area that has an existing pipe network with eight outfalls into an adjacent stream in Yongin City, South Korea. The stormwater management model (SWMM) was calibrated based on the data obtained from a subcatchment within the study area and was further used to simulate the flow rates and TSS discharge rates through a given pipe network for the entire study area. In the simulation, an underground stormwater treatment device was assumed to be installed at each outfall and sized proportional to the average flow rate at the outfall. The total installation cost for the pipes and underground devices was estimated based on empirical formulas using the flow rates and TSS discharge rates simulated by the SWMM. In the demonstration example, the installation cost could be reduced by up to 9% while the annual TSS removal efficiency could be increased by 4% compared to the original pipe network configuration. The annual TSS removal efficiency was relatively insensitive to the total installation cost in the Pareto-optimal solutions of the pipe network design. The results suggested that the installation cost of the pipes and stormwater treatment devices can be substantially reduced without significantly compromising the pollutant removal efficiency when the pipe network is optimally designed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.108-115
• /
• 2007

This paper proposes a new optimization algorithm prescribed by GBNSGA(Goal-Pareto Based Non-dominated Sorting Genetic Algorithm) whose result satisfies the user's needs and goals to enhance the performance of optimization. Typically, lots of real-world engineering problems encounter simultaneous optimization subject to satisfying prescribed multiple objectives. Unfortunately, since these objectives might be mutually competitive, it is hardly to find a unique solution satisfying every objectives. Instead, many researches have been investigated in order to obtain an optimal solution with sacrificing more than one objectives. This paper introduces a novel optimization scheme named by GBNSGA obeying both goals as well as objectives as possible as it can via allocating candidated solutions on Pareto front, which enhances the performance of Pareto based optimization. The performance of the proposed GBNSGA will be compared with that of the conventional NSGA and weighted-sum approach.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.2
• /
• pp.159-164
• /
• 2004

Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots and then scheduling these sublots in order to accelerate the completion of jobs in a multi-stage production system. Anew genetic algorithm (NGA) is proposed for an-job, m-machine, equal-size sublot lot-streaming flow shop scheduling problem with delivery windows in which the objective is to minimize the mean weighted absolute deviation of job completion times from due dates. The performance of NGA is compared with that of an adjacent pairwise interchange (API) method and the results of computational experiments show that NGA works well for this type of problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1079-1085
• /
• 2007

This Paper Proposes a new optimization algorithm named by GBNSGA-II(Goal-pareto Based Non-dominated Sorting Genetic Algorithm-II) which uses Goal Programming to find non-dominated solutions in NSGA-II. Although the conventional NSGA is very popular to solve multiobjective optimization problem, its high computational complexity, lack of elitism and difficulty of selecting sharing parameter have been considered as problems to be overcome. To overcome these problems, NSGA-II has been introduced as the alternative for multiobjective optimization algorithm preventing aforementioned defects arising in the conventional NSGA. Together with advantageous features of NSGA-II, this paper proposes rather effective optimization algorithm formulated by purposely combining NSGA-II algorithm with GP (Goal Programming) subject to satisfying multiple objectives as possible as it can. By conducting computer simulations, the superiority of the proposed GBNSGA-II algorithm will be verified in the aspects of the effectiveness on optimization process in presence of a priori constrained goals and its fast converging capability.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.288-298
• /
• 2012

Lot sizing and shipment scheduling are two interrelated decisions made by a manufacturing plant and a third-party logistics distribution center. This paper analyzes a dynamic inbound ordering problem and shipment problem with a freight container cost, in which the order size of multiple products and single container type are simultaneously considered. In the problem, each ordered product placed in a period is immediately shipped by some freight containers in the period, and the total freight cost is proportional to the number of containers employed. It is assumed that the load size of each product is equal and backlogging is not allowed. The objective of this study is to simultaneously determine the lot-sizes and the shipment schedule that minimize the total costs, which consist of production cost, inventory holding cost, and freight cost. Because the problem is NP-hard, we propose three meta-heuristic algorithms: a simulated annealing algorithm, a genetic algorithm, and a new population-based evolutionary meta-heuristic called self-evolution algorithm. The performance of the meta-heuristic algorithms is compared with a local search heuristic proposed by the previous paper in terms of the average deviation from the optimal solution in small size problems and the average deviation from the best one among the replications of the meta-heuristic algorithms in large size problems.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.248-256
• /
• 2021

Now that we're in the big data era, data has taken on a new significance as the storage capacity has exploded from trillion bytes to petabytes at breakneck pace. As the use of cloud computing expands and becomes more commonly accepted, several businesses and institutions are opting to store their requests and data there. Cloud storage's concept of a nearly infinite storage resource pool makes data storage and access scalable and readily available. The majority of them, on the other hand, favour a single cloud because of the simplicity and inexpensive storage costs it offers in the near run. Cloud-based data storage, on the other hand, has concerns such as vendor lock-in, privacy leakage and unavailability. With geographically dispersed cloud storage providers, multicloud storage can alleviate these dangers. One of the key challenges in this storage system is to arrange user data in a cost-effective and high-availability manner. A multicloud storage architecture is given in this study. Next, a multi-objective optimization problem is defined to minimise total costs and maximise data availability at the same time, which can be solved using a technique based on the non-dominated sorting genetic algorithm II (NSGA-II) and obtain a set of non-dominated solutions known as the Pareto-optimal set.. When consumers can't pick from the Pareto-optimal set directly, a method based on Principal Component Analysis (PCA) is presented to find the best answer. To sum it all up, thorough tests based on a variety of real-world cloud storage scenarios have proven that the proposed method performs as expected.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.196-203
• /
• 2022

The resource constrained scheduling problem (RCSP) constitutes one of the most challenging problems in Project Management, as it combines multiple parameters, contradicting objectives (project completion within certain deadlines, resource allocation within resource availability margins and with reduced fluctuations), strict constraints (precedence constraints between activities), while its complexity grows with the increase in the number of activities being executed. Due to the large solution space size, this work investigates the application of Genetic Algorithms to approximate the optimal resource alolocation and obtain optimal trade-offs between different project goals. This analysis uses the cost of exceeding the daily resource availability, the cost from the day-by-day resource movement in and out of the site and the cost for using resources day-by-day, to form the objective cost function. The model is applied in different case studies: 1 project consisting of 10 activities, 4 repetitive projects consisting of 40 activities in total and 16 repetitive projects consisting of 160 activities in total, in order to evaluate the effectiveness of the algorithm in different-size solution spaces and under alternative optimization criteria by examining the quality of the solution and the required computational time. The case studies 2 & 3 have been developed by building upon the recurrence of the unit/sub-project (10 activities), meaning that the initial problem is multiplied four and sixteen times respectively. The evaluation results indicate that the proposed model can efficiently provide reliable solutions with respect to the individual goals assigned in every case study regardless of the project scale.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.127-129
• /
• 2002

This paper presents a fuzzy-GA method to resolve dispersed generator placement for distribution systems. The problem formulation considers an objective to reduce power loss costs of distribution systems and the constraints with the number or size of dispersed generators and the deviation of the bus voltage. The main idea of solving fuzzy nonlinear goal programming is to transform the original objective function and constraints into the equivalent multi-objectives functions with fuzzy sets to evaluate their imprecise nature and solve the problem using the proposed genetic algorithm, without any transformation for this nonlinear problem to a linear model or other methods. The method proposed is applied to the sample systems to demonstrate its effectiveness.