The ring/κ-rings network design problem: Model and branch-and-cut algorithm
نویسندگان
چکیده
This article considers the problem of designing a twolevel network where the upper level consists of a backbone ring network connecting the so-called hub nodes, and the lower level is formed by access ring networks that connect the non-hub nodes to the hub nodes. There is a fixed cost for each type of link, and a facility opening cost associated to each hub. The number of nodes in each access ring is bounded, and the number of access rings connected to a hub is limited to κ , thus resulting in a ring/ κ-rings topology. The aim is to decide the hubs to open and to design the backbone and access rings to minimize the installation cost. We propose a mathematical model, give valid inequalities, and describe a branch-and-cut algorithm to solve the problem. Computational results show the algorithm is able to find optimal solutions on instances involving up to 40 nodes within a reasonable time. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(2), 130–14
منابع مشابه
The Capacitated m-Ring-Star Problem
The Capacitated m-Ring-Star Problem (CmRSP) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning each non-visited customer to a visited point or customer. The number of customers visited and assigned to a ring is bounded by an upper limit: the capacity of the ring. The objective is to minimize the to...
متن کاملSolving a mathematical model with multi warehouses and retailers in distribution network by a simulated annealing algorithm
Determination of shipment quantity and distribution problem is an important subject in today’s business. This paper describes the inventory/distribution network design. The system addresses a class of distribution network design problem, which is characterized by multiple products family, multiple warehouses and retail-ers. The maximum capacity of vehicles and warehouses are also known. The res...
متن کاملTwo-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a “ring”) to which each edge belongs, does not exceed a given length K. We identify a class of valid inequalities, called cycle inequalities, valid for the problem and show that this inequalities together with the so-called cut inequalities yield an integ...
متن کاملMathematical Programming Manuscript No. Exact and Heuristic Algorithms for the Design of Survivable Networks with Bounded Rings
We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle whose length does not exceed a given bound. This problem was rst studied by Fortz, Labb e and Maaoli 7]. Several classes of valid inequalities for this problem were proposed 5{7]. We study here the separation problems associated to these inequalities and their integration in a Branch...
متن کاملA New Mathematical Model for a Multi-product Supply Chain Network with a Preventive Maintenance Policy
The supply chain network design (SCND) implicates decision-making at a strategic level and makes it possible to create an effective and helpful context for managing. The aim of the network is to minimize the total cost so that customer's demands should be met. Preventive maintenance is pre-determined work performed to a schedule with the aim of preventing the wear and tear or sudden failure of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 68 شماره
صفحات -
تاریخ انتشار 2016