A Tabu Search Algorithm for Unsplittable Capacitated Network Design

The Multicommodity Capacitated Network Design (MCND) problems with splittable flow variables are NP-hard, and with binary flow variables or unsplittable MCND, the complexity of the problems are increased significantly. Metaheuristics are the solution methods that can be developed to solve these problems efficiently. This paper presents a Tabu Search approach for unsplittable MCND problem. In the proposed solution method, an innovative representation and neighborhood structure are presented