Capacitated Network Design - Polyhedral Structure and Computation
نویسندگان
چکیده
We study a capacity expansion problem that arises in telecommunication network design. Given a capacitated network and a traac demand matrix, the objective is to add capacity to the edges, in modularityes of various modularities, and route traac, so that the overall cost is minimized. We study the polyhedral structure of a mixed-integer formulation of the problem and develop a cutting-plane algorithm using facet deening inequalities. The algorithm produces an extended formulation providing both a very good lower bound and a starting point for branch and bound. The overall algorithm appears eeective when applied to problem instances using real-life data.
منابع مشابه
Capacitated Multimodal Structure of a Green Supply Chain Network Considering Multiple Objectives
In this paper, a supply chain network design problem is explained which contains environmental concerns in arcs and nodes of network. It is assumed that there are some routes such as road, rail and etc. in each pair of nodes. In this model decision variables are choosing facilities to open, environmental investment level in each facility and flow of products between nodes in each route. A multi...
متن کاملReliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm
We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملOn the strength of cut-based inequalities for capacitated network design polyhedra
In this paper we study capacitated network design problems, differentiating directed, bidirected and undirected link capacity models. We complement existing polyhedral results for the three variants by new classes of facet-defining valid inequalities and unified lifting results. For this, we study the restriction of the problems to a cut of the network. First, we show that facets of the resulti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 8 شماره
صفحات -
تاریخ انتشار 1996