Abstract
For discrete optimization, it is important to understand the relationship between knowledge about the characteristics of problems and algorithm performance. Such an understanding will provide us useful hints and better prediction of algorithm behavior when we choose or design algorithms. In this paper, we seek to formally model and analyze the impact of such knowledge on algorithm performance/behavior. We propose a model which we call the Directional Tree (DT) to explore this impact. With DTs, we provide the first steps in formally explaining knowledge and algorithm behavior through rigorous proofs and analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Culberson, J. (1998). On the futility of blind search: An algorithmic view of “no free lunch”. Evolutionary Computation Journal, 6:109–128.
Glover, F. (1989). Tabu search — part i. ORSA Journal on Computing, l(3):190–260.
Glover, F. (1990). Tabu search — part ii. ORSA Journal on Computing, 2(l):4–32.
Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, New York, NY.
Kirkpatrick, S., Gelatt, Jr., C. D., and Vecchi, M. (1983). Optimization by simulated annealing. Science, 220:671–680.
Lin, S. and Kernighan, W. (1973). An effective heuristic algorithm for traveling salesman problem. Operations Research, 21:493–515.
Martin, O., Otto, S., and Felten, W. (1992). large-step markov chains for the tsp incorporating local search heuristics. Oper. Res. Lett, 11:219–224.
Mitten, L. G. (1970). Branch-and-bound methods: General formulation and properties. Operations Research, 18:24–34.
Wolpert, D. H. and Macready, W. G. (1997). No-free-lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1:67–82.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zhong, X., Santos, E. (2003). Analyzing the Impact of Knowledge on Algorithm Performance in Discrete Optimization. In: Bhargava, H.K., Ye, N. (eds) Computational Modeling and Problem Solving in the Networked World. Operations Research/Computer Science Interfaces Series, vol 21. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1043-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1043-7_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5366-9
Online ISBN: 978-1-4615-1043-7
eBook Packages: Springer Book Archive