Comparison between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic Pseudo-Boolean function

Computers and Industrial Engineering

Volumn 38, Issue 3, 2000, Pages 323-340

  Hasan, M ^a   Alkhamis, T ^a   Ali, J ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING; SIMULATED ANNEALING;

TABU SEARCH METHODS; UNCONSTRAINED QUADRATIC PSEUDO-BOOLEAN FUNCTIONS;

OPERATIONS RESEARCH;

EID: 0034294365     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(00)00043-7     Document Type: Article

References (36)

1. Aarts E., Korst J., Van Laarhoven P. A quantitative analysis of the simulated annealing algorithm: a case study for the travelling salesman problem. Journal of Statististical Physics. 50:1988;187-206.
2. Adams W., Billionnet A., Sutter A. Unconstrained 0-1 optimization and Lagrangean relaxation. Discrete Applied Mathematics. 29:1990;131-142.
3. AlKhamis T., Hasan M., Ahmed M. Simulated annealing for the unconstrained quadratic Pseudo-Boolean function. European Journal of Operational Research. 108:1998;641-652.
4. Aspvall B., Plass M., Tarjan R. A linear time algorithm for testing the truth of certain quantified formulas. Information Processing Letters. 8:1979;121-123.
5. Back T. Optimal mutation rates in genetic search. Forrest S. Proceedings of the Fifth International Conference on Genetic Algorithm. 1993;2-9 Morgan Kaufmann, San Mateo, CA.
6. Barahona F. A solvable case of quadratic 0-1 programming. Discrete Applied Mathematics. 13:1986;23-26.
7. Barahona F., Junger M., Reinelt G. Experiments in quadratic 0-1 programming. Mathematical Programming. 44:1989;127-137.
8. Beasley D., Bull D., Martin R. An overview of genetic algorithm: part I, fundamentals. University Computing. 15:1993;58-69.
9. Beasley D., Bull D., Martin R. An overview of genetic algorithm: part I, research topics. University Computing. 15:1993;170-181.
10. Billionnet A., Sutter A. Minimization of a quadratic Pseudo-Boolean function. European Journal of Operational Research. 78:1994;106-115.
11. Boros E., Carma Y., Hammer P. Upper-bounds for quadratic 0-1 maximization. Operations Research Letters. 9:1990;73-79.
12. Boros E., Carma Y., Hammer P. Chvatal cuts and odd cycle inequalities in quadratic 0-1 optimization. SIAM Journal of Discrete Mathematics. 5/2:1992;163-177.
13. Chakradhar S., Bushnell M. A solvable class of quadratic 0-1 programming. Discrete Applied Mathematics. 36:1992;233-251.
14. Colorni A., Dorigo M., Maffiloi F., Maniezzo V., Righini G., Trubian M. Heuristics from nature for hard combinatorial problems. International Transactions of Operational Research. 3:1996;1-21.
15. Crama, Y., Hansen, P., & Jaumard, B. (1998). The basic algorithm for Pseudo-Boolean programming revisited. Tech. Rep. RRR no. 54-88, Rutgers Center for Operations Research (RUTCOR), Rutgers University, New Brunswick, NJ.
16. Dammeyer D., Voss S. Dynamic tabu list management using reverse elemination method. Annals of Operation Research. 41:1993;31-46.
17. DeWerra D., Hertz A. Tabu search techniques: a tutorial and application to neural networks. OR Spektrum. 11:1989;131-141.
18. Gallo G., Hammer P., Simeone B. Quadratic knapsack problem. Mathematical Programming. 12:1980;132-149.
19. Garey M., Johnson D. Computers and intractability: a guide to the theory of NP-completeness. 1979;Freeman, San Francisco.
20. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research. 1:1986;533-549.
21. Glover F. Tabu search I. ORSA journal of Computing. 1:1989;190-206.
22. Glover F. Tabu search II. ORSA journal of Computing. 2:1990;4-32.
23. Glover F., Laguna M. Tabu search. Reeves C.R. Modern heuristic techniques for combinatorial problems. 1993;70-150 Blackwell Scientific, Oxford.
24. Goldberg D. Genetic algorithms. 1989;Addison-Wesley, New York.
25. Hammer P. Some network flow problems solved with Pseudo-Boolean programming. Operations Research. 13:1965;388-399.
26. Hammer P., Hansen P., Simeone B. Roof duality, complementation and persistency in quadratic 0-1 optimization. Mathematical Programming. 28/2:1984;121-155.
27. Holland J. Adoption in natural and artificial systems. 1975;MIT Press, Cambridge, MA.
28. Kirkpatrick S., Gelatt C. Jr., Vecchi M. Optimization by simulated annealing. Science. 220:1983;671-680.
29. Koulamas C., Antony S., Jaen R. A survey of simulated annealing applications to operations research problems. Omega. 22/1:1994;41-56.
30. Krarup J., Pruzan P.A. Computer aided layout design. Mathematical Programming Study. 9:1978;75-94.
31. Metropolis N., Rosenbluth M., Teller M., Teller E. Equation of steady state calculation by fast computer machine. Journal of Chemical Physics. 21:1956;1087-1092.
32. Osman I., Laport G. Metaheuristics: a bibliography. Annals of Operations Research. 63:1996;513-623.
33. Paradalos P., Rodgers G. Computaional aspects of a branch and bound algorithm for quadratic zero-one programming. Computing. 45:1990;131-144.
34. Picard J., Ratliff H. Minimum cuts and related problems. Networks. 5:1974;357-370.
35. Reeves C. Modern heuristic techniques for combinatorial problems. 1993;Blackwell Scientific, Oxford.
36. Williams, A. (1985). Quadratic 0-1 Programming Using the Roof Dual with Computational Results, RUTCOR Research Report no. 8-85, The State University of New Jersey.