Network design has been an important issue in logistics during the last century. This is due to the significant impact that an efficient distribution network design can have over both costs and service level. In this article, we present a heuristic solution approach for the well-known capacitated multicommodity network flow problem. The heuristic approach combines two well-known algorithms name...

Designing a SAN fabric involves finding a network of hubs, switches and links to connect hosts to their storage devices. The network must be capable of simultaneously meeting the data flow requirements between multiple host-device pairs, and it must do so cost-effectively, since large-scale SAN fabrics can cost millions of dollars. Moreover, the network must be robust to failures of fabric elem...

The Ring Loading Problem is an optimal routing problem arising in the planning of optical communication networks which use bidirectional SONET rings. In mathematical terms, it is an unsplittable multicommodity flow problem on undirected ring networks. We prove that any split routing solution to the Ring Loading Problem can be turned into an unsplittable solution while increasing the load on any...

Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme r...

This paper addresses the capacitated multicommodity fixed-charge network design problem, a particular case of the broad class network design problems. To identify good quality solutions, we propose a matheuristic combining an exact MIP method and a Tabu search meta-heuristic. A new arc-balanced cycle procedure for generating neighboring solutions is introduced. To assess the quality of the solu...

The goal of this paper is to study a profit-maximization location-inventory problem in a multicommodity supply chain distribution network with price-sensitive demands. The problem determines location, allocation, price and order-size decisions in order to maximize the total profit of serving the customers. The problem is formulated as a mixed-integer nonlinear programming model and solved using...

We consider a network design problem that arises in the costoptimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem We refer to it as the Capacitated Con...