• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.72-75
• /
• 2001

This paper presents a sophisticated mixed-integer linear programming model that may help regional decision-maker to develop long term plan of solid waste management The model revises Ni-Bin Chang(1996)'s integrated waste management models to fit Korean solid waste management system We apply this model to evaluate impact of facility sharing and coordinated operation among three self-governing districts in Seoul city Our study results indicate that facility sharing and coordinated operation among districts eliminate unnecessary landfilling and facility expansion.

• Korean Management Science Review
• /
• v.23 no.2
• /
• pp.161-174
• /
• 2006

In this paper, we consider a network optimization problem arising from the deployment of BcN access network. BcN convergence services requires that access networks satisfy QoS meausres. BcN services have two types of traffics : stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer Programming model. The Proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose two local search heuristic algorithms for solving the problem, and develop a network design system that implements the developed heuristic algorithms. We demonstrate the computational efficacy of the proposed algorithm by solving a realistic network design problem.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.7
• /
• pp.1125-1129
• /
• 2015

Increasing peak load is one of the major concerns about operation of urban railroad systems. Since ESSs (Energy Storage Systems) have a great potential for shaving the peak load, there has been a growing interest in the use of ESS for peak load reduction. Also, ESS can be optimally scheduled to minimize the electricity purchasing cost under a given ToU (Time-of-Use) tariff by taking advantage of electricity price difference between peak and off-peak time. This paper presents a Mixed Integer Programming (MIP)-based ESS scheduling method to minimize the electricity purchasing cost under a ToU tariff for an urban railroad system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.2
• /
• pp.74-81
• /
• 2006

In this paper, we deal with the separation of data by concurrently determined, piecewise nonlinear discriminant functions. Toward the end, we develop a new $l_1$-distance norm error metric and cast the problem as a mixed 0-1 integer and linear programming (MILP) model. Given a finite number of discriminant functions as an input, the proposed model considers the synergy as well as the individual role of the functions involved and implements a simplest nonlinear decision surface that best separates the data on hand. Hence, exploiting powerful MILP solvers, the model efficiently analyzes any given data set for its piecewise nonlinear separability. The classification of four sets of artificial data demonstrates the aforementioned strength of the proposed model. Classification results on five machine learning benchmark databases prove that the data separation via the proposed MILP model is an effective supervised learning methodology that compares quite favorably to well-established learning methodologies.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.473-481
• /
• 2015

In this study, we propose a clustering algorithm to enhance the performance of wireless sensor and actuator networks (WSANs). In each cluster, a multi-level hierarchical structure can be applied to reduce energy consumption. In addition to the cluster head, some nodes can be selected as intermediate nodes (INs). Each IN manages a subcluster that includes its neighbors. INs aggregate data from members in its subcluster, then send them to the cluster head. The selection of intermediate nodes aiming to optimize energy consumption can be considered high computational complexity mixed-integer linear programming. Therefore, a heuristic lowest energy path searching algorithm is proposed to reduce computational time. Moreover, a channel assignment scheme for subclusters is proposed to minimize interference between neighboring subclusters, thereby increasing aggregated throughput. Simulation results confirm that the proposed scheme can prolong network lifetime in WSANs.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.612-620
• /
• 2011

Recently, one of the problems with the Internet is the issue of scalability. To this end, locator/identifier separation protocol (LISP), which separates end-system identifiers and routing locators, has been proposed as a solution. In the LISP deployed network, the ingress and egress nodes of inter-AS traffic is determined by edge router selection (ERS) and endpoint identifier-routing locator mapping assignment (ERMA). In this paper, joint optimizations of ERS and ERMA for stub networks with and without predetermined link weights are studied and the mixed integer linear programming (MILP) formulations for the problems are given. To make the problem with optimizable link weights tractable, a revised local search algorithm is also proposed. Simulation results show that joint optimization of ERS and ERMA enables better network performance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.50
• /
• pp.45-54
• /
• 1999

Cellular manufacturing(CM) is a manufacturing philosophy and strategy for improving both productivity and flexibility. Cell formation(CF), the first and key problem faced in designing an effective CM system, is a process whereby parts with similar design features or processing requirements are grouped into part families, and the corresponding machines into machine cells. In this paper, a sophisticated fuzzy mixed-integer programming model is proposed to simultaneously form manufacturing cells and minimize the total costs of dealing with exceptional elements. Also, we will proposed a new method to solve the cell formation problem in the fuzzy environment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.65-75
• /
• 2000

Cellular manufacturing(CM) is a philosophy and innovation to improve manufacturing productivity and flexibility. Cell formation(CF), the first and key problem faced in designing an effective CM system, is a process whereby parts with similar design features or Processing requirements are grouped into part families, and the corresponding machines into machine cells. Cell formation solutions often contain exceptional elements(EEs). EE create interactions between two manufacturing cells. A policy dealing with EEs considers minimizing the total costs of three important costs; (1)intercellular transfer (2)machine duplication and (3)subcontracting. This paper presents an effective cell formation method with fuzzy nonlinear mixed-integer programming simultaneously to form manufacturing cells and to minimize the total costs of eliminating exceptional elements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.2
• /
• pp.478-493
• /
• 2024

In this paper, the Mixed Integer Linear Programming (MILP) model is improved for searching differential characteristics of block cipher Midori-64, and 4 search strategies of differential path are given. By using strategy IV, set 1 S-box on the top of the distinguisher to be active, and set 3 S-boxes at the bottom to be active and the difference to be the same, then we obtain a 5-round differential characteristics. Based on the distinguisher, we attack 12-round Midori-64 with data and time complexities of 2⁶³ and 2^103.83, respectively. To our best knowledge, these results are superior to current ones.