• 경영과학
• /
• 제8권1호
• /
• pp.91-108
• /
• 1991

This paper presents an efficient optimization algorithm for the crude oil tanker scheduling problem. The algorithm consists of two stages. In stage one, all the potentially optimal schedules (called 'candidate schedules') are generated from feasible schedules for each ship. In the second stage, a multiple ship scheduling problem is formulated as 0-1 integer programming problem considering only the those candidate schedules. The efficiency of the suggested algorithm was improved by exploiting the special structure of the formulation. The algorithm was illustrated by a numerical example and tested on practical ship scheduling problems.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.893-896
• /
• 1998

A new evolutionary programming technique using multiple subpopulations with completely differnt evolution mechanisms is propsed to solve the optimization problems. Three subpopulations, each has different evolution charcteristics and uses different EP algorithms such as SAEP, AEP and FEP, are cooperating with synergy effect in which it increases the possibility to quickly find the global optimum of continuous optimization problems. Subpopulations evolve in differnt manner and the interaction among these leads to global minimum quickly.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.724-727
• /
• 1999

The previous LQ-servo PI design methods have some serious design problems happened from the frequency matching of the maximum and minimum singular values of loop transfer function at both low and high frequency regions on the Bode plot. To solve these problems, this paper proposes a new design technique based on the inverse-optimal control and convex optimization.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.367-376
• /
• 2007

In this paper we consider the global convergence of a new super memory gradient method for unconstrained optimization problems. New trust region radius is proposed to make the new method converge stably and averagely, and it will be suitable to solve large scale minimization problems. Some global convergence results are obtained under some mild conditions. Numerical results show that this new method is effective and stable in practical computation.

• 대한안전경영과학회지
• /
• 제10권1호
• /
• pp.155-166
• /
• 2008

During last two decades the transportation system has developed into very intelligent system with GIS, GPS and ITS. The practical transportation management system provides real time response module to manage the customer's order. We have surveyed research papers on the real time vehicle routing problem in last two decades to figure out the dynamic vehicle routing problem. The papers are classified by basic routing algorithms and by managing the dynamic events which are the order management, the routing re-optimization, the routing post-optimization and the waiting strategy.

• 대한수학회논문집
• /
• 제16권4호
• /
• pp.667-677
• /
• 2001

We consider a nonsmooth multiobjective opimization problem(PE) involving locally Lipschitz functions and define gen-eralized invexity for locally Lipschitz functions. Using Fritz John type optimality conditions, we establish Fritz John type sufficient optimality theorems for (PE) under generalized invexity.

• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.802-807
• /
• 2005

For linear projects, it has long been known that resource utilization is important in improving work efficiency. However, most existing scheduling techniques cannot satisfy the need for solving such issues. This paper presents an optimization model for solving linear scheduling problems involving resource assignment tasks. The proposed model adopts constraint programming (CP) as the searching algorithm for model formulation, and the proposed model is designed to optimize project total cost. Additionally, the concept of outsourcing resources is introduced here to improve project performance.

• 한국시뮬레이션학회논문지
• /
• 제3권2호
• /
• pp.57-67
• /
• 1994

For many practical and industrial optimization problems where some or all of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computer simulation is one of the most effective means of studying such complex systems. In this paper, with discussion of simulation optimization techniques, a case study in machining process for application of simulation optimization is presented. Most of optimization techniques can be classified as single-or multiple-response techniques. The optimization of single-response category, these strategies are gradient based search methods, stochastic approximate method, response surface method, and heuristic search methods. In the multiple-response category, there are basically five distinct strategies for treating the responses and finding the optimum solution. These strategies are graphical method, direct search method, constrained optimization, unconstrained optimization, and goal programming methods. The choice of the procedure to employ in simulation optimization depends on the analyst and the problem to be solved.

• Management Science and Financial Engineering
• /
• 제13권1호
• /
• pp.1-24
• /
• 2007

I propose new combined randomized methods for global optimization problems. These methods are based on the Nested Partitions(NP) method, a useful method for simulation optimization which guarantees global optimal solution but has several shortcomings. To overcome these shortcomings I hired various statistical selection methods and combined with NP method. I first explain the NP method and statistical selection method. And after that I present a detail description of proposed new combined methods and show the results of an application. As well as, I show how these combined methods can be considered in case of computing budget limit problem.

• 대한기계학회논문집A
• /
• 제38권4호
• /
• pp.363-370
• /
• 2014

본 연구에서는 NURBS(Non-Uniform Rational B-spline)를 이용한 형상최적화 방법을 제안한다. 대부분 NURBS 기반 형상 최적화 방법은 NURBS의 제어점 위치 좌표 값만을 설계변수로 택하고 있다. 이러한 경우, 형상최적화 과정에서 종종 제어점들이 서로 가까워져 메쉬 품질을 악화시키고 수렴이 되지 않는 등의 문제를 야기시킨다. 본 연구에서는 형상최적화에서 NURBS 제어점의 좌표뿐 아니라 가중치를 추가적으로 설계 변수로 고려하여 세밀한 형상 변화를 가능하게 하고, 제어점 위치 좌표 최적화 과정과 제어점 가중치 최적화 과정을 분리하여 단계적으로 효율적인 형상 최적화를 수행하였다. 제안한 형상최적화 방법을 예제에 적용하여 제안된 방법의 효율성을 검증하였다.