A branch & cut algorithm for the windy general routing problem and special cases

  • Authors:

  • Angel Corberán;Isaac Plana;José M. Sanchis

  • Affiliations:

  • DEIO, Universitat de València, Dr. Moliner 50, 46100 Burjassot, Valencia, Spain;DEIO, Universitat de València, Dr. Moliner 50, 46100 Burjassot, Valencia, Spain;DMA, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022 Valencia, Spain

  • Venue:
  • Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real-life applications. The Branch & Cut method presented here is based on a cutting-plane algorithm that identifies violated inequalities of several classes of facet-inducing inequalities for the corresponding polyhedron. The whole procedure has been tested over different sets of instances and is capable of solving to optimality large-size instances of several routing problems defined on undirected, mixed, and windy graphs. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 49(4), 245–257 2007