IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v130y2004i1p217-23910.1023-banor.0000032577.81139.84.html
   My bibliography  Save this article

Solving a Network Design Problem

Author

Listed:
  • Alain Chabrier
  • Emilie Danna
  • Claude Le Pape
  • Laurent Perron

Abstract

Industrial optimization applications must be “robust” i.e., they must provide good solutions to problem instances of different size and numerical characteristics, and continue to work well when side constraints are added. This paper presents a case study that addresses this requirement and its consequences on the applicability of different optimization techniques. An extensive benchmark suite, built on real network design data, is used to test multiple algorithms for robustness against variations in problem size, numerical characteristics, and side constraints. The experimental results illustrate the performance discrepancies that have occurred and how some have been corrected. In the end, the results suggest that we shall remain very humble when assessing the adequacy of a given algorithm for a given problem, and that a new generation of public optimization benchmark suites is needed for the academic community to attack the issue of algorithm robustness as it is encountered in industrial settings. Copyright Kluwer Academic Publishers 2004

Suggested Citation

  • Alain Chabrier & Emilie Danna & Claude Le Pape & Laurent Perron, 2004. "Solving a Network Design Problem," Annals of Operations Research, Springer, vol. 130(1), pages 217-239, August.
    • Handle: RePEc:spr:annopr:v:130:y:2004:i:1:p:217-239:10.1023/b:anor.0000032577.81139.84
    DOI: 10.1023/B:ANOR.0000032577.81139.84
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000032577.81139.84
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000032577.81139.84?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:130:y:2004:i:1:p:217-239:10.1023/b:anor.0000032577.81139.84. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.