Skip to main content
SpringerLink
Log in

Case-Based Reasoning for Repetitive Combinatorial Optimization Problems, Part II: Numerical Results

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper presents numerical results from the application of a case-based reasoning approach to several repetitive operations research problems. These experiments are applications of the ideas presented in the previous framework paper, Part I. The three combinatorial optimization problems explored in this paper are the knapsack problem, the travelling salesman problem and the uncapacitated plant location problem. These numerical experiments permit a comparison of the performance of this technique across these three problem classes as well as with the traditional solution algorithms.

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

  • Dongarra, J.J. (1992). “Performance of Various Computers Using Standard Linear Equations Software.” Oak Ridge National Laboratory and University of Tennessee.

  • Dudzinski, K. and S. Walukiewicz. (1987). “Exact Methods for the Knapsack Problem and its Generalizations.” European Journal of Operational Research 28, 3–21.

    Google Scholar 

  • Erlenkotter, D. (1978). “A Dual-Based Procedure for Uncapacitated Facility Location.” Operations Research 26, 992–1069.

    Google Scholar 

  • Fayard, D. and G. Plateau. (1982). “An Algorithm for the Solution of the 0-1 Knapsack Problem.” Computing 28, 269–287.

    Google Scholar 

  • Kraay, D.R. and P.T. Harker. (1996). “Case-Based Reasoning for Repetitive Combinatorial Optimization Problems, Part I: Framework.” Journal of Heuristics 2, 55–85.

    Google Scholar 

  • Lawler, E.L. et al. (eds.), (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York: John Wiley & Sons.

    Google Scholar 

  • Nemhauser, G.L. and Wolsey, L.A. (1988). Integer and Combinatorial Optimization. New York: John Wiley & Sons.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Operations Research, US Airways, 2345 Crystal Dr., Arlington, VA, 22227

    David R. Kraay

  2. Department of Operations and Information Management, The Wharton School, University of Pennsylvania, Philadelphia, PA, 19104-6366

    Patrick T. Harker

Authors
  1. David R. Kraay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick T. Harker
    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

Kraay, D.R., Harker, P.T. Case-Based Reasoning for Repetitive Combinatorial Optimization Problems, Part II: Numerical Results. Journal of Heuristics 3, 25–42 (1997). https://doi.org/10.1023/A:1009620815820

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009620815820

Search

Navigation