Case-based reasoning for repetitive combinatorial optimization problems, part I: Framework

This article presents a case-based reasoning approach for the development of learning heuristics for solving repetitive operations research problems. We first define the subset of problems we will consider in this work: repetitive combinatorial optimization problems. We then present several general forms that can be used to select previously solved problems that might aid in the solution of the current problem, and several different techniques for actually using this information to derive a solution for the current problem. We describe both fixed forms and forms that have the ability to change as we solve more problems. A simple example for the 0–1 knapsack problem is presented.

[1]  D. E. Rumelhart,et al.  chapter Parallel Distributed Processing, Exploration in the Microstructure of Cognition , 1986 .

[2]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[3]  Thomas G. Dietterich,et al.  Readings in Machine Learning , 1991 .

[4]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[5]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[6]  A. Frieze,et al.  Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses , 1984 .

[7]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[9]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[10]  Christopher K. Riesbeck,et al.  Inside Case-Based Reasoning , 1989 .

[11]  Gregg Clinton Collins,et al.  Plan creation: using strategies as blueprints , 1987 .

[12]  John Daniel. Bagley,et al.  The behavior of adaptive systems which employ genetic and correlation algorithms : technical report , 1967 .

[13]  David Russell Kraay.  LEARNING HEURISTICS FOR REPETITIVE COMBINATORIAL OPTIMIZATION PROBLEMS, WITH AN APPLICATION IN TRAIN SCHEDULING. , 1993 .

[14]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .

[15]  William Bain.  Case-based reasoning: a computer model of subjective assessment , 1986 .

[16]  D. Bertsimas.  Probabilistic combinatorial optimization problems , 1988 .

[17]  P. Thagard,et al.  Explanatory coherence , 1993 .

[18]  Robert Fourer,et al.  Modeling languages versus matrix generators for linear programming , 1983, TOMS.

[19]  Kristian J. Hammond,et al.  Case-Based Planning: Viewing Planning as a Memory Task , 1989 .

[20]  Darwin Klingman,et al.  A network-related nuclear power plant model with an intelligent branch-and-bound solution approach , 1990 .

[21]  John J. Grefenstette,et al.  Genetic Search with Approximate Function Evaluation , 1985, ICGA.

[22]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[23]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[24]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[25]  Alok R. Chaturvedi,et al.  Acquiring implicit knowledge in a complex domain , 1993 .

[26]  Donald A. Waterman,et al.  A Guide to Expert Systems , 1986 .

[27]  K. Dudzinski,et al.  Exact methods for the knapsack problem and its generalizations , 1987 .

[28]  Hemant K. Bhargava,et al.  On embedded languages for model management , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.

[29]  Kevin D. Ashley,et al.  Hypotheticals as Heuristic Device , 1986, HLT.

[30]  Paul Juell,et al.  Neural Networks for Selective Vehicle Routing Heuristics , 1990, INFORMS J. Comput..

[31]  James L. McClelland,et al.  Explorations in parallel distributed processing: a handbook of models, programs, and exercises , 1988 .

[32]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[33]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[34]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[35]  Hemant K. Bhargava,et al.  A formal approach for model formulation in a model management system , 1990, Twenty-Third Annual Hawaii International Conference on System Sciences.