A parallel hybrid GA for combinatorial optimization using grid technology

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 3, Issue , 2003, Pages 1895-1902

  Jing, Tang ^a   Lim, Meng Hiot ^a   Ong, Yew Soon ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

GRID COMPUTING; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATION TIME; GRID COMPUTING ENVIRONMENT; GRID TECHNOLOGIES; MULTIPLE PROCESSING; PARALLEL HYBRIDS; QUADRATIC ASSIGNMENT PROBLEMS; SOLUTION QUALITY;

COMBINATORIAL OPTIMIZATION;

EID: 34247390846     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299905     Document Type: Conference Paper

References (25)

1. M.H. Lim, Y. Yuan, and S. Omatu, Efficient genetic algorithms rising simple genes exchange local search policy for the qiradratic assignment 'problem, Computational Optimization and Applications; vol. 15, 249-268, 2000, .
2. M.H. Lim, Y. Yuan, and S. Omatu, Extensive testing of a hybrid genetic algorithm for quadratic assignment problem, Computational Optimization and Applications, vol. 23, 47-64, 2002.
3. YI-LIANG XU, MENG-HIOT LIM, YAN-KOK HONG, Hybrid-GA with Stochastic Selection Local Search for Solving Quadratic Assignment Problems. PhD Internal Report.
4. D. Arnold, et al., User's Guide to NetSolve V1.4, Innovative Cornpiiring Laboratory, Department of Computer Science, University of Tennessee, Knoxville, TN 37996-3450.
5. T.C. Koopmans and M.J.Beckmann, Assignment problems and the location of economic activities. Econometrica 25( 1957)53-76.
6. I. Foster and C. Kesselman (eds.). The Grid: Blireprint for a New Comyntirzg Iifrastnicture, Morgan Kaufmann, San Francisco, 1999.
7. V. Nissen and H. Paul, A modification of Threshold Accepting and its Application to the Quadratic Assignment Problem, OR Spektrum, Vol. 17, pp. 205- 210, 1995.
8. E. D. Taillard, Comparison of Iterative Searchesfor the Quadratic Assignment Problem, Location Science, vol. 3, pp.87-105, 1995.
9. V. Maniezzo, A. Colorni, and M. Dorigo, The Ant System Applied to the Quadratic Assignment Problem, Tech. Rep. 94/28, INDIA, University de Bruxelles, 1994.
10. P. Merz and B. Freislenben, A genetic local search approach to the quadratic assignment problem, Proc. of Int'l Conf. on Genetic Algorithms (lCGA'97), Morgan Kaufmann: San Mateo, CA, pp. 465-472.
11. I .V. Nissen, Solving the Quadratic Assignment problem with Clues from Nature, IEEE Transactions on Neural Networks, vol. 5, no. 1, pp. 66-72, 1994.
12. S. D. Eksioglu, et al., Parallel Metaheuristics for Combinatorial Optimization, Presentation at the International School on Advanced Algorithmic Techniques for Parallel Computations with Applications, Natal (RN) Brazil, October 2, 1999.
13. H. Muhlenbein, Parallel Genetic Algorifhms. Population Genetics and Combinatorial Optimization, in Proceedings of the Third International Conference on Genetic Algorithms, (Schaffer, ed.), pp. 416-421, Morgan Kaufmann, 1989.
14. Erick Cantu-Paz. A Survey, of Parallel Genetic Algorithms. Calculateurs Paralleles, Reseaux et Systems Repartis. Vol. 10, No 2. pp. 141-171, 1998.Paris: Hemes.
15. Erick Cantu-Paz. Migration Policies and Takeover Times in Genetic Algorithms. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., & Smith, R. E. (Eds.) GECCO-99: Proceedings of the Genetic and Evolutionaty Computation Conference. (p. 775). San Francisco, CA: Morgan Kaufmann.
16. Erick Cantu-Paz, On the Effects of Migration on the Fitness Distribntion of ParaNel Evolirtionap Algorithms, In Workshop on Evolutionary Computation and Parallel Processing at GECCO-2000, page 3-6.
17. Braun, H. C. On Solving Traveling Salesman Problems by Generic Algorithms. In Schwefel, H.P. and Manner, R., editors, Parallel Problem Solving from Nature, pages 129-133, Springer-Verlag, Berlin, Germany, 1990.
18. R.E. Burkard, S.E. Karisch, and F. Rendl, "QAPLIB-4 quadratic assignment problem library", Journal of Global Optimization, vol. 10, pp. 391-403, 1997.[URL:http://fmatbhpl.turaz.ac.at/karischiqaplib/].
19. A.M. Geoffrion and G.W. Graves, Schedtrlingparallel prodnction lines with changeover costs: Practical application of a quadratic assignment/LP approach, Operations Research.24 (1976), 595-610.
20. Thomas Back, David B. Fogel, and Zbigniew Michalewics, editors in chief, Handbook of evolutionary?, computation, Bristol; Philadelphia : Institute of Physics Pub.; New York : Oxford University Press, 1997.
21. T.D. Mavridou and P.M. Pardalos, Simulated Annealingand Genetic Algorithms for thefaciliiy layout problem: A survey. Computational optimization and applications, 7, 111-126 (1997).
22. L. Steinberg, The backgroimd wiring problem: A placement algorithm. SIAM Rew. 3 (1961) 37-50.
23. L. Steinberg, Assignment problems in parallel and distribured computing, Kluwer Academic Publishers, Boston, 1987.
24. L.J. Huberl, Assignment methods in combinatorial data anacvsis, Marcel Dekker, Inc., NewYork, NY 10016, 1987.
25. D.E. Goldberg, Genetic Algorithm in Search, Optimization, and Machine learning, Addison-Wesley, 1989.