• 정보처리학회논문지B
• /
• 제9B권3호
• /
• pp.277-286
• /
• 2002

양자역학 섭동이론과 유전자프로그래밍(GP) 기법을 접목시킴으로써 실세계(Real-world)에서 발생하는 카오스 시계열에 대하여 수학모델을 구축, 예측하기 위한 새로운 알고리즘을 개발하였다. 시계열 분석과 양자역학 파동방정식의 해를 구하는 섭동이론과의 절차적 유사성을 논하고, 이것을 GP로 구현하는 전형적 접근방안을 제시한다. 함수집합(Function Set)으로서 직교함수(Orthogonal Functions)를 이용하고 병렬 집단을 사용하는 GP를 이용하여 원 시계열에 대한 초기 수학모델을 구하고, 원 시계열 데이터로부터 모델의 평가값을 뺀 나머지로 구성되는 잔여 시계열에 대하여 다시 GP를 적용하는 과정을 일정한 종료조건이 충족될 때가지 반복함으로써 실세계 카오스 시계열에 대한 정확성 높은 수학모델을 구축하는데 성공하였다. 타 방법론과의 비교와 향후 해결과제에 대하여도 소개한다.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.137-137
• /
• 1991

This paper compares and evaluates the performances of the two types of mathematical programming models for solving the machine-part cell formation problem in group technology manufacturing : indirect formulation relying on surrogate measure such as similarity coefficient and direct formulation seeking to minimize the number of exceptional elements. New indirect formulation, called the generalized p-median model. is proposed. Unlike existing p-median formulations, proposed formulation includes the classical cell formation problem in which only one process plan exsits for each part as a special case. The proposed new formulation can also deal with the cell formation problem in which alternative process plans exist for a part. The indirect formulation is compared with a new direct formulation which needs much fewer extra variables and constraints than existing direct formulations. Some significant findings from comparative experiment are discussed.

• 경영과학
• /
• 제16권2호
• /
• pp.137-147
• /
• 1999

This paper compares and evaluates the performances of the two types of mathematical programming models for solving the machine-part cell formation problem in group technology manufacturing : indirect formulation relying on surrogate measure such as similarity coefficient and direct formulation seeking to minimize the number of exceptional elements. New indirect formulation, called the generalized {{{{ { p}_{ } }}-median model. is proposed. Unlike existing {{{{ { p}_{ } }}-median formulations, proposed formulation includes the classical cell formation problem in which only one process plan exsits for each part as a special case. The proposed new formulation can also deal with the cell formation problem in which alternative process plans exist for a part. The indirect formulation is compared with a new direct formulation which needs much fewer extra variables and constraints than existing direct formulations. Some significant findings from comparative experiment are discussed.

• 경영과학
• /
• 제21권2호
• /
• pp.1-14
• /
• 2004

This paper presents a review on the operations research modeis for environmental management including water, land, and air poliution in the environmental chain and including waste treatment, reverse logistics, and product recovery in the supply chain for last 30 years. The integrated and globalized environmental issues have given OR professionals a lot of natural opportunities for an effective environmental management with mathematical programming and computer simulation tool.

• 한국산업정보학회논문지
• /
• 제27권6호
• /
• pp.105-114
• /
• 2022

본 연구에서는 조수조건이 고려된 벌크항만의 하역 최적화를 위한 정수계획모형을 제안한다. 특히, 본 연구에서는 실제 벌크항만의 운영 환경과 조건들을 반영하여 체선료(Demurrage Cost)와 조출료(Dispatch Money)를 모두 고려한 하역비용 최소화를 목적함수로 설정하고, 벌크항만의 서비스 수준을 결정하는 최소재고 제약조건 또한 고려한다. 일반적으로 비선형 함수 형태로 표현되는 체선료 계산식을 선형화(Linearize)하여 스케줄 해상도를 향상하고, 조수조건을 고려한 선석할당 문제의 경우 전통 자원할당 모형에서 필수적인 Big-M 제약식이 대체 가능함을 확인한다. 실험결과를 통해 기존 모형 대비 계산복잡도와 전역최적성이 크게 향상 가능함을 검증한다.

• 한국항만학회지
• /
• 제10권2호
• /
• pp.7-15
• /
• 1996

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. A berth can be assigned to incoming vessels and operated in tow different ways: as a common user berth, as a preference berth. A common user berth is a berth that any ship calling at a port may be permitted to use according to her time of arrival and to priorities as determined by the port authority. In this paper, we concerned with various types of mathematical programming models for a berth assignment problem to achive an efficient berth operation. In this paper, we focus on a reasonable berth assignment programming in a public container terminal in consideration of trade-off between server and user. We propose a branch and bound algorithm & heuristic algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) with which the trade-off between servers and users can be considered. The berth assignment problem is formulated by min-max and 0-1 integer programming and developed heuristic algorithm to solve the problem more easily instead of branch and bound method. Finally, we gave the numerrical solutions of the illustrative examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.484-487
• /
• 1997

In this paper a simulation program for the powertrain control of a gasoline engine with automatic transmission is presented, The object-oriented programming approach has been pursued, and MATLAB/ SIMULINK was adopted for its environment. The purpose of the paper is to demonstrate the programmability of a control system in the object-oriented fashion so that the transferability of the objects is guaranteed. The program developed in the paper was applied to a gasoline engine and the mathematical models used in the paper were just adopted from the literature. It is shown that the simulation results and real experimental results coincide well. Therefore, it is expected that the program or objects made in the paper are useful for the automotive engineers when they design a new engine/transmission system or modify a part of existing system.

• 제어로봇시스템학회논문지
• /
• 제4권5호
• /
• pp.680-688
• /
• 1998

A modular programming approach for simulation/control of turbocharged diesel engines is investigated. The MATLAB/SIMULINK, which provides easy construction of various control modules and handy retrieval of objects, is adopted as a programming environment. The mathematical models for diesel engines are utilized from the literature. The object-oriented modules, which represent mechanical parts or theoretical algorithms for engines, are easily transferable to other application programs in the same environment. The simulation model is applied to a 4 strokes diesel engine. Details of the block diagrams of example modules are demonstrated. Finally, a PI controller and a sliding mode controller are applied to the simulator constructed for a typical turbocharged diesel engine.

• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.93-100
• /
• 2009

This paper addresses the facility layout problem in multi-bay environments, where the bays are connected at one or both ends by an inter-bay material handling system. In most previous studies, the main concern is to allocate facilities or departments to the bays whose widths are fixed. In this research, we suggest the efficient models that provide the optimal layout solution under flexible bay width environments. We also suggest a mathematical model that provides the optimal solution using two-way facility allocation approach instead of one-way allocation technique. This paper also shows the approach of TABU search to the assignment and layout design of the departments. The results generated from TABU search are compared to the result from the mathematical model. Models are developed using mixed integer programming for various test problems and solved by CPLEX.

• Industrial Engineering and Management Systems
• /
• 제12권1호
• /
• pp.36-40
• /
• 2013

The paper discusses the problem of how to allocate the fund to a large number of individuals in a higher school so as to bring a higher utility return based on the theory of uncertain set. Suppose that experts can assign each invested individual a corresponding nondecreasing membership function on a close interval I according to its actual level and developmental foreground. The membership degree at the fund $x{\in}I$ is called utility degree from fund x, and product (minimum) of utility degrees of distributed funds for all invested individuals is called united utility degree from the fund. Based on the above concepts, we present an uncertain optimization model, called Maximal United Utility Degree (or Maximal Membership Degree) model for fund distribution. Furthermore, we use nondecreasing polygonal functions defined on close intervals to structure a mathematical maximal united utility degree model. Finally, we design a genetic algorithm to solve these models.