• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2023.05a
• /
• pp.223-224
• /
• 2023

Optimal fleet management in the planning stage is one of the most critical activities that guarantee successful construction projects. In South Korea, the construction standard production rate database (CSPRD) is normally employed. However, when it comes to a trade-off problem that involves decision-making on optimal sets of equipment to perform a certain task, the method will require the planners' in-depth knowledge and experience regarding the target process and a time consuming estimation of the performance of every possible scenario must be conducted for the deduction of the optimal fleet management. On this account, this research paper proposes a lightweight method of using mixed integer nonlinear programming (MINLP) in multi-objective problems based on CSPRD-based mathematical equations to assist planners in the preplanning stage of choosing the optimal sets of types and size machinery to efficiently arrange the construction scheduling and budgeting.

• Journal of Navigation and Port Research
• /
• v.41 no.3
• /
• pp.149-154
• /
• 2017

Recently, container terminal operators have made efforts to develop an efficient remarshalling plan in response to the increase in automation of equipment handling and transport of containers in the terminals. Usually, containers are handled by multiple AYCs(automated yard cranes) in-yard in an automated container terminal, and terminal operators establish a remarshalling plan using slack time to increase the efficiency of ship operation. This study develops the optimal mathematical model through mixed integer programming as a solution to the problem of dispatching multiple AYCs. Considering the difficulty of direct application to the field due to computation time, we analyze the five prototypical dispatching rules for real world adaptation. A numerical experiment found that the maximum weight ratio (MR) rule and the maximum weight (MW) rule are the ideal dispatching solutions to the multiple AYCs dispatching problem.

• Journal of Intelligence and Information Systems
• /
• v.9 no.1
• /
• pp.71-89
• /
• 2003

Although many studies demonstrate that one technique outperforms the others for a given data set, there is often no way to tell a priori which of these techniques will be most effective in the classification problems. Alternatively, it has been suggested that a better approach to classification problem might be to integrate several different forecasting techniques. This study proposes the linearly combining methodology of different classification techniques. The methodology is developed to find the optimal combining weight and compute the weighted-average of different techniques' outputs. The proposed methodology is represented as the form of mixed integer programming. The objective function of proposed combining methodology is to minimize total misclassification cost which is the weighted-sum of two types of misclassification. To simplify the problem solving process, cutoff value is fixed and threshold function is removed. The form of mixed integer programming is solved with the branch and bound methods. The result showed that proposed methodology classified more accurately than any of techniques individually did. It is confirmed that Proposed methodology Predicts significantly better than individual techniques and the other combining methods.

• Proceedings of the KIEE Conference
• /
• 2008.11a
• /
• pp.432-434
• /
• 2008

전력거래소에서는 수요관리에 대한 지원금을 수요측의 입찰제도를 통하여 결정하는 시범사업을 실시하고 있다. 본 논문은 수요입찰에 의한 지원금의 결정에 관여하는 급전계획 프로그램에 대한 내용을 기술하고 있다. Scheduling 프로그램은 수요의 비선형 특성을 고려하기 위하여 혼합정수계획법(MIP)을 이용하여 작성하였으며 효용성을 입증하기 위한 사례검토를 수행하였다.

• Journal of Korea Water Resources Association
• /
• v.35 no.1
• /
• pp.51-64
• /
• 2002

In this study, the formulation of the developed mixed-integer programming model for a multi-reservoir system including hydro-electric power generation (park et al., 2001) has been improved for multiple reservoir system operation using risk evaluation criteria. Sequential linear programming(SLP) was applied for the linearization of the hydro-electric energy term in the model. In order to allocate monthly reservoir release reasonably the value of weight for hydro-electric energy was assigned by level of power generation hour. The improved model was applied to the five reservoirs system in the Han river. And could be confirmed the availibility of new formulation appling risk evaluation criteria.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.10a
• /
• pp.177-178
• /
• 2009

본 연구는 반입 작업에서 수출 컨테이너의 작업순서 및 장치위치를 결정하는 문제를 다루었다. 수직 배치형 컨테이너 터미널에서 적하작업시간의 단축을 위해서는 가능한 해측에 컨테이너를 장치하는 것이 유리하지만 반입 외부 트럭의 빠른 회전시간의 측면에서는 육측이 선호된다. 이때 수출 컨테이너의 장치위치는 본선작업 우선순위에 따라 가중치가 다르고 이에 소요되는 장치소요시간에 따라 외부트럭들의 대기시간도 달라진다. 따라서 본 연구는 외부 트럭들의 예정 도착시간과 최대대기시간 그리고 적하작업의 선호 장치위치를 동시에 고려한 혼합정수모델을 개발하고 이를 활용한 적용 예를 제시하였다.

• Proceedings of the KIEE Conference
• /
• 2008.11a
• /
• pp.214-216
• /
• 2008

현재 전력수급기본계획은 전국을 한일권으로 하여 발전계획을 수립하고 송변전설비계획을 수립하고 있다. 그러나 발전설비와 송변전설비는 하나의 망으로 연결되어 상호 보완적 영향을 주기 때문에 수급계획시 두 설비를 동시에 평가하는 것이 무엇보다 중요하다. 본 논문에서는 혼합정수형 선형계획법(MIP)을 이용하여 발송전 전력설비를 통합적으로 최적 구성할 수 있는 방안에 대하여 분석하였다. 전력수급기본계획 수립시 제출된 건설의향설비에 대해 송변전설비와 통합하여 적정 예비율을 갖는 최적설비 구성방안을 수립하고, 이때의 설비투자비와 운전비를 분석하였다.

• Journal of Navigation and Port Research
• /
• v.30 no.6 s.112
• /
• pp.457-464
• /
• 2006

Remarshalling operation is one of the operations considered important in an automated container terminal to perform quickly loading operations and delivery operations. It arranges the containers scattered at a verticla yard block in order to reduce the transfer time and the rehandling time of ATC(Automated Transfer Crane)s. This paper deals with the remarshalling planning problem minimizing the weighted operation time. This problem can be decomposed into 2 subproblems, storage space assignment problem and operation sequencing problem Storage space assignment problem decides to where containers are transported in terms of transportation time cost.. With results of a previous subproblem, operation sequence problem determines the ATC operation sequence, which minimizes the dead-heading of ATC This study formulates each subproblem with mixed integer program and dynamic program. To illustrate the proposed model, we propose an instance to explain the process of remarshalling planning.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.179-184
• /
• 2007

The problem of selecting base station location in the design of mobile communication system has been basically regarded as a problem of assigning maximum users in the cell to the minimum base stations while maintaining minimum SIR. and it is NP hard. The objective function of warehouse location problem, which has been used by many researchers, is not proper function in the base station location problem in CDMA mobile communication, The optimal and approximate solutions have been presented by using proposed object function and algorithms of exact solution, and the simulation results have been assessed and analyzed. The optimal and approximate solutions are found by using mixed integer programming instead of meta-heuristic search methods.

• Information Systems Review
• /
• v.5 no.2
• /
• pp.203-217
• /
• 2003

Constraint Programming and Optimization have developed in different fields to solve common problems in real world. In particular, constraint propagation and linear Programming are their own fundamental and complementary techniques with the potential for integration to benefit each other. This intersection has evoked the efforts to combine both for a solution method to combinatorial optimization problems. Attempts to combine them have mainly focused on incorporating either technique into the framework of the other with traditional models left intact. This paper argues that integrating both techniques into an old modeling fame loses advantages from another and the integration should be molded in a new framework to be able to exploit advantages from both. The paper propose a declarative modeling framework in which the structure of the constraints indicates how constraint programming and optimization solvers can interact to solve problems.