Skip to main content

iOpt: A Software Toolkit for Heuristic Search Methods

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2239)

Abstract

Heuristic Search techniques are known for their efficiency and effectiveness in solving NP-Hard problems. However, there has been limited success so far in constructing a software toolkit which is dedicated to these methods and can fully support all the stages and aspects of researching and developing a system based on these techniques. Some of the reasons for that include the lack of problem modelling facilities and domain specific frameworks which specifically suit the operations of heuristic search, tedious code optimisations which are often required to achieve efficient implementations of these methods, and the large number of available algorithms - both local search and population-based - which make it difficult to implement and evaluate a range of techniques to find the most efficient one for the problem at hand. The iOpt Toolkit, presented in this article, attempts to address these issues by providing problem modelling facilities well-matched to heuristic search operations, a generic framework for developing scheduling applications, and a logically structured heuristic search framework allowing the synthesis and evaluation of a variety of algorithms. In addition to these, the toolkit incorporates interactive graphical components for the visualisation of problem and scheduling models, and also for monitoring the run-time behaviour and configuring the parameters of heuristic search algorithms.

Keywords

  • Schedule Problem
  • Heuristic Search
  • Constraint Programming
  • Priority Queue
  • Graph Colouring

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-45578-7_58
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-45578-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   189.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P. F., and Zadeck, F.K., Incremental evaluation of computational circuits. In ACM SIGACT-SIAM’89 Conference on Discrete Algorithms, pp. 32–42, 1990.

    Google Scholar 

  2. Andreatta, A., Carvalho, S., and Ribeiro, C., An Object-Oriented Framework for Local Search Heuristics, 26th Conference on Technology of Object-Oriented Languages and Systems (TOOLS USA’98), IEEE Press, 33–45, 1998.

    Google Scholar 

  3. Dorne, R, and Voudouris, C., HSF: A generic framework to easily design Meta-Heuristic methods, 4th Metaheuristics International Conference (MIC’ 2001), Porto, Portugal, 423–428, 2001.

    Google Scholar 

  4. Fink, A., Voß, S., Woodruff, D., Building Reusable Software Components for Heuristic Search, In: P. Kall, H.-J. Lüthi (Eds.), Operations Research Proceedings 1998, Springer, Berlin, 210–219, 1999.

    Google Scholar 

  5. Fukunaga, A., Rabideau, G., Chien, S., and Yan, D., Toward an Application Framework for Automated Planning and Scheduling, Proceedings of the 1997 International Symposium on Artificial Intelligence, Robotics and Automation for Space, Tokyo, Japan, July 1997.

    Google Scholar 

  6. Hoover, R., Incremental Graph Evaluation. PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY, 1987.

    Google Scholar 

  7. Hudson, S., Incremental Attribute Evaluation: A Flexible Algorithm for Lazy Update, ACM Transactions on Programming Languages and Systems, Vol.13, No. 3, pp. 315–341, July 1991.

    CrossRef  Google Scholar 

  8. Jones, M., McKeown, G, Raywar-Smith, V., Templar: An Object Oriented Framework for Distributed Combinatorial Optimization, UNICOM Seminar on Modern Heuristics for Decision Support, London, 7 December, 1998.

    Google Scholar 

  9. Le Pape, C., Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems, Intelligent Systems Engineering, 3(2):55–66, 1994.

    CrossRef  Google Scholar 

  10. Michel, L. and Van Hentenryck, P., Localizer, Tech Report CS-98-02, Brown University, March 1998.

    Google Scholar 

  11. Michel, L. and Van Hentenryck, P., Localizer: A Modeling Language for Local Search, INFORMS Journal of Computing 11(1): 1–14, 1999.

    MathSciNet  CrossRef  Google Scholar 

  12. Microsoft Corporation, Microsoft Excel.

    Google Scholar 

  13. Myers B.A., McDaniel, R.G., Miller, R.C., Ferrency, A., Faulring, A., Kyle, B.D., Mickish, A., Klimovitski, A., and Doane, P., The Amulet Environment: New Models for Effective User Interface Software Development, IEEE Transactions on Software Engineering, Vol. 23, No. 6, pp. 347–365, 1997.

    CrossRef  Google Scholar 

  14. Myers, B.A., Giuse D., Dannenberg, R.B., Zanden, B.V., Kosbie, D.S., Pervin E., Mickish, A., and Marchal, P., Garnet: Comprehensive Support for Graphical, Highly-Interactive User Interfaces, IEEE Computer, Vol. 23, No. 11., pp. 71–85, 1990.

    CrossRef  Google Scholar 

  15. Puget, J-F., Applications of constraint programming, in Montanari, U. & Rossi, F. (ed.), Proceedings, Principles and Practice of Constraint Programming (CP’95), Lecture Notes in Computer Science, Springer Verlag, Berlin, Heidelberg & New York, 647–650,1995.

    Google Scholar 

  16. Schaerf, A., Lenzerini, M., Cadoli, M, LOCAL++: a C++ framework for local search algorithms, Proc. of TOOLS Europe’ 99: Technology of Object Oriented Languages and Systems. 29th Int. Conf. 7–10 June, IEEE Comput. Soc, pp. 152–6, 1999.

    Google Scholar 

  17. Smith, S.F., and Becker, M., An Ontology for Constructing Scheduling Systems, Working Notes of 1997 AAAI Symposium on Ontological Engineering, Stanford, CA, March, 1997 (AAAI Press).

    Google Scholar 

  18. Voudouris, C., and Dorne, R., Heuristic search and one-way constraints for combinatorial optimisation, Proceedings of CP-AI-OR’01, Wye College (Imperial College), Asford, Kent UK, pp. 257–269, April 2001.

    Google Scholar 

  19. Zanden, B.V., Halterman, R., Myers, B.A., McDaniel, R., Miller, R., Szekely, P., Giuse, D., and Kosbie, D., Lessons Learned About One-Way, Dataflow Constraints in the Garnet and Amulet Graphical Toolkits, manuscript in preperation, 1999.

    Google Scholar 

  20. Zanden, B.V., Myers, B.A., Giuse, D. and Szekely, P., Integrating Pointer Variables into One-Way Constraint Models, ACM Transactions on Computer-Human Interaction. Vol. 1, No. 2, pp. 161–213, June, 1994.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voudouris, C., Dorne, R., Lesaint, D., Liret, A. (2001). iOpt: A Software Toolkit for Heuristic Search Methods. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-45578-7_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42863-3

  • Online ISBN: 978-3-540-45578-3

  • eBook Packages: Springer Book Archive