• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.26 no.2
• /
• pp.54-60
• /
• 2018

This paper contains the multi-mission scheduling optimization of UAV within a given operating time. Mission scheduling optimization problem is one of combinatorial optimization, and it has been shown to be NP-hard(non-deterministic polynomial-time hardness). In this problem, as the size of the problem increases, the computation time increases dramatically. So, we applied the genetic algorithm to this problem. For the application, we set the mission scenario, objective function, and constraints, and then, performed simulation with MATLAB. After 1000 case simulation, we evaluate the optimality and computing time in comparison with global optimum from MILP(Mixed Integer Linear Programming).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• IE interfaces
• /
• v.11 no.3
• /
• pp.65-75
• /
• 1998

This research considers the problem of scheduling jobs on parallel machines with non-common due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the due dates. Job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two problems. For the first of these, the number of different types of additional: resources and resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear programming and the Lagrangian relaxation approach is used. For the second case, there exists one single type of additional resource and the resource requirements per job are zero or one. We show how to formulate the problem as an assignment problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.4 no.2
• /
• pp.97-105
• /
• 1978

A mathematical model is developed in order to describe the network configuration and heating distribution to a Central District Heating System for an Urban Residential Community. The purpose of using this model is to optimize operating costs and to distribute heat to the Residential Community efficiently. In particular, because of the inherent nonlinearity and dual optimization of the problem a dyamic programming approach is taken. It is turned out that the optimal cost of the system is a strong non-linear function of the network. In particular, it is found that increasing N, the number of houses, may not necessarily imply increased costs. It is felt that past failure of producing economical systems may be due to the improper attention given to the network.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.9-22
• /
• 1999

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.

• Structural Engineering and Mechanics
• /
• v.31 no.3
• /
• pp.277-296
• /
• 2009

The paper investigates the dynamic behaviour of stiffened panels. The coupled differential equations for eccentric stiffening configuration are first derived. Then a semi-analytical procedure for dynamic analysis of stiffened panels is presented. Unlike finite element or finite strip methods, where the plate is discretized into a set of elements or strips, the plate in this procedure is treated as a single element. The potential energy of the structure is first expressed in terms generalized functions that describe the longitudinal and transverse displacement profiles. The resulting non-linear strain energy functions are then transformed into unconstrained optimization problem in which mathematical programming techniques are employed to determine the magnitude of the lowest natural frequency and the associated mode shape for pre-selected plate/stiffener geometric parameters. The described procedure is verified with other numerical methods for several stiffened panels. Results are then presented showing the variation of the natural frequency with plate/stiffener geometric parameters for various stiffening configurations.

• Journal of Korean Society for Quality Management
• /
• v.19 no.1
• /
• pp.129-140
• /
• 1991

This paper deals with on (S-1, S) spare-part inventory model for multi-stage machine repair problem with attrition. The steady-state availability of the system is maximized under some constraints such as total cost, available space etc.. The problem is formulated as a closed queueing network and the system availability is calculated by Buzen's computational algorithm. In order to find the optimal numbers of spare units and repair channels for each operating stage, the problem is formulated as a non-linear integer programming(NLIP) problem and an efficient algorithm. which is a natural extension of the new Lawler-Bell algorithm of Sasaki et el., is used to solve the NLIP problem. A numerical example is given to illustrate the algorithm.

• Journal of the korean Society of Automotive Engineers
• /
• v.14 no.1
• /
• pp.38-46
• /
• 1992

An optimal design technique for minimum power loss in Kopp Ball Variator Continuously Variable Transmission is developed. Kinematic analysis of traction drive contact is performed to find spin for Kopp Ball Variator, and traction force and torque are calculated from mathem atical model of traction drive contact. The objective function for optimal design is total power loss including contact loss and bearing losses. The design contraints are derived from energy balance for input and output power. The formulated optimal design problem is implemented to a non-linear programming algorithm to find minimum power loss. The performance of optimal ly designed Kopp Ball Variator shows that efficiency is increased about 5-10% compare to a commercial unit.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.20 no.2
• /
• pp.21-26
• /
• 1983

In this light of economical engineering, the optimal configurations of ship structure that can save weights, production costs and operation costs should be investigated. This paper presents the general method of optimization based on non-linear programming and its application to weight and/or cost minimization of ship structure. Oil tanker is chosen as a ship type because of simple layout and easy calculation of stress. With the data of 16,200 DWT oil tanker built by KSEC 1980, this paper shows the procedure mentioned above by means of SUMT combined with two selected search methods. Then the differences between original and redesigned tanker structures are discussed.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.15 no.4
• /
• pp.1-5
• /
• 1978

The preliminary ship design step is made into a non-linear programming(NLP) problem. And using SUMT-exterior method and Hook Jeeves pattern search, the optimum ship characteristics are determined for the case where the ship is built in Korea and is operated by Koreans. Three programs for bulk carrier, tanker, and container ship are constructed and several sensitivity tests are performed. The result has little difference from the results of the other papers, but for high interest rate of return, slightly larger and faster ship is superior, and for low labour costs, slightly smaller and slower ship is superior.