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

Search Result 133, Processing Time 0.029 seconds

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.

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.

컨테이너 터미널에서 수출컨테이너의 작업순서 및 장치위치 결정

  • Bae, Jong-Uk;Park, Yeong-Man
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2009.10a
    • /
    • pp.177-178
    • /
    • 2009
  • 본 연구는 반입 작업에서 수출 컨테이너의 작업순서 및 장치위치를 결정하는 문제를 다루었다. 수직 배치형 컨테이너 터미널에서 적하작업시간의 단축을 위해서는 가능한 해측에 컨테이너를 장치하는 것이 유리하지만 반입 외부 트럭의 빠른 회전시간의 측면에서는 육측이 선호된다. 이때 수출 컨테이너의 장치위치는 본선작업 우선순위에 따라 가중치가 다르고 이에 소요되는 장치소요시간에 따라 외부트럭들의 대기시간도 달라진다. 따라서 본 연구는 외부 트럭들의 예정 도착시간과 최대대기시간 그리고 적하작업의 선호 장치위치를 동시에 고려한 혼합정수모델을 개발하고 이를 활용한 적용 예를 제시하였다.

  • PDF

기능성 카본계 막의 개발과 수처리 응용에의 검토에 관한 연구

  • Bae, Sang-Dae
    • Proceedings of the Korean Environmental Sciences Society Conference
    • /
    • 2006.05a
    • /
    • pp.431-434
    • /
    • 2006
  • 폴리머 라텍스의 탄화와 메탄-질소 혼합가스의 CVD법으로 Carbon whisker를 가진 활성탄막을 개발하였다. 이 막의 PMMA 현탁물질 여과실험과 실제의 현탁물질과 용존유기물을 함유한 오래된 수도관으로부터 얻어진 적수여과실험 결과, Carbon whisker의 유무가 fouling에 의한 막의 flux를 억제하는 것으로 밝혀져, 실제의 정수공정에의 응용 가능성을 보였다.

  • PDF

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.

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.

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.

A Mixed Integer Nonlinear Programming Approach towards Optimal Earthmoving Equipment Selection (혼합 정수 비선형 계획법 기반 토공사 최적 장비 선정 방법 제시)

  • Ko, Yong-Ho;Ngov, Kheang;Lee, Su-Min;Shin, Do-Hyoung;Han, Seung-Woo
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2023.05a
    • /
    • pp.223-224
    • /
    • 2023
  • Optimal fleet management in the planning stage is one of the most critical activities that guarantee successful construction projects. In South Korea, the construction standard production rate database (CSPRD) is normally employed. However, when it comes to a trade-off problem that involves decision-making on optimal sets of equipment to perform a certain task, the method will require the planners' in-depth knowledge and experience regarding the target process and a time consuming estimation of the performance of every possible scenario must be conducted for the deduction of the optimal fleet management. On this account, this research paper proposes a lightweight method of using mixed integer nonlinear programming (MINLP) in multi-objective problems based on CSPRD-based mathematical equations to assist planners in the preplanning stage of choosing the optimal sets of types and size machinery to efficiently arrange the construction scheduling and budgeting.

  • PDF

Aggregating Prediction Outputs of Multiple Classification Techniques Using Mixed Integer Programming (다수의 분류 기법의 예측 결과를 결합하기 위한 혼합 정수 계획법의 사용)

  • Jo, Hongkyu;Han, Ingoo
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.1
    • /
    • pp.71-89
    • /
    • 2003
  • Although many studies demonstrate that one technique outperforms the others for a given data set, there is often no way to tell a priori which of these techniques will be most effective in the classification problems. Alternatively, it has been suggested that a better approach to classification problem might be to integrate several different forecasting techniques. This study proposes the linearly combining methodology of different classification techniques. The methodology is developed to find the optimal combining weight and compute the weighted-average of different techniques' outputs. The proposed methodology is represented as the form of mixed integer programming. The objective function of proposed combining methodology is to minimize total misclassification cost which is the weighted-sum of two types of misclassification. To simplify the problem solving process, cutoff value is fixed and threshold function is removed. The form of mixed integer programming is solved with the branch and bound methods. The result showed that proposed methodology classified more accurately than any of techniques individually did. It is confirmed that Proposed methodology Predicts significantly better than individual techniques and the other combining methods.

  • PDF

Remarshalling Planning for Multiple Automated Yard Cranes Considering Slack Time (여유시간을 고려한 다수 자동화 야드 크레인의 이적작업 일정계획)

  • Park, Young-Man
    • Journal of Navigation and Port Research
    • /
    • v.41 no.3
    • /
    • pp.149-154
    • /
    • 2017
  • Recently, container terminal operators have made efforts to develop an efficient remarshalling plan in response to the increase in automation of equipment handling and transport of containers in the terminals. Usually, containers are handled by multiple AYCs(automated yard cranes) in-yard in an automated container terminal, and terminal operators establish a remarshalling plan using slack time to increase the efficiency of ship operation. This study develops the optimal mathematical model through mixed integer programming as a solution to the problem of dispatching multiple AYCs. Considering the difficulty of direct application to the field due to computation time, we analyze the five prototypical dispatching rules for real world adaptation. A numerical experiment found that the maximum weight ratio (MR) rule and the maximum weight (MW) rule are the ideal dispatching solutions to the multiple AYCs dispatching problem.