Skip to main content
SpringerLink
Log in

Solving a Network Design Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Beck, J.C. and L. Perron. (2000). “Discrepancy-Bounded Depth First Search.” In Proceedings of CP-AI-OR 2000.

  • Bernhard, R., J. Chambon, C. Le Pape, L. Perron, and J.-C. Régin. (2002). “Résolution d'un problème de conception de réseau avec Parallel Solver.” In Proceedings of JFPLC. (In French.)

  • Bienstock, D. and O. Günlük. (1996). “Capacitated Network Design: Polyhedral Structure and Computation.” ORSA Journal 8, 243–260.

    Google Scholar 

  • Chabrier, A. (2003). “Heuristic Branch-and-Price-and-Cut to Solve a Network Design Problem.” In Proceedings of CPAIOR 2003.

  • Danna, E., E. Rothberg, and C. Le Pape. (2003). “Exploring Relaxation Induced Neighborhoods to Improve MIP Solutions.” Technical Report, ILOG.

  • Fischetti, M. and A. Lodi. (2002). “Local Branching.” In Proceedings of the Integer Programming Conference in Honor of Egon Balas.

  • Gabrel, V., A. Knippel, and M. Minoux. (1999). “Exact Solution of Multicommodity Network Optimization Problems with General Step Cost Functions.” Operations Research Letters 25, 15–23.

    Google Scholar 

  • Gomes, C.P. and B. Selman. (1997). “Algorithm Portfolio Design: Theory vs. Practice.” In Proceedings of the 13th Conference On Uncertainty in Artificial Intelligence (UAI-97). New Providence, RI: Morgan Kaufmann.

    Google Scholar 

  • Gondran, M. and M. Minoux. (1995). Graphes et algorithmes. Eyrolles.

  • ILOG. (2001). “ILOG CPLEX 7.5 User's Manual and Reference Manual.” ILOG, S.A.

  • Perron, L. (1999). “Search Procedures and Parallelism in Constraint Programming.” In J. Jaffar (ed.), Proceedings of CP'99, pp. 346–360. Berlin: Springer.

    Google Scholar 

  • Perron, L. (2002). “Practical Parallelism in Constraint Programming.” In Proceedings of CP-AI-OR 2002, pp. 261–276.

  • Perron, L. (2003). “Fast Restart Policies and Large Neighborhood Search.” In Proceedings of CPAIOR 2003.

  • Rothlauf, F., D.E. Goldberg, and A. Heinzl. (2002). “Network Random Keys: A Tree Representation Scheme for Genetic and Evolutionary Algorithms.” Evolutionary Computation 10(1), 75–97.

    Google Scholar 

  • Shaw, P. (1998). “Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems.” In M. Maher and J.-F. Puget (eds.), Proceedings of CP'98, pp. 417–431. Berlin: Springer.

    Google Scholar 

  • Shaw, P., V. Furnon, and B. De Backer. (2000). “A Lightweight Addition to CP Frameworks for Improved Local Search.” In U. Junker, S.E. Karisch, and T. Fahle (eds.), Proceedings of CP-AI-OR 2000.

  • Shaw, P., V. Furnon, and B. De Backer. (2002). “A Constraint Programming Toolkit for Local Search.” In S. Voss and D. L. Woodruff (eds.), Optimization Software Class Libraries, pp. 219–262. Dordrecht: Kluwer Academic.

    Google Scholar 

  • ILOG. (2002). “ILOG Solver 5.3 User's Manual and Reference Manual.” ILOG, S.A.

Download references

Author information

Authors and Affiliations

  1. ILOG Spain, Gobelas 21, 28023, Madrid, Spain

    Alain Chabrier

  2. ILOG SA, 9 rue de Verdun, F-94253, Gentilly Cedex, France

    Emilie Danna, Emilie Danna, Claude Le Pape & Laurent Perron

Authors
  1. Alain Chabrier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emilie Danna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Claude Le Pape
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Laurent Perron
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chabrier, A., Danna, E., Le Pape, C. et al. Solving a Network Design Problem. Annals of Operations Research 130, 217–239 (2004). https://doi.org/10.1023/B:ANOR.0000032577.81139.84

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:ANOR.0000032577.81139.84

Search

Navigation