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

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

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)
    • /
    • 제8권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)

  • 최형림;김현수;박영재;박병주;이경전
    • Asia pacific journal of information systems
    • /
    • 제12권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)

  • 이동현;이경근;김재균;박창권;장길상
    • 한국경영과학회지
    • /
    • 제17권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)

  • 박태창;김의식;김래현;김원호;김진성;여영구
    • Korean Chemical Engineering Research
    • /
    • 제47권1호
    • /
    • pp.119-126
    • /
    • 2009
  • 지역 냉난방 시스템은 각 지역에 열 수요를 충족시키는데 중요한 역할을 한다. 본 논문에서는 수도권 지역난방 연계 지사간의 효율적인 운전을 위한 경제적 운전 프로그램 개발의 필요성을 진단하고 이를 활용할 경우의 예상효과를 분석하였다. 분석대상 지역난방 지사로서는 수도권 지역난방 공급 네트워크로 연계되어 있는 지사들 가운데에서 수서지역을 중심으로 주변의 분당, 일원, 중앙지역을 분석대상 지사들로 선정하여 각 지역의 열 생산량과 열 수요량을 측정하였다. 지역 냉난방 시스템의 운전비용이 최소가 되도록 하는 최적화 시스템의 구성에는 MILP 알고리듬이 이용되었다. 최적화 계산 결과를 토대로 지역간 연계 수열량과 공급비용을 예측하고 모델로부터 계산된 값을 통해 경제성을 분석하였다.

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)
    • /
    • 제10권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)
    • /
    • 제9권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)
    • /
    • 제8권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.

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

  • 최진영
    • 산업경영시스템학회지
    • /
    • 제38권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.

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

  • 고현정
    • 한국항만경제학회지
    • /
    • 제33권2호
    • /
    • pp.83-96
    • /
    • 2017
  • 지구 온난화에 대처하는 일환으로 신재생에너지 가운데 세계 각국은 해상풍력단지 개발에 투자를 집중하고 있다. 그러나 해상풍력단지 개발은 해상에서의 구조물 운송, 설치 등의 해상작업이 요구됨에 따라 투자비용이 육상풍력단지 보다 높은 단점이 있다. 특히 해상기상 여건으로 인한 설치기간 지연은 해상풍력단지 운영의 경제성에도 영향을 끼치는 요소이다. 따라서 본 연구에서는 국내 해상의 기상여건을 고려하여 해상풍력단지 조성의 최적 일정계획을 거시적 측면에서 분석하고자 하였다. 이를 위해 수리적 모델을 개발하였고, 이를 이용하여 국내 서남해안 2.5GW 해상풍력단지 조성사업에 적용하였다. 해상 기상여건은 기상청의 자료를 활용하였고, 모델에 사용된 입력 자료는 해외의 선행 사례를 바탕으로 현실성을 최대한 반영하고자 하였다. 그 결과 해상풍력터빈 35기를 설치하는데 6개월이 소요되는 것으로 분석되었다. 특히 겨울을 피하여 작업하는 것이 비용을 최소화할 수 있는 것으로 분석되었다.

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

  • 권오빈;이승현;손재호
    • 한국건설관리학회논문집
    • /
    • 제16권6호
    • /
    • pp.53-62
    • /
    • 2015
  • 공기비용 트레이드오프 모델은 건설프로젝트의 계획 및 관리에 있어 매우 중요하다. TCTO 모델은 연속모델과 분절모델 두 가지 모델이 개발되어왔다. 그러나 한 종류의 모델만을 사용하여 현실적인 공기단축 시나리오를 적용하기에는 한계가 있다. 이에 TCTO 의 연속적인 모델과, 분절모델을 결합하여 진보된 모델을 제시하였으며 또한, 비선형 관계, 인센티브 및 지체보상금 고려가 가능하도록 TCTO모델에 포함되어 있다. 이런 특성들은 건설프로젝트에 적용가능하다. 6개의 activities로 구성된 CPM 네트워크는 연구에서 제안된 모델을 설명하기 위해 사용되었다. 제시한 모델은 모든 제약 조건을 만족시키는 최적 스케쥴 계산이 가능하다. 결과적으로 본 연구에서 제시한 진보된 TCTO모델은 기존의 모델보다 최적화된 공기단축이 가능하다.