Algorithms for the non-bifurcated network design problem

  • Authors:
  • Enrico Bartolini;Aristide Mingozzi

  • Affiliations:
  • Department of Computer Science, University of Bologna, Bologna, Italy;Department of Mathematics, University of Bologna, Bologna, Italy

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider the non-bifurcated network design problem where a given set of cities must be connected by installing on a given set of links integer multiples of some base capacity so that a set of commodity demands can be routed. Each commodity flow is constrained to run through a single path along the network. The objective is to minimize the sum of capacity installation and routing costs. We present an exact algorithm and four new heuristics. The first heuristic generates an initial feasible solution, then it improves it until a necessary condition for optimality is satisfied. Two heuristics are partial enumeration methods and the last one iteratively applies a tabu search method to different initial feasible solutions. Computational results over a set of test problems from the literature show the effectiveness of the proposed algorithms.