• 대한산업공학회지
• /
• 제33권3호
• /
• pp.290-302
• /
• 2007

This paper introduces several decision-making problems that need to be solved in order to facilitate the efficient operation of container terminals. These decision-making problems include the berth planning problem, the quay crane scheduling problem, the unload/load sequencing problem, the yard allocation problem, and the short-term scheduling of transporters and yard cranes. These problems can be classified into strategic decision problems, tactical decision problems, and real time operational decision problems. This paper proposes definitions of the problems that can be used to develop mathematical models for the problems.

• 대한전기학회논문지
• /
• 제36권4호
• /
• pp.231-239
• /
• 1987

Distribution system is one of large and complicated sytem, consisted of a great number of components. Therefore efficient operation based on precise analysis and computation methods is indispensable accommodating growing loads. This paper describes an optimal operation problem to relieve overload flow in radial distribution systems by using modified block model. The problem is formulated as a network problem of synthesizing the optimal spanning tree in a graph, branch and bound method is used for the optimization. Especially modified block model proposed in this paper is validated more practical than conventional model. These methods can be applied to two types of distribution system problems such as, 1) planning problem to check the capability of relieving overload at normal rating, 2) emergency operation problem to determine switching scheme for minimizing customer loads affected by a fault. Examples of application to these problems are discussed.

• 한국항해항만학회지
• /
• 제30권6호
• /
• pp.457-464
• /
• 2006

이적작업은 적하작업과 반출작업을 신속하게 처리하기 위해 자동화 컨테이너 터미널에서 중요하게 고려하는 운영 전략들 중의 하나이다. 이는 ATC(Automated Transfer Crane)의 운반시간과 재취급 작업시간을 줄이기 위해 장치장 블록에 산적되어 있는 컨테이너들을 재배치하는 작업이다. 본 논문은 가능한 컨테이너 이동을 최소화하면서 한 수직형 블록 내에 장치된 컨테이너들의 배치 형태를 바람직한 배치 형태로 전환시키기 위한 이적계획 문제를 다룬다. 이 문제는 선후관계를 가지는 2개의 하위 문제 즉, 장치위치 할당문제와 장비 작업순서 문제로 분할된다. 장치위치 할당문제는 운반시간의 관점에서 현재 장치되어 있는 컨테이너들 중에서 어떤 컨테이너를 어느 베이에 옮길 것인가를 결정한다. 이의 결과를 가지고 장비 작업순서 문제는 장치 공간의 제약을 고려하여 ATC의 이동시간을 최소화하는 작업순서를 정한다. 본 연구에서는 정수계획법과 동적계획법을 이용하여 각 하위문제를 모형화 하였다. 제안된 모형을 이용하여 이적계획 과정을 설명하기 위한 예제를 제시하였다.

• 대한산업공학회지
• /
• 제27권3호
• /
• pp.315-327
• /
• 2001

This paper considers the problem of operation sequencing in nonlinear process planning, which is the problem of selecting and sequencing operations required to produce a part with the objective of minimizing the sum of operation processing costs and machine, setup and tool change costs. Main constraints are the precedence relations among operations. The problem can be decomposed into two subproblems: operation selection and operation sequencing. We suggest four simulated annealing algorithms, which solve the two subproblems iteratively until a good solution is obtained. Here, the operation selection problem can be solved using a shortest path algorithm. Application of the algorithms is illustrated using an example. Also, to show the performances of the suggested algorithms, computational experiments were done on randomly generated test problems and the results are reported. In particular, one of the suggested algorithms outperforms an existing simulated annealing algorithm.

• 대한산업공학회지
• /
• 제21권3호
• /
• pp.329-343
• /
• 1995

Traditionally, machining process sequence was influenced and constrained by the design information obtained from CAD data base, i.e., class of operations, geometric shape, tooling, geometric tolerance, etc. However, even though all the constraints from design information are considered, there may exist more than one way to feasibly machine parts. This research is focused on the integrated problem of operations sequencing and machine tools selection in the presence of the product mix and their production volumes. With the transitional costs among machining operations, the operation sequencing problem can be formulated as a well-known Traveling Salesman Problem (TSP). The transitional cost between two operations is expressed as the sum of total machining time of the parts on a machine for the first operation and transportation time of the parts from the first machine to a machine for the second operation. Therefore, the operation sequencing problem formulated as TSP cannot be solved without transitional costs for all operation pairs. When solved separately or serially, their mutual optima cannot be guaranteed. Machining operations sequencing and machine tool selection problems are two core problems in process planning for discretely machined parts. In this paper, the interrelated two problems are integrated and analyzed, zero-one integer programming model for the integrated problem is formulated, and the solution methods are developed using a Tabu Search technique.

• 대한전기학회논문지
• /
• 제38권8호
• /
• pp.585-592
• /
• 1989

This paper presents an efficient algorithm for the reactive planning of transmission network under normal operating conditions. The optimal operation of a power system is a prerequisite to obtain the optimal investment planning. The operation problem is decomposed into a P-optimization module and a Q-optimization module, but both modules use the same objective function of generation cost. In the investment problem, a new variable decomposition technique is adopted which can operate the operation and the investment variables. The optimization problem is solved by using the gradient projection method (GPM).

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• pp.102-105
• /
• 1993

The objective of this study is to solve the operation scheduling problem of plural battery energy storage systems (BESS), and to find useful intonation from its result. Unlike conventional energy storage system, BESS has on hardware characteristics such as high efficiency, fast-acting response and operational loss. Considering rate constraints of thermal unit power as well as hardware characteristics of BESS, the operation scheduling has an intricated problem. In order to solve this optimization problem, we use successive approximations dynamic programming. In two types of operation, the proposed algorithm is applied to test system. one is daily optimal operation, the other weekly optimal operation.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제11권4호
• /
• pp.247-263
• /
• 2007

Problem solving takes place not only in mathematics classes but also in real-world. For this reason, a problem and the structure of problem solving, and the enhancing of success in problem solving is a subject which has been studied by any educators. In this direction, the aim of this study is that the strategy used by students in Turkey when solving oral problems and their achievements of choosing operations when solving oral problems has been researched. In the research, the students have been asked three types of questions made up groups of 5. In the first category, S-problems (standard problems not requiring to determine any strategy but can be easily solved with only the applications of arithmetical operations), in the second category, AS-SA problems (problems that can be solved with the key word of additive operation despite to its being a subtractive operation, and containing the key word of subtractive operation despite to its being an additive operation), and in the third category P-problems (problematic problem) take place. It is seen that students did not have so much difficulty in S-problems, mistakes were made in determining operations for problem solving because of memorizing certain essential concepts, and the succession rate of students is very low in P-problems. The reasons of these mistakes as a summary are given below: $\cdot$ Because of memorizing some certain key concepts about operations mistakes have been done in choosing operations. $\cdot$ Not giving place to problems which has no solution and with incomplete information in mathematics. $\cdot$ Thinking of students that every problem has a solution since they don't encounter every type of problems in mathematics classes and course books.

• 산업경영시스템학회지
• /
• 제34권4호
• /
• pp.152-161
• /
• 2011

The operation of vending machine system presents a decision-making problem which consists of determining the product allocation to vending-machine storage compartments, replenishment intervals of vending machines, and vehicle routes, all of which have critical effects on system profit. Especially, it becomes more difficult to determine the operation variables optimally when demand for a product that is out-of-stock spills over to another product or is lost. In this paper, we propose a heuristic for solving the operation problem of the vending machine system and evaluate it by comparing with Yang's algorithm on various test problems with respect to system profit via a computer simulation. The results of computational experiments show a substantial profit increase of the proposed heuristic over Yang's algorithm. Sensitivity analysis indicates that some input variables impact the profit increase significantly.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.143-156
• /
• 2005

Facility location planning (FLP) problem is the strategic level planning in supply chain. The FLP is significantly affected by the operation time of each facility. In most of the FLP researches, operation time of facility has been treated as a fixed value. However, the operation time is not a static factor in real situations and the fixed operation time may lead unrealistic FLP. In this paper, a mixed integer programming (MIP) model is proposed for solving the 3-stage FLP problem and operation times are adjusted by the results from the simulation model and an iterative approach combining the analytic model and simulation model is proposed to obtain more realistic operation plans for FLP problems.