Skip to main content

Integrating case based reasoning and tabu search for solving optimisation problems

  • Poster Sessions
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1010))

Abstract

Tabu search is an established heuristic optimisation technique for problems where exact algorithms are not available. It belongs to the same family as simulated annealing or genetic algorithms. It extends the basic iterative improvement scheme by adding control learning. A technique of this kind, intensification, captures experience established on a frequency-based analysis of past search. Experience is reused while the same optimisation process is going on in order to guide search to better solutions.

In this paper, we introduce a case-based reasoning approach for control learning in tabu search. Search experience concerns operator selection and is represented by cases. The aim of case reuse is to improve conflict resolution. While the proposed method is domain independent, we present its application to the NP-hard uncapacitated facility location problem. Experimental results show that adding our approach to a basic tabu search optimisation significantly improves solution quality on the evaluated benchmark problems. It reduces the gap to the optimal solution by a factor of nearly 2.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Battiti R., Tecchiolli G., The Reactive Tabu Search, ORSA Journal on Computing 6, 1994, p. 126–40

    Google Scholar 

  2. Beasley J.E., OR-Library: Distributing Test Problems by Electronic Mail, Journal of the Operations Research Society 41, 1990, p. 1069–72

    Google Scholar 

  3. Beasley J.E., Lagrangien heuristics for location problems, European Journal of Operational Research 65, 1993, p. 383–99

    Google Scholar 

  4. Bunke H., Messmer B., Similarity Measures for Structured Representations, First European Workshop on Case-Based Reasoning, 1993

    Google Scholar 

  5. Bisson G., Learning in FOL with a Similarity Measure, AAAI, 1992, p. 82–7

    Google Scholar 

  6. Crainic T., Gendreau M., Soriano P., Toulouse M., A tabu search procedure for multicommodity location/allocation with balancing requirements, Annals of Operations Research 42 (1–4), 1993, p. 359–83

    Google Scholar 

  7. Glover F., Tabu Search — Part 1, ORSA J. on Computing 1 (3), 1989, p. 190–206

    Google Scholar 

  8. Glover F., Tabu Search — Part 2, ORSA J. on Computing 2 (1), 1990, p. 4–32

    Google Scholar 

  9. Grolimund S., Ganascia J.G., A Case-Based Reasoning Approach to Knowledge Transfer in Tabu Search, Tech. Rep. 94/06, University Paris 6, Laforia — IBP, France, 1994

    Google Scholar 

  10. Grolimund S., Ganascia J.G., Case Based Reasoning and Tabu Search for the Single Machine Scheduling Problem: First Results, Tech. Rep., University Paris 6, Laforia — IBP, 1995

    Google Scholar 

  11. Hammond K., CHEF: A model of case-based planning, AAAI, 1986

    Google Scholar 

  12. Hansen P., Pedrosa E., Ribeiro C., Location and sizing of offshore platforms for oil exploration, European Journal of Operational Research 58, 1992, p. 202–14

    Google Scholar 

  13. Kolodner J., Case-Based Reasoning, Morgan Kaufmann, 1993

    Google Scholar 

  14. Michalski R.S., A Theory and Methodology of Inductive Learning, in: Machine Learning: An Artificial Intelligence Approach, Tioga, Palo Alto, 1983

    Google Scholar 

  15. Minoux M., Mathematical Programming, Morgan Kaufmann, 1989

    Google Scholar 

  16. Minton S., Learning Search Control Knowledge: An Explanation-Based Approach, Kluwer Academic Press, Boston, 1989

    Google Scholar 

  17. Mirchandani P., Francis R. (eds.), Discrete Location Theory, Wiley, 1990

    Google Scholar 

  18. Mitchell T., Learning and problem solving, IJCAI, 1983, p. 1140–51

    Google Scholar 

  19. Reeves C., Modern Heuristic Techniques for Combinatorial Problems, Blackwell, 1993

    Google Scholar 

  20. Ruby D., Kibler D., Learning Episodes for Optimization, ICML, 1992, p. 279–84

    Google Scholar 

  21. Sycara K., Miyashita K., Case-based acquisition of User Preferences for Solution Improvement in Ill-Structured Domains, AAAI, 1994, p. 44–9

    Google Scholar 

  22. Veloso M., Learning by analogical reasoning in general problem solving, Ph.D. thesis, Carnegie Mellon University, Pittsburgh, 1992

    Google Scholar 

  23. Woodruff D., Proposal for Chunking and Tabu Search, Tech. Rep., University of California Davis, Dec. 1994

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Manuela Veloso Agnar Aamodt

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grolimund, S., Ganascia, JG. (1995). Integrating case based reasoning and tabu search for solving optimisation problems. In: Veloso, M., Aamodt, A. (eds) Case-Based Reasoning Research and Development. ICCBR 1995. Lecture Notes in Computer Science, vol 1010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60598-3_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-60598-3_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60598-0

  • Online ISBN: 978-3-540-48446-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics