Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design

@article{Ghamlouche2004PathRC,
  title={Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design},
  author={Ilfat Ghamlouche and Teodor Gabriel Crainic and Michel Gendreau},
  journal={Annals OR},
  year={2004},
  volume={131},
  pages={109-133}
}
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 that the path relinking procedure offers excellent results. It systematically outperforms the cycle-based… CONTINUE READING