An investigation of the use of local search in NP-hard problems

IECON Proceedings (Industrial Electronics Conference)

Volumn 1, Issue , 2000, Pages 2710-2715

  Newth, D ^a   Kirley, M ^a   Green, D G ^a  

^a CHARLES STURT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION);

BALDWIN EFFECTS; CRITICAL LEVEL; HYBRID ALGORITHMS; LAMARCKIAN EVOLUTION; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; QUALITY OF SOLUTION;

INDUSTRIAL ELECTRONICS;

EID: 84968745164     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IECON.2000.972426     Document Type: Conference Paper

References (15)

1. Ackley, D. H. and Littman, M. (1991) Interactions between learning and evolution. In Proceedings of 2nd Conference on Artificial Life. C. G. Langton ed., Addison-Wesley.
2. Bak, P. and Chen, K. 1991. Self-organized criticality. Scientific American 265:26-33.
3. Baldwin (1896) A new factor in evolution. American Naturalist, 30, 441-451.
4. Gorczynski, R. M., and Steele, E. (1981) Simultaneouse yet independent inheritance of somatically aquired tolerance to two distinct H-2 antigenic haplotype determinants in mice. Nature 289:678-681.
5. Hinton, G. E. and Nowlan, S. J. (1987) How learning can guide evolution. Complex Systems, 1, 495-502.
6. Houck, C. R., Joines, J. A., Kay, M. G., and Wilson, J. R. (1997) Empirical Investigation of the Benefits of Partial Lamarckianism. Evolutionary Computation, 5(1):31-60
7. Kirley, M., Newth, D., and Green, D. G., (1999) A tree Based Genetic Algorithm for Solving Open Shop Scheduling Problems. Journal of Knowledge-Based Intelligent Engineering Systems 4(3):143-149.
8. Land, M.(1998) Evolutioanry Algorithms with local search for combinatorial optimization. Ph.D. Thesis, Univeristy of California, San Diego.
9. Lobo, F. G. and Goldberg D. E. (1996) Decision making in a hybrid genetic algorithm. IlliGAL Report No. 96009. University of Illinois at Urbana-Champaign.
10. Martello, S., Pisinger, D. and Toth, P. (1999) Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problema, Management Science, 45:414-424
11. Michalewicz, Z. and Arabas, J.(1994) Genetic Algorithms for the 0/1 knapsack problem. In Methodologies for Intelligent Systems (IS-MIS'94). pp 134-143, Springer. Berlin.
12. Michalewicz, Z. (1996) Genetic Algorithms + Data Strucutres = Evolutionary Programs. 3rd ed. Springer-Verlag.
13. Saski, T. and Tokoro, M. (1998). Adaptation under changing Environments with Various rates of Inheritance of Acquired Characters: Comparison between Darwinian and Lamarckian Evolution. In X. Yao et al (eds), Simulated Evolution and Learning SEAL98, Lecture Notes in Artificial Intelligence 1585:34-41. Springer.
14. Whitley D. and Gruau, F(1993) Adding learning to the cellular development of neural networks: evolution and the Baldwin effect. Evolutionary Computation 1(3):213-233.
15. Whitley, D., Gordon, V. S., and Mathias, K. (1993) Lamarckian Evolution, The Baldwin Effect and Function Optimization. In Y. Davidor et. al.(eds). Parallel Problem Solving from Nature - PPSN III. pp 6-15. Springer-Verlag.