Using ACCESSIBILITY to assess the performance of generalized hill climbing algorithms
References
[1]
Anily, S., and A. Federgruen. 1987. Simulated annealing methods with general acceptance probabilities. Journal of Applied Probability. 24: 657-667.
[2]
Dueck, G. and T. Scheuer. 1990. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. European Journal of Operational Research. 46:271-281.
[3]
Garey, M.R. and D.S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP- Completeness. San Fransisco: Freeman and Company.
[4]
Glover, F. and M. Laguna. 1997. Tabu Search. Norwell: Kluwer Academic Publishing.
[5]
Hajek, B. 1988. Cooling schedules for optimal annealing. Mathematics of Operations Research. 13:311-329.
[6]
Jacobson, S.H. and E. Yticesan. 1998a. On the complexity of verifying structural properties of discrete event simulation models. Forthcoming in Operations Research.
[7]
Jacobson, S.H. and E. Yticesan. 1998b. On the effectiveness of discrete optimization heuristics," Working Paper. INSEAD. Fontainebleau, France.
[8]
Johnson, A.W. and S.H. Jacobson. 1997. A convergence result for a class of generalized hill climbing algorithms," Technical Report, Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA.
[9]
Johnson, A.W., and S.H. Jacobson. 1998. On the convergence of Generalized Hill Climbing Algorithms. Technical Report, Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA.
[10]
Mitra, D., F. Romeo, and A.L. Sangiovanni-Vincentelli. 1986. Convergence and finite-time behavior of simulated annealing. Advances in Applied Probability. 18:747-771.
[11]
Pritsker, A.A.B. 1995. Introduction to Simulation and SLAM H. 4th Edition. W. Lafayette, IN: Systems Publishing Company.
[12]
Schruben, L.W. 1995. Graphical Simulation Modeling and Analysis: Using SIGMA for Windows. Boyd and Fraser Publishing Company: The Scientific Press Series, Danvers, Massachusetts.
[13]
Schruben, L., and E. Yticesan. 1993. Modeling paradigms for discrete event simulation. Operations Research Letters. 13: 265-275.
[14]
Schuur, P.C. 1997. Classification of acceptance criteria for the simulated annealing algorithm. Mathematics of Operations Research. 22: 266-275.
[15]
Shedler, G.L. 1987. Regeneration and Networks of Queues. New York: Springer-Verlag.
[16]
Yao, X. 1995. A new simulated annealing algorithm. International Journal of Computer Mathematics. 56: 161-168.
[17]
Yao, X., and G. Li. 1991. General simulated annealing. Journal of Computer Science and Technology. 6: 329- 338.
[18]
Yticesan, E. and S.H. Jacobson. 1992. Building correct simulation models is difficult. In Proceedings of the 1992 Winter Simulation Conference. 783-790.
[19]
Yticesan, E. and S.H. Jacobson. 1996. Intractable structural issues in discrete events simulation: special cases and heuristic approaches. ACM Transactions on Modeling and Computer Simulation. 6: 53-75.
Index Terms
- Using ACCESSIBILITY to assess the performance of generalized hill climbing algorithms
Recommendations
Analyzing the Performance of Generalized Hill Climbing Algorithms
Generalized hill climbing algorithms provide a framework to describe and analyze metaheuristics for addressing intractable discrete optimization problems. The performance of such algorithms can be assessed asymptotically, either through convergence ...
Global Optimization Performance Measures for Generalized Hill Climbing Algorithms
Generalized hill climbing algorithms provide a framework for modeling several local search algorithms for hard discrete optimization problems. This paper introduces and analyzes generalized hill climbing algorithm performance measures that reflect how ...
$$\beta$$β-Hill climbing: an exploratory local search
Hill climbing method is an optimization technique that is able to build a search trajectory in the search space until reaching the local optima. It only accepts the uphill movement which leads it to easily get stuck in local optima. Several extensions ...
Comments
Information & Contributors
Information
Published In
December 1998
1766 pages
ISBN:0780351347
Sponsors
- IIE: Institute of Industrial Engineers
- IEEE-SMCS: Systems, Man & Cybernetics Society
- INFORMS/CS: Computer Science TC
- ASA: American Statistical Association
- ACM: Association for Computing Machinery
- SCS: Society for Computer Simulation
- SIGSIM: ACM Special Interest Group on Simulation and Modeling
- IEEE-CS: Computer Society
- NIST: National Institute of Standards & Technology
Publisher
IEEE Computer Society Press
Washington, DC, United States
Publication History
Published: 01 December 1998
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
WSC '98 Paper Acceptance Rate 164 of 216 submissions, 76%;
Overall Acceptance Rate 3,413 of 5,075 submissions, 67%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 165Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)4
Reflects downloads up to 26 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in