In this paper, we propose a method based on learning mechanisms to address the fixed charge capacitated multicommodity network design problem. Learning mechanisms are applied on each solution to extract meaningful fragments to build a pattern solution. Cycle-based neighborhoods are used both to generate solutions and to move along a path leading to the pattern solution by a tabu-like local sear...

This paper addresses the multicommodity capacitated fixed-charge network design problem with nonbifurcated flows and hop constraints. We present and compare mathematical programming formulations for this problem and we study different relaxations: linear programming relaxations, Lagrangean relaxations and partial relaxations of the integrality constraints. In particular, for the hop-indexed for...

Survivability refers to keeping a system partially or fully operational when one or more of its components fail. Survivability in telecommunication networks is crucial, as failure of a network component can potentially bring down the whole communication network, as happened in some real-world cases. Adding redundant network components increases the survivability of a network, but cost of the ne...

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...

In this paper, we propose a path relinking procedure for the fixed-charge capacitated multicommodity network design problem. Cycle-based neighbourhoods are used both to move along path between elite solutions and to generate the elite candidate set by a tabu-like local search procedure. Several variants of the method are implemented and compared. Extensive computational experiments indicate tha...

The multicommodity capacitated fixed charge network design problem is a well-known NPhard problem which arises in a wide variety of applications, most notably in transportation and telecommunications. In this paper, we propose to improve the mixed integer programming (MIP) formulation of the problem by using a polyhedral approach. We present a cutting-plane algorithm which incorporates valid in...

The fixed charge capacitated multicommodity network design problem is a well-known problem, of both practical and theoretical significance. This paper presents an efficient procedure to determine tight upper bounds on the optimal solution of realistically sized problem instances. Feasible solutions are obtained by using a tabu search framework that explores the space of the continuous flow vari...

This paper describes a slope scaling heuristic for solving the multicomodity capacitated fixed-charge network design problem. The heuristic integrates a Lagrangean perturbation scheme and intensification/diversification mechanisms based on a long-term memory. Although the impact of the Lagrangean perturbation mechanism on the performance of the method is minor, the intensification/diversificati...

Service network design involves determination of the most cost-effective transportation network and service characteristics subject to various constraints. Good progress has been made in developing metaheuristic approaches that can compete or even outperform some commercial software packages (Ghamlouche et al 2004; Pedersen et al 2009). However, since most of these metaheuristic methods involve...