• 제목/요약/키워드: mixed-integer programming

검색결과 389건 처리시간 0.026초

명중률의 불확실성을 고려한 추계학적 무장-표적 할당 문제 (Stochastic Weapon Target Assignment Problem under Uncertainty in Targeting Accuracy)

  • 이진호;신명인
    • 한국경영과학회지
    • /
    • 제41권3호
    • /
    • pp.23-36
    • /
    • 2016
  • We consider a model that minimizes the total cost incurred by assigning available weapons to existing targets in order to reduce enemy threats, which is called the weapon target assignment problem (WTAP). This study addresses the stochastic versions of WTAP, in which data, such as the probability of destroying a target, are given randomly (i.e., data are identified with certain probability distributions). For each type of random data or parameter, we provide a stochastic optimization model on the basis of the expected value or scenario enumeration. In particular, when the probabilities of destroying targets depending on weapons are stochastic, we present a stochastic programming formulation with a simple recourse. We show that the stochastic model can be transformed into a deterministic equivalent mixed integer programming model under a certain discrete probability distribution of randomness. We solve the stochastic model to obtain an optimal solution via the mixed integer programming model and compare this solution with that of the deterministic model.

MINLP를 이용한 제지 공정의 파지 손실 최소화 (Minimization of Trim Loss Problem in Paper Mill Scheduling Using MINLP)

  • 나성훈;고대호;문일
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.392-392
    • /
    • 2000
  • This study performs optimization of paper mill scheduling using MINLP(Mixed-Integer Non-Linear Programming) method and 2-step decomposing strategy. Paper mill process is normally composed of five units: paper machine, coater, rewinder, sheet cutter and roll wrapper/ream wrapper. Various kinds of papers are produced through these units. The bottleneck of this process is how to cut product papers efficiently from raw paper reel and this is called trim loss problem or cutting stock problem. As the trim must be burned or recycled through energy consumption, minimizing quantity of the trim is important. To minimize it, the trim loss problem is mathematically formulated in MINLP form of minimizing cutting patterns and trim as well as satisfying customer's elder. The MINLP form of the problem includes bilinearity causing non-linearity and non-convexity. Bilinearity is eliminated by parameterization of one variable and the MINLP form is decomposed to MILP(Mixed-Integer Linear programming) form. And the MILP problem is optimized by means of the optimization package. Thus trim loss problem is efficiently minimized by this 2-step optimization method.

  • PDF

혼합 정수 선형 계획법 기반의 최적 경제 급전을 활용한 분산형 열병합 발전원의 송전선로 건설비용 회피 편익계산 (Calculating the Benefit of Distributed Combined Heat Power Generators from Avoiding a Transmission Expansion Cost by Solving a Mixed Integer Linear Programming)

  • 권욱현;박용기;노재형;박종배;이두희
    • 전기학회논문지
    • /
    • 제68권4호
    • /
    • pp.513-522
    • /
    • 2019
  • We calculate the benefit of distributed combined heat power generators from avoiding a transmission expansion cost by building distributed generators near electricity demand centers. We determine a transmission expansion plan by solving a mixed integer linear problem, where we modify capacities of existing transmission lines and build new transmission lines. We calculate the benefit by comparing the sum of generation and transmission expansion costs with or without distributed generators through two simulation frames. In the first frame, for the current demand, we substitute existing distributed generators for non-distributed generators and measure an additional cost to balance the generation and demand. In the second frame, for increased future demand, we compare the cost to invest only in distributed generators to the cost to invest only in non-distributed generators. As a result, we show that the distributed generators have at least 5.8 won/kWh of the benefit from avoiding the transmission expansion cost.

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

  • 고용호;키앙;이수민;신도형;한승우
    • 한국건축시공학회:학술대회논문집
    • /
    • 한국건축시공학회 2023년도 봄 학술논문 발표대회
    • /
    • 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

혼합정수 계획법을 이용한 전략적 입지선정 -자동차 SCM을 중심으로- (Design of Mixed Integer Linear Programming Model for Strategic Location Decision -Focused on the Automotive Industry SCM-)

  • 하영규;우수한
    • 무역학회지
    • /
    • 제46권2호
    • /
    • pp.213-228
    • /
    • 2021
  • In recent year, US government requires local investment ,unlike in the past, when import restrictions and tariff were imposed. In this situation, many companies are considering new investment in the US and entering the local market. However, research on the optimal investment plan along with the case analysis on trade regulation is extremely limited and more research needs to be conducted. Accordingly, this study aims to suggest the implications and countermeasure of the SCM and logistical perspective by studying the optimal measures for the new investment of each company due to trade regulation. As a research method, the gravity location model, Mixed Integer Linear Programming Model were used to select the optimal automobile manufacturing factory considering each state's population. This study will be implication of SCM and logistics perspective not only for companies considering new investment in the US but also for the government to conduct trade negotiations. In the future, it is expected that the US trade pressure will increase and affect Korea in many ways. Therefore, in order to cope with such difficult situation in a timely manner, continuous research considering various possibilities is needed in the future.

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

  • Jo, Hongkyu;Han, Ingoo
    • 지능정보연구
    • /
    • 제9권1호
    • /
    • pp.71-89
    • /
    • 2003
  • 경영 분류 문제에 대한 많은 연구들은 여러가지 기법들간의 성과 비교에 대한 것이었지만, 각각의 연구들마다 가장 좋은 기법이 어떤 것인가에 대해서는 상이한 결론을 내고 있다. 다수의 분류 기법 중에서 가장 좋은 것을 사용하는 방법에 대한 대안으로,분류 기법을 통합하여 성과를 향상시키는 방법이 있다. 본 연구에서는 개별 분류 기법의 결과를 선형 결합하여 예측력을 높이는 방법을 제시하였다. 최 적 선형 결합 가중치를 계산하기 위해 혼합 정수 계 획 법을 사용하였다. 목적 함수로 사용한 오분류 비용의 최소화에서 오분류 비용은 부도 기업을 모형에서 정상으로 예측한 오류와 정상기업을 모형에서 부도 기업으로 예측한 오류의 합으로 정의하였다. 문제 풀이 과정을 단순화하기 위하여 본 논문에서는 절사점 (cutoff value)을 고정하였고, 경계 함수 (threshold function)를 배제하였다. 정수계획법의 계산을 위해 branch 8, bound 방법을 사용하였다. 선형 결합에 의한 모형의 예측력이 개별 기법에 의해 구축된 모형의 예측력을 상회하였고, 그 차이가 통계적으로도 유의하였다.

  • PDF

블록조립공장의 부하평준화를 위한 생산일정계획 (A Production Schedule for Load Leveling in a Block Assembly Shop)

  • 이재동;홍유신
    • 산업공학
    • /
    • 제7권2호
    • /
    • pp.75-85
    • /
    • 1994
  • This paper presents a production scheduling model in a block assembly shop in shipbuilding industry. In a block assembly shop, the most important performance criterion is load leveling, which balances manpower and work area utilization through the planning horizon. The problem is formulated as a mixed-integer nonlinear programming(MINLP) problem of which objective function is to optimize load leveling. The developed MINLP problem can not be solvable due to computational complexity. The MINLP problem is decomposed into two stage mixed-integer linear programming (MILP) problems to obtain a good solution, but the decomposed MILP problems are still computationally intractable because of combinatorial complexity. Therfore, a heuristic method using linear programming is proposed to solve two stage MILP problems sequentially. The proposed heuristic generates a good production schedule within a reasonable computation time, and it is easily applicable for establishing the production schedule in a block assembly shop in shipbuilding industry.

  • PDF

다목적 비선형 혼합정수계획법을 이용한 셀 형성 (Cell Formation Using Fuzzy Multiobjective Nonlinear Mixed-integer Programming)

  • 오명진
    • 산업경영시스템학회지
    • /
    • 제23권61호
    • /
    • pp.41-50
    • /
    • 2000
  • Cell formation(CF) Is to group parts with similar geometry, function, material and process into part families, and the corresponding machines into machine cells. Cell formation solutions often contain exceptional elements(EEs). Also, the following objective functions - minimizing the total costs of dealing with exceptional elements and maximizing total similarity coefficients between parts - have been used in CF modeling. Thus, multiobjective programming approach can be developed to model cell formation problems with two conflicting objective functions. This paper presents an effective cell formation method with fuzzy multiobjective nonlinear mixed-integer programming simultaneously to form machine cells and to minimize the cost of eliminating EEs.

  • PDF

클레임코스트를 고려한 프로젝트의 시간-비용 혼합정수계획모형 (Considering Claim Costs in Project Time-Cost Mixed Integer Programming Model)

  • 김종열;강창욱;황인극
    • 산업경영시스템학회지
    • /
    • 제34권3호
    • /
    • pp.97-105
    • /
    • 2011
  • Previous researches have focused on the efficiency of project execution and the satisfaction of internal customers In view of the fact that a project is successful if any defects are not found in the short-term performance test of the project final outcome. To execute a project that both internal customer and external customer are satisfied in terms of longer-term benefit perspective, the project claim costs (PCC) which may occur for the warranty period of the project final outcome should be considered. We propose a model included PCC to the linear programming between time and cost to expedite a project and perform the validity test by applying the model to an example project. This model and related procedure will contribute to overall project activities' cost reduction by taking preventive actions for PCC.

철강 공정의 일정계획을 위한 혼합정수계획 모델 (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