• 제목/요약/키워드: Mixed Integer and Linear Programming (MILP)

검색결과 59건 처리시간 0.029초

협대역 통신시스템을 위한 전처리기-등화기 구조의 FIR 여파기 설계 (Design of FIR filters with Prefilter-Equalizer Structure for Narrowband Communication Systems)

  • 오혁준;안희준
    • 한국통신학회논문지
    • /
    • 제30권6C호
    • /
    • pp.577-584
    • /
    • 2005
  • 본 연구는 협대역 통신시스템을 위한 전처리기-등화기 구조의 여파기에서, 곱셈기를 사용하지 않는 최소 복잡도의 디지털 FIR 여파기를 설계하는 방법을 제안한다. 제안하는 여파기는 순환 다항식(cyclotomic polynomial, CP) 여파기와 2차 내삽 다항식(interpolated second order polynomial, ISOP) 등화기로 구성되며, 이 두 여파기가 동시에 혼합 정수 선형 계획법(mixed integer linear programming (MILP))으로 최적 설계되어 최소의 복잡도를 갖는 특성을 갖게 된다. 제안된 방식으로 설계된 여파기들은, 설계 규격을 만족하면서도 기존의 여파기에 비하여 복잡도면에서 월등히 간단함을 확인하였다.

Revisited Security Evaluation on Midori-64 against Differential Cryptanalysis

  • Guoyong Han;Hongluan Zhao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권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 263 and 2103.83, respectively. To our best knowledge, these results are superior to current ones.

가스터빈 복합발전의 기동특성을 고려한 열거래 기반 지역 냉난방 시스템의 최적 운영 모델 (Optimal Operation Model of Heat Trade based District Heating and Cooling System Considering Start-up Characteristic of Combined Cycle Generation)

  • 김종우;이지혜;김학만
    • 전기학회논문지
    • /
    • 제62권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).

연속상승운항을 위한 최적 공역 설계에 관한 연구 (A Study on Optimal Airspace Design for Continuous Climb Operation)

  • 김은영;홍성권;이금진
    • 한국항공운항학회지
    • /
    • 제23권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.

철강 공정의 일정계획을 위한 혼합정수계획 모델 (Mixed-Integer programming model for scheduling of steelmaking processes)

  • 복진광;이동엽;박선원
    • 제어로봇시스템학회논문지
    • /
    • 제5권6호
    • /
    • pp.714-723
    • /
    • 1999
  • This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.

  • PDF

네트워크형 가로망의 교통신호제어 최적화 모형개발 (Development of Optimization Model for Traffic Signal Timing in Grid Networks)

  • 김영찬;유충식
    • 대한교통학회지
    • /
    • 제18권1호
    • /
    • pp.87-97
    • /
    • 2000
  • Signal optimization model is divided bandwidth-maximizing model and delay-minimizing model. Bandwidth-maximizing model express model formulation as MILP(Mixed Integer Linear Programming) and delay-minimizing model like TRANSYT-7F use "hill climbing" a1gorithm to optimize signal times. This study Proposed optimization model using genetic algorithm one of evolution algorithm breaking from existing optimization model This Proposed model were tested by several scenarios and evaluated through NETSIM with TRANSYT-7F\`s outputs. The result showed capability that can obtain superior solution.

  • PDF

PSO 최적화 기법을 이용한 Ethylene Oxide Plant 배치에 관한 연구 (The Research of Optimal Plant Layout Optimization based on Particle Swarm Optimization for Ethylene Oxide Plant)

  • 박평재;이창준
    • 한국안전학회지
    • /
    • 제30권3호
    • /
    • pp.32-37
    • /
    • 2015
  • In the fields of plant layout optimization, the main goal is to minimize the construction cost including pipelines as satisfying all constraints such as safety and operating issues. However, what is the lacking of considerations in previous researches is to consider proper safety and maintenance spaces for a complex plant. Based on the mathematical programming, MILP(Mixed Integer Linear Programming) problems including various constraints can be formulated to find the optimal solution which is to achieve the best economic benefits. The objective function of this problem is the sum of piping cost, pumping cost and area cost. In general, many conventional optimization solvers are used to find a MILP problem. However, it is really hard to solve this problem due to complex inequality and equality constraints, since it is impossible to use the derivatives of objective functions and constraints. To resolve this problem, the PSO (Particle Swarm Optimization), which is one of the representative sampling approaches and does not need to use derivatives of equations, is employed to find the optimal solution considering various complex constraints in this study. The EO (Ethylene Oxide) plant is tested to verify the efficacy of the proposed method.

MILP model for short-term scheduling of multi-purpose batch plants with batch distillation process

  • Ha, Jin-Juk;Lee, Euy-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.1826-1829
    • /
    • 2003
  • Fine chemical production must assure high-standard product quality as well as characterized as multi-product production in small volumes. Installing high-precision batch distillation is one of the common elements in the successful manufacturing of fine chemicals, and the importance of the process operation strategy with quality assurance cannot be overemphasized. In this study, we investigate the optimal operation strategy and production planning of a sequential multi-purpose plants consisting of batch processes and batch distillation with unlimited intermediate storage. We formulated this problem as an MILP model. A mixed-integer linear programming model is developed based on the time slot, which is used to determine the production sequence and the production path of each batch. Illustrative examples show the effectiveness of the approach.

  • PDF

혼합정수 선형계획법과 유전 알고리듬을 이용한 다수 무인항공기 임무할당 (Task Assignment of Multiple UAVs using MILP and GA)

  • 최현진;서중보;김유단
    • 한국항공우주학회지
    • /
    • 제38권5호
    • /
    • pp.427-436
    • /
    • 2010
  • 본 논문은 다수의 목표물과 다수의 임무가 존재하는 상황에서의 다수 무인항공기의 임무할당 문제를 다룬다. 다수 무인항공기의 임무할당 문제는 순회 세일즈맨 문제, 차량 라우팅 문제와 같은 조합최적화 문제의 일종으로 NP-hard의 계산 복잡도를 가지고 있다. 이런 성격의 문제는 문제의 크기가 커질수록 계산시간이 급격히 증가하는 특징을 지니기 때문에 문제를 효율적으로 풀기 위해서 근사화 방법 또는 발견적인 방법을 사용한다. 본 연구에서는 임무할당 문제를 혼합정수 선형계획 문제로 정식화하고, 혼합정수 선형계획법과 유전 알고리듬으로 해를 구하였다. 다수의 목표물, 다수의 임무, 장애물이 존재하는 환경에 대한 수치 시뮬레이션을 수행하여 각 방법의 최적성과 효율성에 대해 검토하였다.

Efficient Logical Topology Design Considering Multiperiod Traffic in IP-over-WDM Networks

  • Li, Bingbing;Kim, Young-Chon
    • Journal of the Optical Society of Korea
    • /
    • 제19권1호
    • /
    • pp.13-21
    • /
    • 2015
  • In recent years energy consumption has become a main concern for network development, due to the exponential increase of network traffic. Potential energy savings can be obtained from a load-adaptive scheme, in which a day can be divided into multiple time periods according to the variation of daily traffic patterns. The energy consumption of the network can be reduced by selectively turning off network components during the time periods with light traffic. However, the time segmentation of daily traffic patterns affects the energy savings when designing multiperiod logical topology in optical wavelength routed networks. In addition, turning network components on or off may increase the overhead of logical topology reconfiguration (LTR). In this paper, we propose two mixed integer linear programming (MILP) models to design the optimal logical topology for multiple periods in IP-over-WDM networks. First, we formulate the time-segmentation problem as an MILP model to optimally determine the boundaries for each period, with the objective to minimize total network energy consumption. Second, another MILP formulation is proposed to minimize both the overall power consumption (PC) and the reconfiguration overhead (RO). The proposed models are evaluated and compared to conventional schemes, in view of PC and RO, through case studies.