Nature's way of optimizing

Artificial Intelligence

Volumn 119, Issue 1, 2000, Pages 275-286

  Boettcher, Stefan ^a,b,c   Percus, Allon ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b CLARK ATLANTA UNIVERSITY   (United States)

^c EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMICS; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SIMULATED ANNEALING; STATISTICAL METHODS; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; EQUILIBRIUM STATISTICAL PHYSICS; EXTREMAL OPTIMIZATION; GRAPH PARTITIONING; LOCAL SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 0033687233     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00007-2     Document Type: Article

References (34)

1. Alpert C.J., Kahng A.B. Recent directions in netlist partitioning: A survey. Integration: The VLSI Journal. Vol. 19:1995;1-81.
2. Bak P. How Nature Works. 1996;Springer, New York.
3. Bak P., Sneppen K. Punctuated equilibrium and criticality in a simple model of evolution. Phys. Rev. Lett. Vol. 71:1993;4083-4086.
4. Bak P., Tang C., Wiesenfeld K. Self-organized criticality: An explanation of 1/f -noise. Phys. Rev. Lett. Vol. 59:1987;381-384.
5. Boettcher S. Extremal optimization of graph partitioning at the percolation threshold. J. Phys. A: Math. Gen. Vol. 32:1999;5201-5211.
6. Boettcher S., Paczuski M. Ultrametricity and memory in a solvable model of self-organized criticality. Phys. Rev. E. Vol. 54:1996;1082-1095.
7. Boettcher S., Paczuski M. Aging in a model of self-organized criticality. Phys. Rev. Lett. Vol. 79:1997;889-892.
8. Boettcher S., Percus A.G. Extremal optimization: Methods derived from Co-Evolution. GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference. 1999;825-832 Morgan Kaufmann, San Francisco, CA.
9. Bounds D.G. New optimization methods from physics and biology. Nature. Vol. 329:1987;215-219.
10. Bui T.N., Moon B.R. Genetic algorithm and graph partitioning. IEEE Trans. Comput. Vol. 45:1996;841-855.
11. Chialvo D.R., Bak P. Learning from mistakes. Neuroscience. Vol. 90:1990;1137-1148.
12. Černy V. A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Optimization Theory Appl. Vol. 45:1985;41-51.
13. Darwin C. The Origin of Species by Means of Natural Selection. 1859;Murray, London.
14. Dunlop A.E., Kernighan B.W. A procedure for placement of standard-cell VLSI circuits. IEEE Trans. Computer-Aided Design. Vol. CAD-4:1985;92-98.
15. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
16. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Oper. Res. Vol. 13:1986;533-549.
17. Greene J.W., Supowit K.J. Simulated annealing without rejected moves. IEEE Trans. Computer-Aided Design. Vol. CAD-5:1986;221-228.
18. Hendrickson B.A., Leland R. A multilevel algorithm for partitioning graphs. Proceedings Supercomputing '95, San Diego, CA. 1995.
19. Holland J. Adaptation in Natural and Artificial Systems. 1975;University of Michigan Press, Ann Arbor, MI.
20. C. Hurwitz, GNU tsp_solve, available at: http://www.cs.sunysb.edu/~algorith/implement/tsp/implement.shtml.
21. Johnson D.S. Local optimization and the traveling salesman problem. Paterson M.S. Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 443:1990;446-461 Springer, Berlin.
22. Johnson D.S., McGeoch L.A. The traveling salesman problem: A case study. Aarts E.H.L., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;215-310 Wiley, New York.
23. Johnson D.S., Aragon C.R., McGeoch L.A., Schevon C. Optimization by simulated annealing: An experimental evaluation, Part I (graph partitioning). Oper. Res. Vol. 37:1989;865-892.
24. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. Vol. 220:1983;671-680.
25. Martin O.C., Otto S.W. Combining simulated annealing with local search heuristics. Ann. Oper. Res. Vol. 63:1996;57-75.
26. Mezard M., Parisi G., Virasoro M.A. Spin Glass Theory and Beyond. 1987;World Scientific, Singapore.
27. Merz P., Freisleben B. Memetic algorithms and the fitness landscape of the graph bi-partitioning problem. Lecture Notes in Computer Science. Vol. 1498:1998;765-774 Springer, Berlin.
28. Merz P., Freisleben B. Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning, Technical Report No. TR-98-01. 1998;Department of Electrical Engineering and Computer Science, University of Siegen, Germany. Available at: http://www.informatik.uni-siegen.de/~pmerz/publications.html.
29. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E. Equation of state calculations by fast computing machines. J. Chem. Phys. Vol. 21:1953;1087-1092.
30. Paczuski M., Maslov S., Bak P. Avalanche dynamics in evolution, growth, and depinning models. Phys. Rev. E. Vol. 53:1996;414-443.
31. Reeves C.R. Modern Heuristic Techniques for Combinatorial Problems. 1993;Wiley, New York.
32. Selman B., Mitchell D., Levesque H. A new method for solving hard satisfiability problems. Proc. AAAI-92, San Jose, CA. 1995;440-446.
33. Sneppen K., Bak P., Flyvbjerg H., Jensen M.H. Evolution as a self-organized critical phenomenon. Proc. Natl. Acad. Sci. Vol. 92:1995;5209-5213.
34. Osman I.H., Kelly J.P. Meta-Heuristics: Theory and Application. 1996;Kluwer, Boston, MA.