Bounds and Heuristics for the Shortest Capacitated Paths Problem

Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying capacity constraints on the arcs of G. We formulate the SCPP as a 0-1 linear program and study two Lagrangian relaxations for getting lower bounds on the optimal value. We then propose two heuristic methods. The first one is based on a greedy approach, while the second one is an adaptation of the tabu search meta-heuristic. Key Words: minimum cost integer multicommodity flow problem, bandwidth packing problem, Lagrangian relaxation, tabu search

• Type: Journal
• Year: 2002
• Where: HEURISTICS
• Authors: Marie-Christine Costa, Alain Hertz, Michel Mittaz
• Keywords: 0-1 Linear Program, HEURISTICS 2002, Lagrangian Relaxation, Tabu Search