Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study

Future Generation Computer Systems

Volumn 17, Issue 4, 2001, Pages 477-488

  Sena, Giuseppe A ^a   Megherbi, Dalila ^b   Isern, Germinal ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

^b University of Denver   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER WORKSTATIONS; GENETIC ALGORITHMS; PARALLEL ALGORITHMS; TRAVELING SALESMAN PROBLEM;

MASTER-SLAVE PARADIGM; PARALLEL VIRTUAL MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 0035156212     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(99)00134-X     Document Type: Article

References (30)

1. T.E. Anderson, D.E. Culler, D.A. Patterson, and the NoW team, A case of NoW (Networks of Workstations), IEEE Micro 15 (1) (1995) 54-64.
2. Douglas E. Comer, Internetworking with TCP/IP: Principles, Protocols and Architecture, vol. I, 3rd ed., Prentice-Hall, Englewood Cliffs, NJ, 1995.
3. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1990.
4. L. Davis (Ed.), Handbook of GA, Van Nostrand Reinhold, New York, 1991.
5. K. DeJong, An analysis of the behavior of a class of genetic adaptive systems, Ph.D. Thesis, University of Michigan, Ann Arbor, MI, 1975.
6. Durbin R., Willshaw D. An analogue approach to the Traveling Salesman Problem using Elastic Net Method. Nature. 326:1987;689.
7. B.R. Fox, M.B. McMahon, Genetic operators for sequencing problems, in: G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan-Kaufmann Publishers, San Mateo, CA, 1991, pp. 284-300.
8. M.R. Garey, D.S. Johnson, Computers and Interactability: A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
9. A. Geist, A. Beguellin, J. Dongarra, et al., PVM: Parallel Virtual Machine, An User's Guide and Tutorial for Net. Parallel Comput., The MIT Press, Cambridge, MA, 1994.
10. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
11. M. Gorges-Schleuter, Explicit parallelism of Genetic Algorithms through population structures, Parallel Problem Solving from Nature, 1991, pp. 150-159.
12. J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
13. Kirkpatrick S., Gellatt Jr C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671.
14. J.A. Kohl, G.A. Geist, XPVM: 1.0 User's Guide, Technical report, Oak Ridge National Laboratory, November 1996.
15. Lin S., Kernighan B.W. An effective heuristic Algorithm for the Traveling Salesman Problem. Operations Research. 21:1973;498.
16. Z. Michalewicz, Genetic Algorithms +Data Structures =Evolutionary Programs, Springer, Berlin, 1993.
17. T.M. Mitchell, Machine Learning, Series in CS, McGraw-Hill, New York, 1997.
18. H. Mühlenbein, Evolution in Times and Space - The Parallel Genetic Algorithm, in: G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan-Kaufmann Publishers, San Mateo, CA, 1991, pp. 317-337.
19. S. Rana, A.E. Howe, D. Whitley, K. Mathias, Comparing heuristic, evolutionary and local search approaches to scheduling, in: Proceedings of the Third Artificial Intelligence Planning Systems Conference, 1996.
20. G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan-Kaufmann Publishers, San Mateo, CA, 1991.
21. G. Richard, Tim Appenzellel, Complex Systems, Sci. Mag. (1999) 79-109.
22. T. Starkweather, D. Whitley, K. Mathias, Optimization using distributed Genetic Algorithms, Parallel Problem Solving from Nature, 1991.
23. W.R. Stevens, UNIX Network Programming, Prentice-Hall Software Series, Prentice-Hall, Englewood Cliffs, NJ, 1990.
24. R. Tanese, Distributed Genetic Algorithms, in: Proceedings of the Third International Conference on Genetic Algorithms, Morgan-Kaufmann Publishers, 1989, pp. 434-439.
25. G. Telfar, Generally applicable heuristics for global optimization: An investigation of Algorithm performance for the Euclidean Traveling Salesman Problem, M.Sc. Thesis, Victoria University of Wellington, New Zealand, October 1994.
26. Whitley D. A Genetic Algorithm Tutorial. Statist. Comput. 4:1994;65-85.
27. Whitley D., Starkweather T. Genitor II: a distributed Genetic Algorithm. J. Expt. Theory Artificial Intelligence. 2:1990;189-214.
28. D. Whitley, T. Starkweather, D. Shaner, The Travelling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination, in: L. Davis (Ed.), Handbook of GA, Van Nostrand Reinhold, New York, 1991, pp. 350-372 (Chapter 22).
29. Yoshiyuki U., Yoshiki K. New method of solving the TSP based on real space normalization theory. Phys. Rev. Lett. 75:1995;1683.
30. M. Zbigniew, Genetic Algorithms +Data Structure =Evolution Programs, Springer, New York, 1994.