A Time-Sensitive System for Black-Box Combinatorial Optimization
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.
KeywordsSimulated Annealing Search Heuristic Combinatorial Optimization Problem Vertex Cover Greedy Heuristic
Unable to display preview. Download preview PDF.
- D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. McGraw-Hill, London, 1999.Google Scholar
- J. H. Holland. Adaptation in natural artificial systems. University of Michigan Press, Ann Arbor, 1975.Google Scholar
- 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
- S. Kirpatrick, C. Gelatt, Jr., and M. Vecchi. Optimization by simulated annealing. Science, 220:671–680, May 1983.Google Scholar
- 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
- 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
- V. Phan, S. Skiena, and P. Sumazin. A model for analyzing black box optimization, in preparation, 2001.Google Scholar
- V. Phan, P. Sumazin, and S. Skiena. Discropt web page. http://www.cs.sunysb.edu/~discropt.
- G. Reinelt. TSPLIB. University of Heidelberg, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95.
- M. Resende. Max-Satisfiability Data. Information Sciences Research Center, AT&T, http://www.research.att.com/~mgcr.
- 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