Industrial and Systems Engineering
Dwight Look College of Engineering, Texas A&M University
Home > Academics> Graduate - Course Description > ISEN 621

ISEN 621. Heuristic Optimization


 

(There will likely be differences in the instructor, textbook, and/or outline the next time the course is taught.)

Instructor: Dr. Halit Üster

References :

  1. Aarts, E. and Lenstra, J.K. (Editors), Local Search in Combinatorial Optimization, Wiley, Chichester, 1997.
  2. Sait, S.M. and Youssef, H., Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems, Wiley-IEEE Computer Society Press, January 2000.
  3. Michalewicz, Z. and Fogel, D. B., How to Solve It: Modern Heuristics, Springer-Verlag, Berlin, Germany, 2000.
  4. lover, F.W. and Kochenberger, G.A. (Editors), Handbook of Metaheuristics, Kluwer, Boston, MA, 2003.
  5. Glover, F.W. and Laguna, M., Tabu Search, Kluwer,Boston, MA, 1997.
  6. Voss, S., Martello, S., Osman, I.H. and Roucairol, C. (Editors), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, MA, 1999.
  7. Reeves, C.R., Modern Heuristic Techniques for Combinatorial Problems, Halsted Press, New York, NY, 1993.
  8. Rayward-Smith, V.J., Osman I.H., Reeves, C.R. and Smith, G.D. (Editor), Modern Heuristic Search Methods, Wiley, NY, 1996.
  9. Hochbaum, Dorit S. (Editor), Approximation Algorithms for NP-hard Problems, PWS, Boston, MA, 1995.
  10. Vazirani, Vijay V., Approximation Algorithms, Springer-Verlag, Berlin, 2001.

Description :Focus on heuristic optimization methods that search beyond local optima. Procedures to be covered include neighborhood search methods and advanced meta-heuristic search strategies and approximation algorithms. Heuristic algorithms for various combinatorial engineering problems including travelling salesman, layout and location, vehicle routing and scheduling will be discussed. (Prerequisites: ISEN 421 and ISEN 622 or instructor's permission.)

Course Topics