• Title/Summary/Keyword: Mixed Integer Programming Model

Search Result 231, Processing Time 0.023 seconds

An Interconnection Model of ISP Networks (ISP 네트워크간 상호접속 모델)

  • Choi Eunjeong;Tcha Dong-Wan
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.4
    • /
    • pp.151-161
    • /
    • 2005
  • For Internet service providers (ISPs), there are three common types of interconnection agreements : private peering, public peering and transit. One of the most important problems for a single ISP is to determine which other ISPs to interconnect with, and under which agreements. The problem can be then to find a set of private peering providers, transit providers and Internet exchanges (IXs) when the following input data are assumed to be given : a set of BGP addresses with traffic demands, and a set of potential service providers (Private peering/transit providers and IXs) with routing information, cost functions and capacities. The objective is to minimize the total interconnection cost. We show that the problem is NP-hard, give a mixed-integer programming model, and propose a heuristic algorithm. Computational experience with a set of test instances shows the remarkable performance of the proposed algorithm of rapidly generating near-optimal solutions.

A Heuristic Algorithm for Berth Planning with a Limited Number of Cranes (크레인 대수의 제약을 고려한 선석계획 문제에 대한 발견적 해법)

  • Park, Young-Man;Kim, Kap-Hwan
    • Journal of Navigation and Port Research
    • /
    • v.35 no.1
    • /
    • pp.63-70
    • /
    • 2011
  • This paper discusses the problem of scheduling berth and container cranes simultaneously in port container terminals. A mixed-integer programming model is formulated by considering various practical constraints. A heuristic algorithm is suggested for solving the mathematical model. A numerical experiment was conducted to test the performance of the suggested heuristic algorithm.

Efficient Scheduling Algorithm for Sequential Multipurpose Batch Processes (순차적 다목적 회분식 공정을 위한 효과적인 일정계획)

  • 강진수;복진광;문성득;박선원;이태용
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.5
    • /
    • pp.426-432
    • /
    • 2000
  • A novel mixed-integer linear programming model for the short-term scheduling of a sequential multipurpose batch plant is addressed. First, a time slot domain to each unit is introduced. By assigning each time slot to a product, we obtain the production sequence that minimizes makespan. For multiple-unit assignment problem where a few parallel units with the same function exist, production paths are defined for the distinction of the same stage with a different unit. As a second issue, the model adapted for sequence dependent changeover is presented. For a time slot of a unit, if a product is assigned to the time slot and a different product is assigned to the adjacent time slot, the changeover time considering this situation is included. The performance of the proposed models are illustrated through two examples.

  • PDF

A Broadband Local Access Network Design with Double-star Topology under Uncertain Demands (불확실한 수요 하에서 이중성형 구조의 광댁역 접속망 설계에 관한 연구)

  • 윤문길
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.2
    • /
    • pp.87-100
    • /
    • 2000
  • As a result of rapid advances in communication technology, fiber optics have begun to be adopted in most telecommunication systems 3s an economic choice Due to the trend of evolution toward broadband communication network with fiber optics and electronic devices. the network design problem for broadband communication has been received a great deal of research attention recently. In this paper, we address a topological design problem for broadband local access network with uncertain demands, which has received surprisingly little attention so far. in our problem, we select a set of hubs and links for constructing network expected penalty cost for the amount of undersupplied In addition to the usual cost terms of the fixed demand problem Our problem can be approximated as a mixed 0-1 integer programming problem by using Szwarc’s linear approximation technique. Then the problem is transformed successfully into a version of classical network design model. Some computational experiments for the model and concluding remarks are described.

  • PDF

Layout Design Problem in Multi-bay Facility (다중 베이 제조시스템의 설비배치)

  • Lee, Moon-Su;Chae, Jun-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.4
    • /
    • pp.93-100
    • /
    • 2009
  • This paper addresses the facility layout problem in multi-bay environments, where the bays are connected at one or both ends by an inter-bay material handling system. In most previous studies, the main concern is to allocate facilities or departments to the bays whose widths are fixed. In this research, we suggest the efficient models that provide the optimal layout solution under flexible bay width environments. We also suggest a mathematical model that provides the optimal solution using two-way facility allocation approach instead of one-way allocation technique. This paper also shows the approach of TABU search to the assignment and layout design of the departments. The results generated from TABU search are compared to the result from the mathematical model. Models are developed using mixed integer programming for various test problems and solved by CPLEX.

Development of penalty dependent pricing strategy for bicycle sharing and relocation of bicycles using trucks

  • Kim, Woong;Kim, Ki-Hong;Lee, Chul-Ung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.6
    • /
    • pp.107-115
    • /
    • 2016
  • In this paper, we propose a Bicycle sharing has grown popular around the cities in the world due to its convenience. However, the bicycle sharing system is not problem-free, and there remains many managerial problems to be solved. In this study, we analyzed pricing strategy of a bicycle sharing system by minimizing the number of bicycles relocated by trucks, the act of which incurs penalty. The objective function is constructed by applying mixed integer programming and is presented as a stochastic model by using Markov chain so that arrival and departure rates of bicycle stations can be utilized in the analysis. The efficiency of the presented model is verified upon the analysis of bicycle sharing data gathered in Daejeon in 2014.

Forecasting Renewable Energy Using Delphi Survey and the Economic Evaluation of Long-Term Generation Mix (델파이 활용 신재생 에너지 수요예측과 장기전원 구성의 경제성 평가)

  • Koo, Hoonyoung;Min, Daiki
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.39 no.3
    • /
    • pp.183-191
    • /
    • 2013
  • We address the power generation mix problem that considers not only nuclear and fossil fuels such as oil, coal and LNG but also renewable energy technologies. Unlike nuclear or other generation technologies, the expansion plan of renewable energy is highly uncertain because of its dependency on the government policy and uncertainty associated with technology improvements. To address this issue, we conduct a delphi survey and forecast the capacity of renewable energy. We further propose a stochastic mixed integer programming model that determines an optimal capacity expansion and the amount of power generation using each generation technology. Using the proposed model, we test eight generation mix scenarios and particularly evaluate how much the expansion of renewable energy contributes to the total costs for power generation in Korea. The evaluation results show that the use of renewable energy incurs additional costs.

Development of models for the prediction of electric power supply-demand and the optimal operation of power plants at iron and steel works

  • Lee, Dae-Sung;Yang, Dae-Ryook;Lee, In-Beum;Chang, Kun-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.106-111
    • /
    • 1992
  • In order to achieve stable and efficient use of energy at iron and steel works, a model for the prediction of supply and demand of electric power system is developed on the basis of the information on operation and particular patterns of electric power consumption. The optimal amount of electric power to be purchased and the optimal fuel allocation for the in-house electric power plants are also obtained by a mixed-integer linear programming(MILP) and a nonlinear programming (NLP) solutions, respectively. The validity and the effectiveness of the proposed model are investigated by several illustrative examples. The simulation results show the satisfactory energy saving by the optimal solution obtained through this research.

  • PDF

A Hybrid Parallel Genetic Algorithm for Reliability Optimal Design of a Series System (직렬시스템의 신뢰도 최적 설계를 위한 Hybrid 병렬 유전자 알고리즘 해법)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.2
    • /
    • pp.48-55
    • /
    • 2010
  • Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.

Development of a Deterministic Optimization Model for Design of an Integrated Utility and Hydrogen Supply Network (유틸리티 네트워크와 수소 공급망 통합 네트워크 설계를 위한 결정론적 최적화 모델 개발)

  • Hwangbo, Soonho;Han, Jeehoon;Lee, In-Beum
    • Korean Chemical Engineering Research
    • /
    • v.52 no.5
    • /
    • pp.603-612
    • /
    • 2014
  • Lots of networks are constructed in a large scale industrial complex. Each network meet their demands through production or transportation of materials which are needed to companies in a network. Network directly produces materials for satisfying demands in a company or purchase form outside due to demand uncertainty, financial factor, and so on. Especially utility network and hydrogen network are typical and major networks in a large scale industrial complex. Many studies have been done mainly with focusing on minimizing the total cost or optimizing the network structure. But, few research tries to make an integrated network model by connecting utility network and hydrogen network In this study, deterministic mixed integer linear programming model is developed for integrating utility network and hydrogen network. Steam Methane Reforming process is necessary for combining two networks. After producing hydrogen from Steam-Methane Reforming process whose raw material is steam vents from utility network, produced hydrogen go into hydrogen network and fulfill own needs. Proposed model can suggest optimized case in integrated network model, optimized blueprint, and calculate optimal total cost. The capability of the proposed model is tested by applying it to Yeosu industrial complex in Korea. Yeosu industrial complex has the one of the biggest petrochemical complex and various papers are based in data of Yeosu industrial complex. From a case study, the integrated network model suggests more optimal conclusions compared with previous results obtained by individually researching utility network and hydrogen network.