• Title/Summary/Keyword: mixed-integer programming

Search Result 389, Processing Time 0.027 seconds

Efficient Provisioning for Multicast Virtual Network under Single Regional Failure in Cloud-based Datacenters

  • Liao, Dan;Sun, Gang;Anand, Vishal;Yu, Hongfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2325-2349
    • /
    • 2014
  • Network virtualization technology plays a key role in cloud computing, which serves as an effective approach for provisioning a flexible and highly adaptable shared substrate network to satisfy the demands of various applications or services. Recently, the problem of mapping a virtual network (VN) onto a substrate network has been addressed by various algorithms. However, these algorithms are typically efficient for unicast service-oriented virtual networks, and generally not applicable to multicast service-oriented virtual networks (MVNs). Furthermore, the survivable MVN mapping (SMVNM) problem that considers the survivability of MVN has not been studied and is also the focus of this work. In this research, we discuss SMVNM problem under regional failures in the substrate network and propose an efficient algorithm for solving this problem. We first propose a framework and formulate the SMVNM problem with the objective of minimizing mapping cost by using mixed integer linear programming. Then we design an efficient heuristic to solve this problem and introduce several optimizations to achieve the better mapping solutions. We validate and evaluate our framework and algorithms by conducting extensive simulations on different realistic networks under various scenarios, and by comparing with existing approaches. Our simulation experiments and results show that our approach outperforms existing solutions.

Development of Part Sales Agent Coupled with Virtual Manufacturing in Internet Environment (인터넷상의 가상생산 기반 부품판매 에이전트 개발)

  • Choi, Hyung-Rim;Kim, Hyun-Soo;Park, Young-Jae;Park, Byoung-Joo;Lee, Kyoung-Jun
    • Asia pacific journal of information systems
    • /
    • v.12 no.4
    • /
    • pp.193-213
    • /
    • 2002
  • The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, negotiation, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. Recently, Internet based Electronic Commerce is recognized as one of the alternatives for strengthening sales power of small and medium companies. However, small and medium manufacturers can't adjust properly to the new environment because they are in short of money, personnel, and technology. To cope with this problem, this paper deals with development of part sales agent coupled with virtual manufacturing in Internet environment that consist of selection agent, advertisement agent, selection agent, negotiation agent, and virtual manufacturing system. This paper develops a time-bounded negotiation mechanism for small and medium manufacturers in agent-based automated negotiation between customers and negotiation agents. Furthermore, to select optimal order set maximized profit, we first formulate the order selection problem with mixed integer programming, but the computation time of IP is not acceptable for real world scale problem. To overcome this problem and dynamic nature of virtual manufacturing, we suggest a genetic algorithm approach, which shows a reasonable computation time for real world case and good incremental problem solving capability.

A Heuristic for parallel Machine Scheduling Depending on Job Characteristics (작업의 특성에 종속되는 병렬기계의 일정계획을 위한 발견적 기법)

  • 이동현;이경근;김재균;박창권;장길상
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.17 no.1
    • /
    • pp.41-41
    • /
    • 1992
  • In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

Optimization of Energy Distribution in District Heating Systems (지역 냉난방 시스템의 에너지 분배 최적화)

  • Park, Tae Chang;Kim, Ui Sik;Kim, Lae-Hyun;Kim, Weon Ho;Kim, Seong Jin;Yeo, Yeong Koo
    • Korean Chemical Engineering Research
    • /
    • v.47 no.1
    • /
    • pp.119-126
    • /
    • 2009
  • A district energy system plays very important role to fulfill energy demand in regional areas. This paper diagnoses the necessity of the development of an economical operation system for the efficient operation of district energy plants located in Seoul. The effect anticipated from the use of the optimal operation system is also analyzed. Production and consumption of energy are estimated for the district energy plants at Suseo, Bundang, Ilwon and Jungang located near in Seoul, Korea. The problem is formulated as a mixed integer linear programming(MILP) problem where the objective is to minimize the overall cost of the district energy system. From the results of numerical simulations we can see that the energy efficiency is improved due to the application of the optimal operation conditions provided by the proposed model.

Virtual Network Embedding through Security Risk Awareness and Optimization

  • Gong, Shuiqing;Chen, Jing;Huang, Conghui;Zhu, Qingchao;Zhao, Siyi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2892-2913
    • /
    • 2016
  • Network virtualization promises to play a dominant role in shaping the future Internet by overcoming the Internet ossification problem. However, due to the injecting of additional virtualization layers into the network architecture, several new security risks are introduced by the network virtualization. Although traditional protection mechanisms can help in virtualized environment, they are not guaranteed to be successful and may incur high security overheads. By performing the virtual network (VN) embedding in a security-aware way, the risks exposed to both the virtual and substrate networks can be minimized, and the additional techniques adopted to enhance the security of the networks can be reduced. Unfortunately, existing embedding algorithms largely ignore the widespread security risks, making their applicability in a realistic environment rather doubtful. In this paper, we attempt to address the security risks by integrating the security factors into the VN embedding. We first abstract the security requirements and the protection mechanisms as numerical concept of security demands and security levels, and the corresponding security constraints are introduced into the VN embedding. Based on the abstraction, we develop three security-risky modes to model various levels of risky conditions in the virtualized environment, aiming at enabling a more flexible VN embedding. Then, we present a mixed integer linear programming formulation for the VN embedding problem in different security-risky modes. Moreover, we design three heuristic embedding algorithms to solve this problem, which are all based on the same proposed node-ranking approach to quantify the embedding potential of each substrate node and adopt the k-shortest path algorithm to map virtual links. Simulation results demonstrate the effectiveness and efficiency of our algorithms.

Genetic Algorithm based Resource Management for Cognitive Mesh Networks with Real-time and Non-real-time Services

  • Shan, Hangguan;Ye, Ziyun;Bi, Yuanguo;Huang, Aiping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2774-2796
    • /
    • 2015
  • Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

Radio Resource Management of CoMP System in HetNet under Power and Backhaul Constraints

  • Yu, Jia;Wu, Shaohua;Lin, Xiaodong;Zhang, Qinyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3876-3895
    • /
    • 2014
  • Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

Two-Agent Single-Machine Scheduling with Linear Job-Dependent Position-Based Learning Effects (작업 종속 및 위치기반 선형학습효과를 갖는 2-에이전트 단일기계 스케줄링)

  • Choi, Jin Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.169-180
    • /
    • 2015
  • Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

Installation Scheduling for the Development of Southwest Coast 2.5GW Offshore Wind Farm (서남해안 2.5GW 해상풍력단지 조성을 위한 설치 일정계획)

  • Ko, Hyun-Jeung
    • Journal of Korea Port Economic Association
    • /
    • v.33 no.2
    • /
    • pp.83-96
    • /
    • 2017
  • As a way to address global warming, among the renewable energy sources, there have been heavy investments worldwide for the development of offshore wind farms. However, such development has a drawback: investment costs are higher than those for onshore wind farms due to required operations such as offshore transportation and installation. In particular, delays in installation due to adverse maritime weather conditions are factors that affect the economics of offshore wind farms' operation. Therefore, in this study, we analyze the optimal schedule of the construction of an offshore wind farm from a macro perspective by considering the weather conditions in Korea. For this purpose, we develop a mathematical model and apply it to a 2.5 GW offshore wind farm project on the southwestern coast of the country. We use data from the Korea Meteorological Agency for maritime weather conditions and attempt to reflect the actual input data based on precedent cases overseas. The results show that it takes 6 months to install 35 offshore wind turbines. More specifically, it is pointed out that it is possible to minimize costs by not working in winter.

Advanced Time-Cost Trade-Off Model using Mixed Integer Programming (혼합정수 프로그래밍 기법을 이용한 진보된 Time-Cost Trade-Off Model)

  • Kwon, Obin;Lee, Seunghyun;Son, Jaeho
    • Korean Journal of Construction Engineering and Management
    • /
    • v.16 no.6
    • /
    • pp.53-62
    • /
    • 2015
  • Time-Cost Trade-Off (TCTO) model is an important model in the construction project planning and control area. Two types of Existing TCTO model, continuous and discrete TCTO model, have been developed by researchers. However, Using only one type of model has a limitation to represent a realistic crash scenario of activities in the project. Thus, this paper presents a comprehensive TCTO model that combines a continuous and discrete model. Additional advanced features for non-linear relationship, incentive, and liquidated damage are included in the TCTO model. These features make the proposed model more applicable to the construction project. One CPM network with 6 activities is used to explain the proposed model. The model found an optimal schedule for the example to satisfy all the constraints. The results show that new model can represent more flexible crash scenario in TCTO model.