• Journal of the military operations research society of Korea
• /
• v.29 no.2
• /
• pp.61-80
• /
• 2003

A fire sequencing problem is considered. Fire sequencing problem is a kind of scheduling problem that seeks to minimize the overall time span under a result of weapon­target allocation problem. The assigned weapons should impact a target simultaneously and a weapon cannot transfer the firing against another target before all planned rounds are consumed. The computational complexity of the fire sequencing problem is strongly NP­complete even if the number of weapons is two, so it is difficult to get the optimal solution in a reasonable time by the mathematical programming approach. Therefore, a genetic algorithm is adopted as a solution method, in which the representation of the solution, crossover and mutation strategies are applied on a specific condition. Computational results using randomly generated data are presented. We compared the solutions given by CPLEX and the genetic algorithm. Above $7(weapon){\times}15(target)$ size problems, CPLEX could not solve the problem even if we take enough time to solve the problem since the required memory size increases dramatically as the number of nodes expands. On the other hand, genetic algorithm approach solves all experimental problems very quickly and gives good solution quality.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.871-880
• /
• 1999

The main purpose of queueing theory is to find the optimal solution for maintaining systems such as service facilities. Analyzing the overfolw process provides an important information for the solution in queueing systems with finite capacity. In this thesis we approximate the expected time until the first overflow in M/G/1/K/N queueing systems. Results will be applied to approximate the expected time until the first reduction of source population system. Simulation results show that our approximation is applicable to real situations.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1810-1815
• /
• 2011

Although the effectiveness of an express train's service is measured in "Total System Time or Cost" units, many cases had used indirect method what based on the distintion by number of passengers in a station or experiential knowledgements. These methods are not guarantee itself as an optimal strategy. Focusing "Total System Time or Cost" directly, this paper investigates the express train service's stop scheduling based on each OD-volume and trip time which mainly affect system time and cost. To do this, we built an IP model which has a binary set presenting express train's stop scheduling as decision variable and suggest a Genetic Algorithm (GA) to find heuristic optimal solution.

• Industrial Engineering and Management Systems
• /
• v.6 no.2
• /
• pp.106-118
• /
• 2007

This paper present a new optimization model to generate aggregate production planning by considering electric cost. The new Time Of Switching (TOS) electric type is introduced by switching over Time Of Day (TOD) and Time Of Use (TOU) electric types to minimize the electric cost. The fuzzy demand and Dynamic inventory tracking with multiple plant capacity are modeled to cover the uncertain demand of customer. The constraint for minimum hour limitation of plant running per one start up event is introduced to minimize plants idle time. Furthermore; the Optimal Weight Moving Average Factor for customer demand forecasting is introduced by monthly factors to reduce forecasting error. Application is illustrated for multiple cement mill plants. The mathematical model was formulated in spreadsheet format. Then the spreadsheet-solver technique was used as a tool to solve the model. A simulation running on part of the system in a test for six months shows the optimal solution could save 60% of the actual cost.

• Management Science and Financial Engineering
• /
• v.20 no.2
• /
• pp.13-25
• /
• 2014

We investigate an optimal retirement time and consumption/investment policy of a wage earner who expects to find a better investment opportunity after retirement by being freed from other work and participating fully in the financial market. We obtain a closed form solution to the optimization problem by using a dynamic programming method under general time-separable von Neumann-Morgenstern utility. It is optimal for the wage earner to retire from work if and only if his wealth exceeds a certain critical level which is obtained from a free boundary value problem. The wage earner consumes less and takes more risk than he would without anticipation of a better investment opportunity.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.81-88
• /
• 2008

The security threat posed by worms has steadily increased in recent years. This paper discusses the application of the optimal and sub-optimal Internet worm control via Pontryagin's maximum principle. To this end, a control variable representing the optimal treatment strategy for infectious hosts is introduced into the two-factor worm model. The numerical optimal control laws are implemented by the multiple shooting method and the sub-optimal solution is computed using genetic algorithms. Simulation results demonstrate the effectiveness of the proposed optimal and sub-optimal strategies. It also provides a theoretical interpretation of the practical experience that the maximum implementation of treatment in the early stage is critically important in controlling outbreaks of Internet worms. Furthermore, our results show that the proposed sub-optimal control can lead to performance close to the optimal control, but with much simpler strategies for long periods of time in practical use.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1213-1216
• /
• 2005

In this paper, we suggested the integer linear programming (ILP) models that went through constraint scheduling to simple cycle operation during the delay time. The delayed scheduling can determine a schedule with a near-optimal number of control steps for given fixed hardware constraints. In this paper, the resource-constrained problem is addressed, for the DFG optimization for multiprocessor design problem, formulating ILP solution available to provide optimal solution. The results show that the scheduling method is able to find good quality schedules in reasonable time.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.5
• /
• pp.217-224
• /
• 2002

This paper presents an algorithm to obtain an approximate optimal solution for the service restoration and load balancing of large scale radial distribution system in a real-time operation environment. Since the problem is formulated as a combinatorial optimization problem, it is difficult to solve a large-scale combinatorial optimization problem accurately within the reasonable computation time. Therefore, in order to find an approximate optimal solution quickly, the authors proposed an algorithm which combines optimization technique called cyclic best-first search with heuristic based feeder loadings balance index for computational efficiency and robust performance. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the KEPCO's 108 bus distribution system.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.265-276
• /
• 2004

Genetic Algorithm(GA), that is shown stable performance to find an optimal solution, has been used as a method of solving large-scaled optimization problems with complex constraints in various applications. Since it takes so much time to execute a long computation process for iterative evolution and adaptation. In this paper, a hardware-based adaptive GA was proposed to reduce the serious computation time of the evolutionary process and to improve the accuracy of convergence to optimal solution. The proposed GA, based on steady-state model among continuos generation model, performs an adaptive mutation process with consideration of the evolution flow and the population diversity. The drawback of the GA, premature convergence, was solved by the proposed adaptation. The Performance improvement of convergence accuracy for some kinds of problem and condition reached to 5-100% with equivalent convergence speed to high-speed algorithm. The proposed adaptive GAP(Genetic Algorithm Processor) was implemented on FPGA device Xilinx XCV2000E of EHW board for face recognition.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.