• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.1
• /
• pp.124-130
• /
• 2012

An injection mold cooling circuit for an automotive front bumper was optimally designed in order to simultaneously minimize the average of the standard deviations of the temperature and the difference in mean temperatures of the upper and lower molds for uniform cooling. The temperature distribution for a specified design was evaluated by Moldflow Insight 2010, a commercial injection molding analysis tool. For efficient design, PIAnO (Process Integration, Automation and Optimization), a commercial PIDO tool, was used to integrate and automate injection molding analysis procedure. The weighted-sum method was used to handle the multi-objective optimization problem and PQRSM, a function-based sequential approximate optimizer equipped in PIAnO, to handle numerically noisy responses with respect to the variation of design variables. The optimal average of the standard deviations and difference in mean temperatures were found to be reduced by 9.2% and 56.52%, respectively, compared to the initial ones.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.17 no.10
• /
• pp.938-946
• /
• 2005

Shape optimization of internally finned circular tube has been peformed for periodically fully developed turbulent flow and heat transfer. The physical domain considered in this study is very complicated due to periodic boundary conditions both streamwise and circumferential directions. Therefore, Pareto frontier sets of a heat exchanger can be acquired by coupling the CFD and the multi-objective genetic algorithm, which is a global optimization technique. The optimal values of fin widths $(d_1,\;d_2)$ and fin height (H) are numerically obtained by minimizing the pressure loss and maximizing the heat transfer rate within ranges of $d_1=0.2\sim1.5\;mm,\;d_2=0.2\sun1.5\;mm,\;and\;H=0.2\sim1.5\;mm$. The optimal values of the design variables are acquired after the fifth generation and also compared to those of a local optimization algorithm for the same geometry and conditions.

• Journal of Sensor Science and Technology
• /
• v.33 no.3
• /
• pp.134-138
• /
• 2024

In this study, we propose a ternary D flip-flop using tristate ternary inverters for an energy-efficient ternary circuit design of sequential logic. The tristate ternary inverter is designed by adding the functionality of the transmission gate to a standard ternary inverter without an additional transistor. The proposed flip-flop uses 18.18% fewer transistors than conventional flip-flops do. To verify the advancement of the proposed circuit, we conducted an HSPICE simulation with CMOS 28 nm technology and 0.9 V supply voltage. The simulation results demonstrate that the proposed flip-flop is better than the conventional flip-flop in terms of energy efficiency. The power consumption and worst delay are improved by 11.34% and 28.22%, respectively. The power-delay product improved by 36.35%. The above simulation results show that the proposed design can expand the Pareto frontier of a ternary flip-flop in terms of energy consumption. We expect that the proposed ternary flip-flop will contribute to the development of energy-efficient sensor systems, such as ternary successive approximation register analog-to-digital converters.

• Industrial Engineering and Management Systems
• /
• v.10 no.2
• /
• pp.134-139
• /
• 2011

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

• Journal of the Korean Institute of Gas
• /
• v.1 no.1
• /
• pp.33-40
• /
• 1997

An optimization system, APROGA II using genetic algorithm, was developed to solve multi-modal and multiobjective problems. To begin with, Multi-Niche Crowding(MNC) algorithm was used for multi-modal optimization problem. Secondly, a new algorithm was suggested for multiobjective optimization problem. Pareto dominance tournaments and Sharing on the non-dominated frontier was applied to it to obtain multiple objectives. APROGA II uses these two algorithms and the system has three search engines(previous APROGA search engine, multi-modal search engine and multiobjective search engine). Besides, this system can handle binary and discrete variables. And the validity of APROGA II was proved by solving several test functions and case study problems successfully.

• Industrial Engineering and Management Systems
• /
• v.14 no.3
• /
• pp.299-311
• /
• 2015

Nowadays, the distribution centres aim to reduce costs by reducing inventory and timely shipment. Cross docking is a logistics strategy in which products delivered to a distribution centre by inbound trucks are directly unloaded and transferred to outbound trucks with minimum warehouse storage. Moreover, on-time delivery in a distribution network becomes very crucial especially when several distribution centres and customers are involved. Therefore, an efficient truck scheduling is needed to synchronize the delivery throughout the network in order to satisfy all stake-holders. This paper presents a mathematical model of a mixed integer programming for door assignment and truck scheduling in a multiple inbound and outbound doors cross docking problem according to Just-In-Time concept. The objective is to find the schedule of transhipment operations to simultaneously minimize the total earliness and total tardiness of trucks. Then, a multi-objective differential evolution (MODE) is proposed with an encoding scheme and four decoding strategies, called ITSH, ITDD, OTSH and OTDD, to find a Pareto frontier for the multi-door cross docking problems. The performances of MODE are evaluated using 15 generated instances. The numerical experiments demonstrate that the proposed algorithm is capable of finding a set of diverse and high quality non-dominated solutions.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2008.05a
• /
• pp.400-404
• /
• 2008

댐 군 연계운영을 위한 기존의 많은 최적화 모형은 경제성에 기반을 둔 단일 목적 함수를 가정함으로써 현실과는 동떨어진 결과를 도출하곤 하였다. 따라서 보다 현실적인 최적화 모형이 되기 위해서는 실제 운영과정을 모사할 수 있도록 적절한 초기 가중치를 부여하여 모형을 구축하고, 상충되는 목적간의 절충안으로 파레토 프런티어(Pareto-frontier)를 제시할 수 있는 다중목적 의사결정 기법이 요구된다. 본 연구의 목적은 댐 군 연계 운영을 위한 최적화 모형으로 소개된 CoMOM(Coordinated Multi-reservoir Operating Model)의 다중목적함수에 적합한 초기 가중치를 도출할 수 있는 시스템을 제안하는 것이다. 본 연구에서는 최적화 모형에 적합한 가중치를 결정함에 있어 댐의 초기저수량과 미래의 예상 유입량과 같은 수문 조건을 감안할 필요가 있음에 주목하였다. 이것은 초기저수량과 미래에 예상되는 유입량이 작을 경우 가급적 저수에 중점을 두고, 그 반대일 경우는 발전방류에 주안점을 두는 것이 바람직하다는 사실에서 추정해 볼 수 있는 가정이다. 따라서 댐의 초기 저수량 조건과 유입량 시나리오의 다양한 수문 조건별로 가장 적합한 가중치를 찾아본 후, 수문 조건을 입력요소로, 최적 가중치를 출력요소로 갖는 신경망 모형을 활용해서 수문 조건에 적합한 가중치를 예측할 수 있는 절차를 제안한다. 이 과정에서 최적 가중치를 도출하는 것이 관건이 될 수 있는데, 이를 위해 전승목 (2008)등이 제안한 DEA기반 순위결정 절차를 활용해서 최선의 파레토 최적해와 이에 대응되는 가중치를 찾아 이를 신경망 모형의 출력요소 값으로 활용하였다. 본 연구에서 제안하는 신경망 모형은 임의의 수문 상황에 대해 이에 적합한 CoMOM의 초기 가중치를 결정해 줌으로써 CoMOM과 같은 최적화 모형의 가중치 선정에 따르는 어려움을 극복하는 데 도움이 될 수 있을 것으로 기대된다.