Applying combinatorial optimization metaheuristics to the golf scramble problem

International Transactions in Operational Research

Volumn 7, Issue 4-5, 2000, Pages 331-347

  Dear, R G ^a   Drezner, Z ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Combinatorial optimization; Genetic algorithms; Metaheuristics

Indexed keywords

EID: 85007114006     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2000.tb00203.x     Document Type: Article

References (12)

1. Coffman Jr, E.G., Garey, M.R., Johnson, D.S., 1983. Dynamic bin-packing. SIAM Journal on Computing 12, 227-258.
2. Glover, F., 1986. Future paths for integer programming and link to artificial intelligence. Computers and Operations Research 13, 533-549.
3. Glover, F., 1989. Tabu search-Part I. ORSA Journal on Computing 1, 190-206.
4. Glover, F., Laguna, M., 1987. Tabu Search. Kluwer Academic Publishers, Amsterdam.
5. Hajek B., 1988. Cooling schedules for optimal annealing. Mathematics of Operational Research 13, 311-329.
6. Holland J.H., 1973. Genetic algorithms and the optimal allocation trials. SIAM Journal on Computing 2, 88-105.
7. Holland, J.H., 1992. Adaptation in Natural and Artificial Systems, 2nd ed. MIT Press, Cambridge, MA.
8. Kirkpatrick, S., Gelatt C.D., Vechi M.P., 1983. Optimixation by simulated annealing. Science 220, 671-680.
9. Osman, I.H., Laporte, G., 1986. Metaheuristics: A bibliograph. Annals of Operations Research 63, 513-623.
10. Reeves, C. R., 1995. Modern Heuristic Techniques for Combinational Problems. McGraw-Hill, New York.
11. Salhi, S., 1988. Heuristic search methods. In: Marcoulides, G.A. (Ed.), Modern Methods for Business Research. Lawrence Erlbaum Associates, Mahwah, NJ.
12. Yao, C.C., 1980. New Algorithms for bin packing. Journal of the ACM 27, 207-227.