Abstract
This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment. The algorithm executes local searches using simulated annealing within a Genetic Algorithm to solve the job shop scheduling problem. Experimental results of the algorithm obtained in the “Tarantula MiniGrid” are shown. Tarantula was implemented by linking two clusters from different geographic locations in Mexico (Morelos-Veracruz). The technique used to link the two clusters and configure the Tarantula MiniGrid is described. The effects of latency in communication between the two clusters are discussed. It is shown that the evolutionary algorithm presented is more efficient working in Grid environments because it can carry out major exploration and exploitation of the solution space.
This work was supported by project CUDI-CONACYT 2009, 2010.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Roy, Sussman: Les problemes d’ordonnancement avec contraintes disjonctives, Note D.S. no 9 bis, SEMA, Paris, France (December 1964)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity, p. 496. Prentice Hall Inc., USA (1982) ISBN 0-13-152462-3
Díaz, A., Glover, F., Ghaziri, H.M., et al.: Optimización Heurística y Redes Neuronales, Madrid, Paraninfo (1996)
Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13, 533–549 (1986)
Grosan, C., Abraham, A.: Hybrid Evolutionary Algorithms. In: Ajith, Ishibuchi, Hisao (eds.) XVI, 404, illus, Hardcover. Studies in Computational Intelligence, vol. 75, p. 207 (2007) ISBN: 978-3-540-73296-9
Cruz-Chávez, M.A., Frausto-Solís, J.: Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 860–865. Springer, Heidelberg (2004) ISSN: 0302-9743
Cantu-Paz, E.: A Survey of Parallel Genetic Algorithms, Technical Report IlliGAL 97003, University of Illinois at Urbana-Champaign (1997)
Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990); Last update 2003
Sloan, J.D.: Network Troubleshooting Tools, p. 364. O’Reilly, Sebastopol (2001) ISBN 10: 0-596-00186-X
Michel, M., Devaney, J.E.: A Generalized Approach for Transferring Data-Types with Arbitrary Communication Libraries. In: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops, ICPADS, July 04-07, vol. 83. IEEE Computer Society, Washington (2000)
Ganglia Monitoring System, Monitoring clusters and Grids since the year (2000), http://ganglia.info/ (September 2009)
Zalzala, P.J., Flemming. Zalsala, A.M.S. (Ali M.S.) (eds.): Genetic algorithms in engineering systems /Edited by A.M.S. Institution of Electrical Engineers, London (1997)
Al Jadaan, O., Rajamani, L., Rao, C.R.: Improved Selection Operator for GA. Journal of Theoretical and Applied Information Technology, 269–277 (2008) ISSN 1992-8645
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cruz-Chávez, M.A., Rodríguez-León, A., Ávila-Melgar, E.Y., Juárez-Pérez, F., Cruz-Rosales, M.H., Rivera-López, R. (2010). Genetic-Annealing Algorithm in Grid Environment for Scheduling Problems. In: Kim, Th., Stoica, A., Chang, RS. (eds) Security-Enriched Urban Computing and Smart Grid. SUComS 2010. Communications in Computer and Information Science, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16444-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-16444-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16443-9
Online ISBN: 978-3-642-16444-6
eBook Packages: Computer ScienceComputer Science (R0)