• Proceedings of the Safety Management and Science Conference
• /
• 2010.11a
• /
• pp.245-256
• /
• 2010

최근 들어 안전관리의 패러다임은 사후분석에서 사전예방으로 바뀌고 있다. 이러한 추세에 맞추어 본질적인 안전관리에 대한 관심이 늘어나고 있다. 공정에 본질적인 안전을 추구하는 방법은 크게 5가지로 나누어 질 수 있으며, 공정의 배치를 통해서 사고를 영향을 최소화하는 방법은 공정의 설계단계에서 적용할 수 있는 좋은 방법이다. 본 연구에서는 공정의 설비가 가지는 위험성을 기반으로 안전거리에 대한 지침을 제시하고 있다. 사고결과와 사고발생빈도를 기반으로 개인적 위험성(Individual Risk: IR)을 계산하였으며, 계산된 값을 기반으로 최적의 안전거리 계산을 수행할 수 있었다. 계산된 IR과 문헌에서 제시된 안전거리를 바탕으로 작업자가 거주하는 건물과 공정경계 까지의 적절한 거리와 설비간의 최적의 거리를 계산하게 된다. Mixed Integer Linear Programming(MILP)를 이용하여 각각설비의 안전거리가 확보된 시설물 배치와 최소 부지 면적 등을 알 수가 있다. 이 연구를 통해 최적화된 부지면적과 파이프라인의 시설물 배치는 물론 공정건설이나 초기 디자인 단계 및 안전성확보측면에서 본질적인 안전을 구현하는데 유용하게 적용될 수 있다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.11
• /
• pp.1610-1616
• /
• 2013

Recently, district heating and cooling (DHC) systems based on combined cycle generation (CCG) providers are increasing in Korea. Since characteristics of combined heat and power (CHP) generators and heat demands of providers, heat trading between DHC providers based on the economic viewpoint is required; the heat trading has been doing. In this paper, a mathematical model for optimal operation based on heat trading between DHC providers is proposed. Especially, start-up characteristic of CCG is included. The operation model is established by mixed integer linear programming (MILP).

• ETRI Journal
• /
• v.35 no.1
• /
• pp.142-145
• /
• 2013

Network virtualization opens the door to novel infrastructure services offering connectivity and node manageability. In this letter, we focus on the cost-efficient embedding of on-demand virtual optical network requests for interconnecting geographically distributed data centers. We present a mixed integer linear programming formulation that introduces flexibility in the virtual-physical node mapping to optimize the usage of the underlying physical resources. Illustrative results show that flexibility in the node mapping can reduce the number of add-drop ports required to serve the offered demands by 40%.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.26 no.2
• /
• pp.54-60
• /
• 2018

This paper contains the multi-mission scheduling optimization of UAV within a given operating time. Mission scheduling optimization problem is one of combinatorial optimization, and it has been shown to be NP-hard(non-deterministic polynomial-time hardness). In this problem, as the size of the problem increases, the computation time increases dramatically. So, we applied the genetic algorithm to this problem. For the application, we set the mission scenario, objective function, and constraints, and then, performed simulation with MATLAB. After 1000 case simulation, we evaluate the optimality and computing time in comparison with global optimum from MILP(Mixed Integer Linear Programming).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.409-413
• /
• 2005

The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.23 no.2
• /
• pp.15-20
• /
• 2015

This paper introduces a new airspace design method for continuous climb operation (CCO). The optimization problem is formulated as Mixed-Integer Linear Program (MILP) to maximize the upper limits of altitude on the waypoints to facilitate continuous climb for aircraft. In the proposed method, the interactions with other flight procedures are considered as well as various aircraft flight performances. The proposed method is applied to one of the departure procedures of Incheon International Airport (ICN) to demonstrate its performances.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.5
• /
• pp.426-432
• /
• 2000

A novel mixed-integer linear programming model for the short-term scheduling of a sequential multipurpose batch plant is addressed. First, a time slot domain to each unit is introduced. By assigning each time slot to a product, we obtain the production sequence that minimizes makespan. For multiple-unit assignment problem where a few parallel units with the same function exist, production paths are defined for the distinction of the same stage with a different unit. As a second issue, the model adapted for sequence dependent changeover is presented. For a time slot of a unit, if a product is assigned to the time slot and a different product is assigned to the adjacent time slot, the changeover time considering this situation is included. The performance of the proposed models are illustrated through two examples.

• Korean Management Science Review
• /
• v.21 no.2
• /
• pp.15-25
• /
• 2004

Great effort has been exerted to redesign the supply chain network as a means to improve corporate competitiveness. In this study, we present a mathematical model and a solution system to help redesign corporate logistics networks. The objective of the model is to minimize total logistics costs. We applied the solution system to real problem cases. We use the model and the concept to develop decision support system that is based on C++ with the use of CPLEX callable library as a solution engine. We tested and verified the DSS for redesigning the network of a large Korean electronics company. Through various scenario analyses. we recommend to redesign their supply chain network that demonstrates the possibility of substantial logistics cost savings.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.464-465
• /
• 2016

This paper analyzes the capabilities of multi-agent system (MAS) technology for the optimal multi-microgrids (MMGs) operation in grid-connected mode. In this system, communication among microgrids (MGs) is realized by developing a modified contract net protocol (MCNP) based on agent communication language (ACL) messages. Moreover, a two-stage mathematical model is proposed based on mixed integer linear programming (MILP) for local optimization in each MG, and global optimization in energy management system.