• Title/Summary/Keyword: 혼합 정수계획법

Search Result 103, Processing Time 0.025 seconds

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

  • Choi, Hyun-Jin;Seo, Joong-Bo;Kim, You-Dan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.5
    • /
    • pp.427-436
    • /
    • 2010
  • This paper deals with a task assignment problem of multiple UAVs performing multiple tasks on multiple targets. The task assignment problem of multiple UAVs is a kind of combinatorial optimization problems such as traveling salesman problem or vehicle routing problem, and it has NP-hard computational complexity. Therefore, computation time increases as the size of considered problem increases. To solve the problem efficiently, approximation methods or heuristic methods are widely used. In this study, the problem is formulated as a mixed integer linear program, and is solved by a mixed integer linear programming and a genetic algorithm, respectively. Numerical simulations for the environment of the multiple targets, multiple tasks, and obstacles were performed to analyze the optimality and efficiency of each method.

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.

Optimum Operational Schedule for Cogeneration Systems using the Mixed Integer Programming (혼합정수계획법에 의한 열병합발전설비의 최적운용)

  • 차재상
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.16 no.5
    • /
    • pp.75-82
    • /
    • 2002
  • This paper propose a new mathematical modelling method about optimum operational schedule for cogeneration systems. Proposed algorithm solving the energy product cost function in this paper is very similar to the real model that is, proposed algorithm solve nonlinear type of real model using mixed integer programming based on the piecewise linear function while the conventional algorithms used before could not solve that kind of problems. The effectiveness of the proposed method is ascertained by the simulation results with varius case studies which are similar to real operation circumstances.

A Mathematical Model for Sewer Rehabilitation Planning by Considering Inflow/infiltration (불명수를 고려한 하수관거 정비 계획 수립을 위한 수학 모형)

  • Lee, Yong-Dae;Kim, Sheung-Kown;Kim, Jae-Hee;Kim, Joong-Hun
    • 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.

Long-term Power System Planning by using Mixed-Integer Programming (선형계획법을 활용한 장기 전력계통 계획수립 기법개발)

  • Ryu, Heon-Su;Cho, Kang-Wook;Lee, Jo-Lyeon;Kim, Tae-Hoon;Kim, Jin-Yi;Park, Marn-Geun
    • Proceedings of the KIEE Conference
    • /
    • 2007.11b
    • /
    • pp.100-102
    • /
    • 2007
  • 본 논문에서는 혼합정수 선형계획 법을 이용하여 장기 전력계통 계획수립시 최적의 설비를 투자할 수 있는 기법을 제안하였다. 발전설비와 송변전설비는 하나의 망으로 연결되어 상호 보완적 영향을 주기 때문에 계통계획시 두 설비를 동시에 평가하는 것이 무엇보다 중요하다. 또한 계획기간 전체에 대해 투자비를 고려하여 비용을 최소화해야 한다. 이를 위해 선형계획법을 계통계획에 도입하여 최소비용의 투자비를 가지고 공급 신뢰도 기준를 만족할 수 있는 최적 장기 전력계통 계획 수립기법을 개발하였다. 개발된 기법을 Garver 6모선 계통 및 제3차 전력수급기본계획에 대해 모의하여 결과의 타당성을 검증하였다.

  • PDF

물류네트워크 구축을 위한 현실적 접근 방향에 대한 연구

  • 구자용;송성헌
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.09a
    • /
    • pp.119-124
    • /
    • 1995
  • 물류네트워크에서 다루는 문제들은 물류거점의 입지문제, 물류거점의 재고문 제, 수배송문제로 크게 분류해 볼수 있으며 특히 이들 각 문제들은 복합적으 로 관련되어 있는 것이 사실이다. 이러한 물류네트워크모형을 수리적으로 표 현해보면 대규모 혼합 정수계획법이 되어 최적 해를 구하기가 매우 어려울 뿐더러 현실적으로 유리된 가정이 불가피하다. 수리모형의 비현실적인 가정 들을 가능한 줄이고 현실적으로 응용 가능한 방법론을 제시하는 것이 본 연 구의 목적이다. 때문에 단일 최적 해를 찾는 수리계획법 대신 대안별로 분 석.비교평가 할 수 있는 네트워크 시뮬레이션 기법을 이용하였다. 평가척도 는 비용인자와 서비스 수준을 이용하지만 시뮬레이션 기법의 유연성으로 인 해 다양한 평가인자를 접목시킬수 있는 가능성을 제공하였다. 현실성과 실용 성에 주안을 둔 본 연구는 프로그래밍 되어 분석 및 계획수립과정에 활용되 어질수 있다.

  • PDF

On an Implementation of a Hybrid Solver Based on Warren Abstract Machine and Finite Domain Constraint Programming Solver Structures (워렌 추상기계와 한정도메인 제약식프로그램의 구조를 이용한 혼합형 문제해결기 구현에 대한 탐색적 연구)

  • Kim Hak-Jin
    • Journal of Intelligence and Information Systems
    • /
    • v.10 no.2
    • /
    • pp.165-187
    • /
    • 2004
  • Constraint Programming in AS and Optimization in OR started and have grown in different backgrounds to solve common decision-making problems in real world. This paper tries to integrate results from those different fields by suggesting a hybrid solver as an integration framework. Starting with an integrating modeling language, a way to implement a hybrid solver will be discussed using Warren's abstract machine and an finite domain constraint programming solver structures. This paper will also propose some issues rising when implementing the hybrid solver and provide their solutions.

  • PDF

Development of A System Optimum Traffic Control Strategy with Cell Transmission Model (Cell Transmission 이론에 근거한 시스템최적 신호시간산정)

  • 이광훈;신성일
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.5
    • /
    • pp.193-206
    • /
    • 2002
  • A signal optimization model is proposed by applying the Cell-Transmission Model(CTM) as an embedded traffic flow model to estimate a system-optimal signal timing plan in a transportation network composed of signalized intersections. Beyond the existing signal-optimization models, the CTM provides appropriate theoretical and practical backgrounds to simulate oversaturation phenomena such as shockwave, queue length, and spillback. The model is formulated on the Mixed-Integer Programming(MIP) theory. The proposed model implies a system-optimal in a sense that traffic demand and signal system cooperate to minimize the traffic network cost: the demand departing from origins through route choice behavior until arriving at destinations and the signal system by calculating optimal signal timings considering the movement of these demand. The potential of model's practical application is demonstrated through a comparison study of two signal control strategies: optimal and fixed signal controls.

An Optimization Model for O&M Planning of Floating Offshore Wind Farm using Mixed Integer Linear Programming

  • Sang, Min-Gyu;Lee, Nam-Kyoung;Shin, Yong-Hyuk;Lee, Chulung;Oh, Young-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.12
    • /
    • pp.255-264
    • /
    • 2021
  • In this paper, we propose operations and maintenance (O&M) planning approach for floating offshore wind farm using the mathematical optimization. To be specific, we present a MILP (Mixed Integer Linear Programming that suggests the composition of vessels, technicians, and maintenance works on a weekly basis. We reflect accessibility to wind turbines based on weather data and loss of power generation using the Jensen wake model to identify downtime cost that vary from time to time. This paper also includes a description of two-stage approach for maintenance planning & detailed scheduling and numeric analysis of the number of vessels and technicians on the O&M cost. Finally, the MILP model could be utilized in order to establish the suitable and effective maintenance planning reflecting domestic situation.

Resource and Network Routing Optimization in Smart Nodes Environment (스마트 네트워크 환경에서의 자원 및 경로 최적화 연구)

  • Seo, Dong-Won;Yoon, Seung Hyun;Chang, Byeong-Yoon
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.4
    • /
    • pp.149-156
    • /
    • 2013
  • In this research, we dealt with an optimization problem which aims to minimize total cost of resources usage and network routing in a smart node environment. Toward this, we briefly introduced technology trends in smart nodes, methods in resource optimization fields, economic effects of smart network and content delivery (or distribution) network (CDN). Moreover, based on CDN we proposed and implemented a mathematical (mixed integer) programming model to combine replica placement and requests distribution problem (RPRDP) and routing problem. Computational result of an example on RPRDP+Routing problem is also provided.