• Title/Summary/Keyword: Mixed Integer and Linear Programming (MILP)

Search Result 59, Processing Time 0.155 seconds

Edge Router Selection and Traffic Engineering in LISP-Capable Networks

  • Li, Ke;Wang, Sheng;Wang, Xiong
    • 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.

Design of Mixed Integer Linear Programming Model for Transportation Planning (혼합 정수 선형 계획법을 이용한 수송 계획 모델 설계)

  • Park, Yong Kuk;Lee, Min Goo;Jung, Kyung Kwon;Won, Young-Jin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.11
    • /
    • pp.166-174
    • /
    • 2016
  • In this paper, we developed a mixed-integer linear programming model for transportation planning of athletes in sports events. The transportation planning of athletes involves finding the lowest-cost and fastest-time plan for distributing athletes from multiple accommodation to stadium. The decision variables associate with the number of driving events, and the total transportation cost is the objective function that needs to be minimized. The proposed method uses mixed integer linear programming to solve transportation problem, thus the global optimality is guaranteed. In order to verify the effectiveness of proposed method, we performed simulation and built the sports event management service platform (SEMSP) for transportation planning.

Optimal Weapon-Target Assignment Algorithm for Closed-In Weapon Systems Considering Variable Burst Time (가변 연속사격 시간을 고려한 근접 방어 시스템의 최적 무장 할당 알고리듬)

  • Kim, Bosoek;Lee, Chang-Hun;Tahk, Min-Jea;Kim, Da-Sol;Kim, Sang-Hyun;Lee, Hyun-Seok
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.49 no.5
    • /
    • pp.365-372
    • /
    • 2021
  • This paper deals with an optimal Weapon-Target Assignment (WTA) algorithm for Closed-In Weapon Systems (CIWS), considering variable burst time. In this study, the WTA problem for CIWS is formulated based on Mixed Integer Linear Programming (MILP). Unlike the previous study assuming that the burst time is fixed regardless of the engagement range, the proposed method utilizes the variable burst time based on the kill probability according to the engagement range. Thus, the proposed method can reflect a more realistic engagement situation and reduce the reaction time of CIWS against targets, compared to the existing method. In this paper, we first reformulate the existing MILP-based WTA problem to accommodate the variable burst Time. The proposed method is then validated through numerical simulations with the help of a commercial optimization tool.

A Study on Optimal Design of Single Periodic, Multipurpose Batch Plants

  • Rhee, In-Hyoung;Cho, Dae-Chul
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.3 no.1
    • /
    • pp.10-19
    • /
    • 2002
  • The purpose of this paper is to describe the design of a general multipurpose batch process or plant in terms of a series of mathematical programing models, and to develop approach solution methodologies. The proposed model for a single period is based on the formulation (MINLP; Mixed Integer Nonlinear Programming) of Papageorgaki and Reklaitis [1], but was linearized (MILP; Mixed Integer Linear Programming) so as to obtain an exact and practical solution, and to allow treatment of uncertainties to be considered in expanding the plant. As a solution strategy a modified Benders' Decomposition was introduced and was tested on three example problems. The optimizing solver, OSL code provided by the IBM Corporation, was used for solving the problems. The solution method was successful in that it showed remarkable reduction in the computing times as compared with the direct solution method.

  • PDF

Searching for Impossible Differential Characteristics of ARX-Based Block Cipher Using MILP (MILP를 이용한 ARX 기반 블록 암호의 불능 차분 특성 탐색)

  • Lee, HoChang;Kang, HyungChul;Hong, Deukjo;Sung, Jaechul;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.3
    • /
    • pp.427-437
    • /
    • 2017
  • Impossible differential characteristics distinguish the corresponding block cipher from random substitution and can also be used for key recovery attack. Recently Cui et al. proposed an automatic method for searching impossible differential characteristics of several ARX - based block ciphers using Mixed Integer Linear Programming(MILP). By optimizing the method proposed by Cui et al., It was possible to find new impossible differential characteristics which could not be founded by the method by using less linear constraint expression than the existing method. It was applied to the SPECK family and LEA using the modified method. We found 7-rounds for SPECK32, SPECK48, SPECK64, SPECK96 and 8-rounds impossible differential characteristics of SPECK128. These impossible differential characteristics are all newly found. We also found existing 10-rounds of impossible differential characteristic and new 10-rounds of impossible differential characteristics of LEA.

Study for the Plant Layout Optimization for the Ethylene Oxide Process based on Mathematical and Explosion Modeling (수학적 모델과 폭발사고 모델링을 통한 산화에틸렌 공정의 설비 배치 최적화에 관한 연구)

  • Cha, Sanghoon;Lee, Chang Jun
    • Journal of the Korean Society of Safety
    • /
    • v.35 no.1
    • /
    • pp.25-33
    • /
    • 2020
  • In most plant layout optimization researches, MILP(Mixed Integer Linear Programming) problems, in which the objective function includes the costs of pipelines connecting process equipment and cost associated with safety issues, have been employed. Based on these MILP problems, various optimization solvers have been applied to investigate the optimal solutions. To consider safety issues on the objective function of MILP problems together, the accurate information about the impact and the frequency of potential accidents in a plant should be required to evaluate the safety issues. However, it is really impossible to obtain accurate information about potential accidents and this limitation may reduce the reliability of a plant layout problem. Moreover, in real industries such as plant engineering companies, the plant layout is previously fixed and the considerations of various safety instruments and systems have been performed to guarantee the plant safety. To reflect these situations, the two step optimization problems have been designed in this study. The first MILP model aims to minimize the costs of pipelines and the land size as complying sufficient spaces for the maintenance and safety. After the plant layout is determined by the first MILP model, the optimal locations of blast walls have been investigated to maximize the mitigation impacts of blast walls. The particle swarm optimization technique, which is one of the representative sampling approaches, is employed throughout the consideration of the characteristics of MILP models in this study. The ethylene oxide plant is tested to verify the efficacy of the proposed model.

A Study on ESS Optimal Operation Strategy Using Two Stage Hybrid Optimization (Two Stage Hybrid Optimization을 사용한 ESS 최적 운전 전략에 대한 연구)

  • Gong, Eun-Kyoung;Sohn, Jin-Man
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.7
    • /
    • pp.833-839
    • /
    • 2018
  • This paper presents an analysis and the methodology of optimal operation strategy of the ESS(Energy Storage System) for reduce electricity charges. Electricity charges consist of a basic charge based on the contract capacity and energy charge according to the power usage. In order to use electrical energy at minimal charge, these two factors are required to be reduced at the same time. QP(Quadratic Programming) is appropriate for minimization of the basic charge and LP(Linear Programmin) is adequate to minimize the energy charge. However, the integer variable have to be introduced for modelling of different charge and discharge efficiency of ESS PCS(Power Conversion System), where MILP(Mixed Integer Linear Programming) can be used. In this case, the extent to which the peak load savings is accomplished should be assumed before the energy charge is minimized. So, to minimize the electricity charge exactly, optimization is sequentially performed in this paper, so-called the Two Stage Hybird optimization, where the extent to which the peak load savings is firstly accomplished through optimization of basic charge and then the optimization of energy charge is performed with different charge and discharge efficiency of ESS PCS. Finally, the proposed method is analyzed quantitatively with other optimization methods.

An Analysis of Optimal Operation Strategy of ESS to Minimize Electricity Charge Using Octave (Octave를 이용한 전기 요금 최소화를 위한 ESS 운전 전략 최적화 방법에 대한 분석)

  • Gong, Eun Kyoung;Sohn, Jin-Man
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.4
    • /
    • pp.85-92
    • /
    • 2018
  • Reductions of the electricity charge are achieved by demand management of the load. The demand management method of the load using ESS involves peak shifting, which shifts from a high demand time to low demand time. By shifting the load, the peak load can be lowered and the energy charge can be saved. Electricity charges consist of the energy charge and the basic charge per contracted capacity. The energy charge and peak load are minimized by Linear Programming (LP) and Quadratic Programming (QP), respectively. On the other hand, each optimization method has its advantages and disadvantages. First, the LP cannot separate the efficiency of the ESS. To solve these problems, the charge and discharge efficiency of the ESS was separated by Mixed Integer Linear Programming (MILP). Nevertheless, both methods have the disadvantages that they must assume the reduction ratio of peak load. Therefore, QP was used to solve this problem. The next step was to optimize the formula combination of QP and LP to minimize the electricity charge. On the other hand, these two methods have disadvantages in that the charge and discharge efficiency of the ESS cannot be separated. This paper proposes an optimization method according to the situation by analyzing quantitatively the advantages and disadvantages of each optimization method.

Design of IIR Filters with Prefilter-Equalizer Structure for Narrowband Applications (협대역 응용 시스템을 위한 전처리기-등화기 구조의 IIR 여파기 설계 방법)

  • Oh Hyuk-jun;Ahn Hee-june
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.143-152
    • /
    • 2005
  • Optimal methods for designing multiplierless IIR filters with cascaded prefilter-equalizer structures are proposed for narrowband applications. Assuming that an U filter consists of a cyclotomic Polynomial (CP) prefilter and an all-Pole equalizer based on interpolated first order polynomial (IFOP), in the proposed method the prefilter and equalizer are simultaneously designed using mixed integer linear programming (MILP). The resulting filter is a cascaded filter with minimal complexity. In addition, MtP tries to minimize both computational complexity and phase response non-linearity. Design examples demonstrate that the proposed methods produce a more efficient cascaded prefilter-equalizer than existing methods.