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

Ilfat Ghamlouche (), Teodor Crainic () and Michel Gendreau ()

Annals of Operations Research, 2004, vol. 131, issue 1, 109-133

Abstract: 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 paths 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 tabu search method in both solution quality and computational effort and offers the best current meta-heuristic for this difficult class of problems. Copyright Kluwer Academic Publishers 2004

Keywords: path relinking; tabu search; fixed-charge capacitated multicommodity network design; meta-heuristics; cycle-based neighbourhoods (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://hdl.handle.net/10.1023/B:ANOR.0000039515.90453.1d (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:131:y:2004:i:1:p:109-133:10.1023/b:anor.0000039515.90453.1d

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/B:ANOR.0000039515.90453.1d

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().