• 제목/요약/키워드: Mixed integer optimization

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

Robust investment model for long range capacity expansion of chemical processing networks using two-stage algorithm

  • Bok, Jinkwang;Lee, Heeman;Park, Sunwon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
    • /
    • pp.1758-1761
    • /
    • 1997
  • The problem of long range capacity expansion planing for chemical processing network under uncertain demand forecast secnarios is addressed. This optimization problem involves capactiy expansion timing and sizing of each chemical processing unit to maximize the expected net present value considering the deviation of net present values and the excess capacity over a given time horizon. A multiperiod mixed integer nonlinear programming optimization model that is both solution and modle robust for any realization of demand scenarios is developed using the two-stage stochastic programming algorithm. Two example problems are considered to illustrate the effectiveness of the model.

  • PDF

중소 제조기업을 위한 엑셀기반 스케쥴링 시스템 (An Excel-Based Scheduling System for a Small and Medium Sized Manufacturing Factory)

  • 이창수;최경일;송영효
    • 품질경영학회지
    • /
    • 제36권2호
    • /
    • pp.28-35
    • /
    • 2008
  • This study deals with an Excel-based scheduling system for a small and medium sized manufacturing factory without sufficient capability for managing full-scale information systems. The factory has the bottleneck with identical machines and unique batching characteristics. The scheduling problem is formulated as a variation of the parallel-machine scheduling system. It can be solved by a two-phase method: the first phase with an ant colony optimization (ACO) heuristic for order grouping and the second phase with a mixed integer programming (MIP) algorithm for scheduling groups on machines.

대규모 기업집단의 순환출자 해소를 위한 휴리스틱 기법 (A Heuristic Method for Resolving Circular Shareholdings of Korean Large Business Groups)

  • 박찬규
    • 한국경영과학회지
    • /
    • 제38권4호
    • /
    • pp.65-78
    • /
    • 2013
  • Circular shareholding is established when at least three member firms in a business group hold stock in other member firms and form a series of ownership in a circular way. Although there have been many studies which investigated a negative effect of circular shareholding on firm's value, few studies have discussed how to resolve the problem given complicated ownership structures of large business groups. This paper is based on a mixed integer programming model, which was proposed in the author's previous research and can identify the ownership share divested in order to resolve circular shareholding. Since the optimization model becomes too complicated for large business groups and requires a sophisticated software to solve it, we propose a simple heuristic method that can find a good approximate solution to the model. Its applications to twelve Korean large business groups show that the heuristic method is not just computationally attractive but also provides near-optimal solutions in most cases.

최적화에 근거한 LAD의 패턴생성 기법 (Optimization-Based Pattern Generation for LAD)

  • 장인용;류홍서
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2005년도 추계학술대회 및 정기총회
    • /
    • pp.409-413
    • /
    • 2005
  • The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

  • PDF

전술적 선박 스케쥴링의 최적화 분석에 관한 연구 (A Study on the Optimization Analysis of Tactical Ship Scheduling)

  • 이경근;김시화
    • 한국항해학회지
    • /
    • 제18권2호
    • /
    • pp.57-67
    • /
    • 1994
  • This paper treats the optimization analysis of tactical ship scheduling problems in the world seaborne bulk trade. The authors use the term 'tactial' to describe the ship scheduling problem where the owners should employ skillful tactics as an expedient toward gaining the higher profits per period in short term. Relevent research and related problems on ship scheduling problems are reviewed briefly and a model for the tactical ship scheduling problem formulated as Set Problem is introduced by modifying the previous work of Fisher(1989). The reality and practicability of the model is validated by some ship-ping statistics. Proper solution approaches are outlined in the context of computational tractability in tackling the Mixed Integer Propramming. Some underlying consideration for the computational experiment is also mentioned. The authors conclude the paper with the remarks on the need of user-friendly Decision Support System for ship scheduling under varying decision environment.

  • PDF

멀티 마이크로그리드 최적 운영을 위한 멀티 에이전트 시스템 적용 (Applying Multi-Agent System for Optimal Multi-Microgrids Operation)

  • 부이 반하이;후세인 아크타르;김학만
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2016년도 춘계학술발표대회
    • /
    • pp.464-465
    • /
    • 2016
  • This paper analyzes the capabilities of multi-agent system (MAS) technology for the optimal multi-microgrids (MMGs) operation in grid-connected mode. In this system, communication among microgrids (MGs) is realized by developing a modified contract net protocol (MCNP) based on agent communication language (ACL) messages. Moreover, a two-stage mathematical model is proposed based on mixed integer linear programming (MILP) for local optimization in each MG, and global optimization in energy management system.

The Use of Particle Swarm Optimization for Order Allocation Under Multiple Capacitated Sourcing and Quantity Discounts

  • Ting, Ching-Jung;Tsai, Chi-Yang;Yeh, Li-Wen
    • Industrial Engineering and Management Systems
    • /
    • 제6권2호
    • /
    • pp.136-145
    • /
    • 2007
  • The selection of suppliers and the determination of order quantities to be placed with those suppliers are important decisions in a supply chain. In this research, a non-linear mixed integer programming model is presented to select suppliers and determine the order quantities. The model considers the purchasing cost which takes into account quantity discount, the cost of transportation, the fixed cost for establishing suppliers, the cost for holding inventory, and the cost of receiving poor quality parts. The capacity constraints for suppliers, quality and lead-time requirements for the parts are also taken into account in the model. Since the purchasing cost, which is a decreasing step function of order quantities, introduces discontinuities to the non-linear objective function, it is not easy to employ traditional optimization methods. Thus, a heuristic algorithm, called particle swarm optimization (PSO), is used to find the (near) optimal solution. However, PSO usually generates initial solutions randomly. To improve the PSO solution quality, a heuristic procedure is proposed to find an initial solution based on the average unit cost including transportation, purchasing, inventory, and poor quality part cost. The results show that PSO with the proposed initial solution heuristic provides better solutions than those with PSO algorithm only.

군용 수송기 소요 산정 최적화 모형 (An Optimization Model for Determining the Number of Military Cargo-plane)

  • 김희수;이문걸;문호석;황성인
    • 산업경영시스템학회지
    • /
    • 제46권4호
    • /
    • pp.160-172
    • /
    • 2023
  • In contemporary global warfare, the significance and imperative of air transportation have been steadily growing. The Republic of Korea Air Force currently operates only light and medium-sized military cargo planes, but does not have a heavy one. The current air transportation capability is limited to meet various present and future air transport needs due to lack of performance such as payload, range, cruise speed and altitude. The problem of population cliffs and lack of airplane parking space must also be addressed. These problems can be solved through the introduction of heavy cargo planes. Until now, most studies on the need of heavy cargo plane and increasing air transport capability have focused on the necessity. Some of them suggested specific quantity and model but have not provided scientific evidence. In this study, the appropriate ratio of heavy cargo plane suitable for the Korea's national power was calculated using principal component analysis and cluster analysis. In addition, an optimization model was established to maximize air transport capability considering realistic constraints. Finally we analyze the results of optimization model and compare two alternatives for force structure.

최적화 기법 기반의 항공기 스케줄러 개발 및 실제 공항의 수치적 모사 (A development of an Optimization-Based Flight Scheduler and Its Simulation-Based Application to Real Airports)

  • 유민석;송재훈;최성임
    • 한국항공우주학회지
    • /
    • 제41권9호
    • /
    • pp.681-688
    • /
    • 2013
  • 불가피하게 급증하는 항공기 수요량에 따른 여러 가지 문제들을 해결하는 방안으로 항공기의 지연시간을 줄여, 공항의 수용력을 극대화하는 항공교통관리가 주목받고 있다. 본 논문은 공항주변 항공교통흐름을 원활히 하여 항공기 처리량을 최대화하는 항공기 스케줄링의 최적화를 목적으로 한다. 본 연구에서 개발한 스케줄링 기법은 스케줄링 문제를 수학적으로 모델링한 후, 혼합정수선형계획법과 유전자 알고리즘을 도입하여 항공기 지연시간을 최소로 하는 최적의 스케줄링을 제공한다. 최적화된 스케줄링과 실제 인천 공항에서의 항공기 스케줄링과 비교해 보았고, 그 결과 최적화된 스케줄링이 제공하는 항공기 처리량이 현재 인천 공항에서 처리하는 항공기보다 현저히 높다는 결과를 확인할 수 있었다. 본 연구에서 개발한 스케줄러는 향후 항공기의 포화 상태를 적절하게 대처하는데 큰 도움을 줄 것이라 예상되어진다.

간선도로 연동화 신호최적화 모형 KS-SIGNAL의 수행속도 향상을 위한 연구 (A Study on Improvement of Run-Time in KS-SIGNAL, Traffic Signal Optimization Model for Coordinated Arterials)

  • 박찬호;김영찬
    • 대한교통학회지
    • /
    • 제18권4호
    • /
    • pp.7-18
    • /
    • 2000
  • 본 논문에서는 기개발된 간선도로 연동화 신호최적화 모형인 KS-SIGNAL의 최적화 수행속도를 향상시키기 위한 새로운 모형식을 개발하였다. 이를 위하여 기존 모형식의 수정, MILP 최적화 루틴의 탑재, 좌회전 현시순서와 관련한 제약식의 추가 등 3단계에 걸친 모형 개선 작업이 이루어졌으며, 그 결과 기존 모형식과 비교 99%이상의 최적화 수행시간 단축 효과를 창출하였다. 개발된 KS-SIGNAL 모형식은 여러 다양한 경우에 대해 모의실험을 실시한 결과 교통량보다는 교차로간 거리에 더욱 민감하게 반응함으로써 지체최소화모형 (TRANSYT-7F)보다는 통과폭최대화모형(PASSER-II)에 더 가까운 신호시간계획을 산출하였다. 더불어 본 모형식이 좌회전 현시순서를 최적화시키지 못하는 TRANSYT-7F 모형식과 통과폭을 최대화하나 통과폭 밖의 직진교통류를 고려하지 못하는 PASSER-II 모형식, 그리고 이들의 단점을 상호보완한 결합모형과 비교하여 더 적은 지체를 유발시키는 보다 더 효율적인 신호시간계획을 창출하는 것으로 분석되었다.

  • PDF