Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems

References

• Aarts E., Lenstra L. K.Local Search in Combinatorial Optimization (1997) (Wiley and Sons, New York) Google Scholar
• Barnes J. W., Chambers J. B. Solving the job-shop scheduling problem with tabu search. IIE Trans. (1995) 27:257–263Crossref, Google Scholar
• Cook S. A. The complexity of theorem-proving procedures. Proc. Third Annual ACM Symp. Theory Comput., Association Comput. Machinery (1971) New York:151–158Crossref, Google Scholar
• Dueck G., Scheuer T. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. (1990) 90:161–175Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishing, Norwell, MA) Crossref, Google Scholar
• Gu J., Du D., Gu J., Pardalos P. M. Multispace search for satisfiability and NP-hard problems. Series in Discrete Mathematics and Theoretical Computer Science, DIMACS (1997) 35(AMS, Providence, RI) 407–517Satisfiability Problem: Theory and Applications: Proc. DIMACS Workshop (March 11–13) 1996Crossref, Google Scholar
• Henderson D., Jacobson S. H., Johnson A. W., Glover F., Kochenberger G. The theory and practice of simulated annealing. State-of-the-Art Handbook in Metaheuristics (2003) (Kluwer Academic Publishing, Norwell, MA) 287–319Crossref, Google Scholar
• Isaacson D., Madsen R.Markov Chains Theory and Applications (1985) (Robert E. Krieger Publishing Co., Inc., Malabar, FL) Google Scholar
• Jacobson S. H., Yücesan E. Global optimization performance measures for generalized hill climbing algorithms. J. Global Optim. (2004a) 29:177–193Crossref, Google Scholar
• Jacobson S. H., Yücesan E. Analyzing the performance of genralized hill climbing algorithms. J. Heuristics (2004b) 10:387–405Crossref, Google Scholar
• Jacobson S. H., Sullivan K. A., Johnson A. W. Discrete manufacturing process design optimization using computer simulation and generalized hill climbing algorithms. Engrg. Optim. (1998) 31:247–260Crossref, Google Scholar
• Johnson A. W., Jacobson S. H. A class of convergent generalized hill climbing algorithms. Appl. Math. Comput. (2002a) 125:359–373Crossref, Google Scholar
• Johnson A. W., Jacobson S. H. On the convergence of generalized hill climbing algorithms. Discrete Appl. Math. (2002b) 119:37–57Crossref, Google Scholar
• Johnson S. H., McLay L. A., Hall S. N., Henderson D., Vaughan D. E. Optimal search strategies using simultaneous generalized hill climbing algorithms. Math. Comput. Model.ForthcomingGoogle Scholar
• Lawler E. L., Lenstra L. K., Rinnooy Kan A. H. G., Shmoys D. B.The Traveling Salesman Problem (1985) (John Wiley and Sons, Chichester, U.K.) Google Scholar
• Royden H. L.Real Analysis (1988) (Macmillan Publishing Company, New York) Google Scholar
• Selman B., Levesque H., Mitchell D. A new method for solving hard satisfiability problems. Proc. Tenth National Conf. Artificial Intellegence (AAAI-92) (1992) San Jose, CA:440–446Google Scholar
• Smith S., Cheng C. C. Slack-based heuristics for constraint satisfaction scheduling. Proc. Eleventh National Conf. Artificial Intelligence (1993) (AAAI Press, Washington, D.C.) 440–446Google Scholar
• Sullivan K. A., Jacobson S. H. A convergence analysis of generalized hill climbing algorithms. IEEE Trans. Automatic Control (2001) 46:1288–1293Crossref, Google Scholar
• Vaughan D. E., Jacobson S. H. Formulating the meta-heuristic tabu search in the generalized hill climbing framework. Methodology Comput. Appl. Probab. (2004) 6:343–354Crossref, Google Scholar
• Vaughan D. E., Jacobson S. H., Armstrong D. E. A new neighborhood function for discrete manufacturing process design optimization using generalized hill climbing algorithms. ASME J. Mech. Design (2000) 122:164–171Crossref, Google Scholar
• Vaughan D. E., Jacobson S. H., Kaul H. Analyzing the performance of simultaneous generalized hill climbing algorithms. (2005) . Technical report, Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, ILGoogle Scholar
• Zhang W., Dietterich T. G. Solving combinatorial optimization tasks by reinforcement learning: A general methodology applied to resource-constrained scheduling. (1997) . Technical report, Department of Computer Science, Oregon State University, Corvallis, ORGoogle Scholar