• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.19-27
• /
• 2009

This paper addresses the berth allocation problem in naval ports. Navy vessels need various services such as emergency repair, missile loading, oil supply and many others while commercial vessels only unload and load container at the port. Furthermore, naval vessels have to shift frequently due to a limited capacity of the port. The objective of this paper is to minimize the total number of nesting vessels at the naval port. In other word, the objective is to maximize the total number of naval battleships engaging in the sea. A mixed integer programming(MIP) model is developed and experiments are conducted with ILOG CPLEX 11.0. We compare the computational results of the MIP model to the current scheduling approach by the ROK Navy. The results showed that MIP model performed well by minimizing the number of nesting vessels. and avoiding unnecessary shifts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.422-434
• /
• 2002

We propose 3-layered hierarchical fiber-optic backbone transmission network composed of B-DCS, Backbone ring, Edge ring for efficient transmission of high capacity traffic and consider design method to ensure network survivability of each layer at affordable cost. Mathematical ring-construction cost minimization using MIP(Mixed Integer Programming) models results in NP-complete problem. So, it is hard to solve it within reasonable computing time. on a large-scale network. Therefore we develop heuristic algorithms solving WSCAP(Working and Spared Channel Assignment Problem) for B-DCS, MRLB(Multi-Ring Load Balancing) problem for Backbone ring, and ORLB(Overlayed Ring Load Balancing) problem for Edge ring and show their usefulness through case study.

• Journal of Korea Water Resources Association
• /
• v.36 no.4
• /
• pp.547-559
• /
• 2003

In this study, a mathematical model is developed for sewer rehabilitation planning by considering cost and inflow/infiltration. A sewer rehabilitation planning model is required to decide the economic life of the sewer by considering trade-off between cost and inflow/infiltration. And it is required to find the optimal rehabilitation timing, according to the cost effectiveness of each sewer rehabilitation within the budget. To solve the problem, we formulated a multiple objective mixed integer programming(MOMIP) model based on network flow optimization. The network is composed of state nodes and arcs. The state nodes represent the remaining life and the arcs represent the change of the state. The model considers multiple objectives which are cost minimization and minimization of inflow/infiltration. Using the multiple objective optimization, the trade-off between the cost and inflow/infiltration is presented to the planner so that a proper sewer rehabilitation plan can be selected.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.1044-1051
• /
• 2002

This paper proposes a two-phase mathematical programming approach by considering classification gap to solve the proposed credit scoring problem so as to complement any theoretical shortcomings. Specifically, by using the linear programming (LP) approach, phase 1 is to make the associated decisions such as issuing grant of credit or denial of credit to applicants. or to seek any additional information before making the final decision. Phase 2 is to find a cut-off value, which minimizes any misclassification penalty (cost) to be incurred due to granting credit to 'bad' loan applicant or denying credit to 'good' loan applicant by using the mixed-integer programming (MIP) approach. This approach is expected to and appropriate classification scores and a cut-off value with respect to deviation and misclassification cost, respectively. Statistical discriminant analysis methods have been commonly considered to deal with classification problems for credit scoring. In recent years, much theoretical research has focused on the application of mathematical programming techniques to the discriminant problems. It has been reported that mathematical programming techniques could outperform statistical discriminant techniques in some applications, while mathematical programming techniques may suffer from some theoretical shortcomings. The performance of the proposed two-phase approach is evaluated in this paper with line data and loan applicants data, by comparing with three other approaches including Fisher's linear discriminant function, logistic regression and some other existing mathematical programming approaches, which are considered as the performance benchmarks. The evaluation results show that the proposed two-phase mathematical programming approach outperforms the aforementioned statistical approaches. In some cases, two-phase mathematical programming approach marginally outperforms both the statistical approaches and the other existing mathematical programming approaches.

• Journal of Korean Society for Quality Management
• /
• v.36 no.2
• /
• pp.28-35
• /
• 2008

This study deals with an Excel-based scheduling system for a small and medium sized manufacturing factory without sufficient capability for managing full-scale information systems. The factory has the bottleneck with identical machines and unique batching characteristics. The scheduling problem is formulated as a variation of the parallel-machine scheduling system. It can be solved by a two-phase method: the first phase with an ant colony optimization (ACO) heuristic for order grouping and the second phase with a mixed integer programming (MIP) algorithm for scheduling groups on machines.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.350-353
• /
• 2003

Navy surface vessels require pier services such as emergency repair, oil supply, fm loading/unloading, crane, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. The study suggests Mixed Integer Programing (MIP) model for bath allocation problem, considering precedence relationships among services. For a effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 3.1 and ILOG Cplex 7.0. The results of the model show reduction of berth shifts and increasement of service benefits. And thus, it would be a possibility of contribution in the improvement of fleet readiness.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.29-39
• /
• 2009

In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.

• IE interfaces
• /
• v.22 no.3
• /
• pp.263-277
• /
• 2009

This research deals with a task assignment problem to worker group which consists of one master and one assistant. Each task must be assigned to only one worker group and it is possible to make a pair of each master and each assistant to organize a worker group. A worker group may have more than one task assigned to it, but the workloads of each worker group must be balanced within the allowable range. This problem can be formulated mathematically using the Mixed Integer Programming(MIP), where the objective function is to minimize the total assignment cost. A two phase heuristic algorithm is suggested in order to find approximate solutions. The first phase is to obtain an initial solution, where the initial assignment is performed to follow the workload adjustment. In the second phase, the solution is improved through the repeated process of the exchange and the assignment adjustment. Numerical experiments have been performed to evaluate the performance of the heuristic algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.137-158
• /
• 1992

We study the Multiple Product Single Facility Stockout Avoidance Problem (SAP). That is the problem of determining, given initial inventories, whether there is a multiple product single facility production schedule that avoids stockouts over a given time horizon. The optimization version of the SAP where stockouts are pnelized linearly is also studied. We call this problem the Weighted Stockout Problem (WSP). Both problems are NP-hard in the strong sense. We develop Mixed Integer Linear Programming (MIP) formulations for both the SAP and the WSP. In addition, several heuristic algorithms are presented and performances are tested using computational experiments. We show that there exist polynomial algorithms for some special cases of the SAP and the WSP. We also present a method to phase into a target cyclic schedule for infinite horizon problems. These can be used as a practical scheduling tool for temporarily overloaded facilities or to reschedule production after a disruption.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.426-433
• /
• 2002

This paper deals with an offline routing problem, which can be used as an explicit routing procedure in MPLS(Multiprotocol Label Switching) network, for traffic engineering. This problem is formulated as an MIP(Mixed Integer Programming) with the objective function which is to minimize the sum of the maximum link utilization for load balancing (link utilization) and the routing cost. Constraints arc composed of link capacity restriction and demand requirement that has origin-destination pair, bandwidth requirement and hop restriction. The problem is proved to be NP-hard so that the Lagrangean relaxation method is applied to propose a Lagrangean heuristic. To test the effectiveness & efficiency of the proposed algorithm, computational experiments are performed with numerical instances. The experiment results show that the proposed algorithm solves the problem within a reasonable time.