Skip to main content
SpringerLink
Log in

A Time-Sensitive System for Black-Box Combinatorial Optimization

  • Conference paper
  • First Online:
Algorithm Engineering and Experiments (ALENEX 2002)

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

Included in the following conference series:

Abstract

When faced with a combinatorial optimization problem, practitioners often turn to black-box search heuristics such as simulated annealing and genetic algorithms. In black-box optimization, the problem-specific components are limited to functions that (1) generate candidate solutions, and (2) evaluate the quality of a given solution. A primary reason for the popularity of black-box optimization is its ease of implementation. The basic simulated annealing search algorithm can be implemented in roughly 30–50 lines of any modern programming language, not counting the problem-specific local-move and cost-evaluation functions. This search algorithm is so simple that it is often rewritten from scratch for each new application rather than being reused.

Supported in part by NSF Grant CCR-9988112 and ONR Award N00149710589.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Aarts and J.-K. Lenstra. Local Search in Combinatorial Optimization. Wiley-Interscience, Chichester, England, 1997.

    MATH  Google Scholar 

  2. D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. McGraw-Hill, London, 1999.

    Google Scholar 

  3. T. Csendes and D. Ratz. Subdivision direction selection in interval methods for global optimization. SIAM Journal on Numerical Analysis, 34(3):922–938, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  4. F. Glover. Tabu search-part I. ORSA Journal on Computing, 1(3):190–206, 1989.

    MATH  Google Scholar 

  5. J. H. Holland. Adaptation in natural artificial systems. University of Michigan Press, Ann Arbor, 1975.

    Google Scholar 

  6. L. Ingber. Adaptive simulated annealing (asa): Lessons learned. Control and Cybernetics, 25(1):33–54, 1996.

    MATH  Google Scholar 

  7. M. Jelasity. Towards automatic domain knowledge extraction for evolutionary heuristics. In Parallel Problem Solving from Nature — PPSN VI, 6th International Conference, volume 1917 of Lecture Notes in Computer Science, pages 755–764, Paris, France, Sept. 2000. Springer.

    Chapter  Google Scholar 

  8. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: an experimental evaluation; part 1, graph partitioning. Operations Research, 37(6):865–892, 1989.

    Article  MATH  Google Scholar 

  9. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: an experimental evaluation; part 2, graph coloring and number partitioning. Operations Research, 39(3):878–406, 1991.

    Google Scholar 

  10. S. Kirpatrick, C. Gelatt, Jr., and M. Vecchi. Optimization by simulated annealing. Science, 220:671–680, May 1983.

    Google Scholar 

  11. A. V. Kuntsevich. Fortran-77 and fortran-90 global optimization toolbox: User’s guide. Technical Report A-8010, Institut fur Mathematic, Karl Franzens Universitat, Graz, Austria, 1995.

    Google Scholar 

  12. L. Lukšan, M. Tuma, M. Šiška, J. Vlček, and N. Ramešová. Interactive system for universal functional optimization (ufo). Technical Report 826, Institute of computer science, Academy of sciences of the Czech Republic, Prague, Czech Republic, 2000.

    Google Scholar 

  13. M. Mongeau, H. Karsenty, V. Rouzé, and J.-B. Hiriart-Urruty. Comparison of public-domain software for black box global optimization. Optimization Methods and Software, 13(3):203–226, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  14. V. Phan, S. Skiena, and P. Sumazin. A model for analyzing black box optimization, in preparation, 2001.

    Google Scholar 

  15. V. Phan, P. Sumazin, and S. Skiena. Discropt web page. http://www.cs.sunysb.edu/~discropt.

  16. G. Reinelt. TSPLIB. University of Heidelberg, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95.

  17. G. Reinelt. TSPLIB— A traveling salesman problem library. ORSA Journal on Computing, 3(4):376–384, 1991.

    MATH  Google Scholar 

  18. M. Resende. Max-Satisfiability Data. Information Sciences Research Center, AT&T, http://www.research.att.com/~mgcr.

  19. D. H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67–82, 1997.

    Article  Google Scholar 

  20. M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. The Transactions of the Institute of Electronics, Information and Communication Engineers, J83-D-1(1):3–25, 200.

    Google Scholar 

  21. Q. Zheng and D. Zhuang. Integral global optimization: Algorithms, implementations and numerical tests. Journal of Global Optimization, 7(4):421–454, 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State University of New York at Stony Brook, Stony Brook, NY, 11794-4400, USA

    Vinhthuy Phan, Pavel Sumazin & Steven Skiena

Authors
  1. Vinhthuy Phan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavel Sumazin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steven Skiena
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    David M. Mount

  2. Department of IEOR, Columbia University, 500W. 120 St., MC 4704, New York, NY, 10027, USA

    Clifford Stein

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Phan, V., Sumazin, P., Skiena, S. (2002). A Time-Sensitive System for Black-Box Combinatorial Optimization. In: Mount, D.M., Stein, C. (eds) Algorithm Engineering and Experiments. ALENEX 2002. Lecture Notes in Computer Science, vol 2409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45643-0_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45643-0_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43977-6

  • Online ISBN: 978-3-540-45643-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation