Summary
Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm (B&B) requires a huge amount of computational resources. The efficiency of such algorithm can be improved by its hybridization with meta-heuristics such as Genetic Algorithms (GA) which proved their effectiveness, since they generate acceptable solutions in a reasonable time. Moreover, distributing at large scale the computation, using for instance Peer-to-Peer (P2P) Computing, provides an efficient way to reach high computing performance. In this chapter, we propose ParallelBB and ParallelGA, which are P2P-based parallelization of the B&B and GA algorithms for the computational Grid. The two algorithms have been implemented using the ProActive distributed object Grid middleware. The algorithms have been applied to a mono-criterion permutation flow-shop scheduling problem and promisingly experimented on the Grid5000 computational Grid.
This is a preview of subscription content, log in via an institution to check access.
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
Adamidis, P.: Review of parallel genetic algorithms bibliography. Technical report, Aristotle University of Thessaloniki, Thessaloniki, Greece (1994)
Aida, K., Futakata, Y., Hara, S.: High-performance parallel and distributed computing for the bmi eigenvalue problem. In: Proc. the 16th IEEE International Parallel and Distributed Processing Symposium, pp. 71–78 (2002)
Aida, K., Natsume, W., Futakata, Y.: Distributed Computing with Hierarchical Mast-Worker Paradigm for Parallel Branch-and-Bound Algorithm. In: IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2003), p. 156 (2003)
Aida, K., Osumi, T.: A case Study in Running a Parallel Branch and Bound Application on the Grid. In: IEEE, Symposium on Applications and the Internet (SAINT 2005), January 2005, pp. 164–173 (2005)
Alba, E., Luque, G., Talbi, E.-G., Melab, N.: Meta-heuristics and parallelism. In: Parallel Meta-heuristics, pp. 79–104. John Wiley & Sons, Chichester (2005)
Anderson, D.P., Cobb, J., Corpela, E., Lepofsky, M., Werthimer, D.: SETI@Home: An Experiment in Public-Resource Computing. Communications of the ACM 45(11), 56–61 (2002)
Baduel, L., Baude, F., Caromel, D., Contes, A., Huet, F., Morel, M., Quilici, R.: Grid Computing: Software Environments and Tools. In: Programming, Deploying, Composing, for the Grid. Springer, Heidelberg (2006)
Bendjoudi, A., Melab, N., Talbi, E.-G.: A Parallel P2P Branch-and-Bound Algorithm for Computational Grids. In: Seventh International Workshop on Global and Peer-to-Peer Computing. IEEE/ACM International Symposium on Cluster Computing and the Grid (IEEE/ACM CCGRID), May 14-17, pp. 749–754 (2007)
Gendron, B., Crainic, T.G.: Parallel Branch-and-Bound Algorithms: Survey and Synthesis. Operations Research 42(06), 1042–1066 (1994)
Bolze, R., Cappello, F., Caron, E., Daydé, M., Desprez, F., Jeannot, E., Jégou, Y., Lantéri, S., Leduc, J., Melab, N., Mornet, G., Namyst, R., Primet, P., Quetier, B., Richard, O., Talbi, E.-G., Touche, I.: Grid 5000: a large scale and highly reconfigurable experimental Grid testbed. Intl. Journal of High Performance Computing Applications 20(4), 481–494 (2004)
Bourbeaua, B., Crainica, T.G., Gendron, B.: Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Parallel Computing (26), 27–46 (2000)
Cahon, S., Melab, N., Talbi, E.-G.: ParadisEO: A Framework for the reusable Design of Parallel and Distributed Meta-heuristics. Journal of Heuristics 10(3), 357–380 (2004)
Caromel, D., Klauser, W., Vayssière, J.: Towards seamless computing and metacomputing in Java. In: Fox, G.C. (ed.) Concurency Practice and Experience, vol. 10, pp. 1034–1061. Wiley & Sons, Ltd., Chichester (1998)
Mathieu, C., Caromel, D., di-Costanzo, A.: Peer-to-peer for computational grids: Mixing clusters and desktop machines. Parallel Computing Journal on Large Scale Grid (to appear, 2007)
Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991) BU: 511.6 HAN
Fedak, G., Germain, C., Néri, V., Cappello, F.: XtremWeb: A Generic Global Computing System. In: Proceedings of the first International Symposium on Cluster Computing and the Grid (CCGRID 2001), p. 582. IEEE, Los Alamitos (2001)
Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)
Goodman, E.D.: An Introduction to GALOPPS v3.2. Technical report, 96-07-01, CARAGE, I.S. Lab. Dpt. of C.S and C.C.C.A.E.M., Michigan State University, East Lansing, MI (1996)
Gordon, V.S., Whitley, D.: Serial and Parallel Genetic Algorithms as Function optimizers. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Gentic Algorithms, pp. 177–183. Morgan Kaufmann, San Francisco (1993)
Goux, J., Kulkami, S., Linderoth, J., Yoder, M.: An enabling framework for master-worker applications on the computational grid. In: IEEE Symposium and High Performance Distributed Computing (HPDC 2000), vol. 9, p. 43 (August 2000)
Herrera, F., Lozano, M.: Gradual distributed real-codeed genetic algorithm. IEEE Transaction in Evolutionary computation 4, 43–63 (2000)
Holland, J.H.: Adapation in natural and artificial systems. The university of Michigan Press, Ann Arbor (1975)
Lenstra, J.K., Lageweg, B.J., Rinnooy Kan, A.H.G.: A General boundind scheme for the permutation flow-shop problem. Operations Research 26(1), 53–67 (1978)
Johnson, S.M.: Optimal two and three-stage production schedules with setup times included. Naval Research Logistis Quarterly 1, 61–68 (1954)
Jackson, J.R.: An Extension of Johnson’s results on Job-Lot Scheduling. aval Research Logistis Quarterly 3(3) (1956)
Mitten, L.G.: Sequencing n jobs on two machines with arbitrary time lags. Management Science (1959)
Lin, S.-C., Punch, W., Goodman, E.: Coarse-Grain Parallel Genetic Algorithms: Categorization and New Approach. In: IEEE Symposium on Parallel and distributed Processing, pp. 28–37. IEEE computer Society Press, Los Alamitos (1994)
Péridy, L., Pinson, E., Rivreau, D.: Elimination Rules for the Flow-Shop and Permutation Flow-Shop Problems. Technical report, Institut de Mathématiques Appliquées, Université Catholique de l’Ouest (May 27, 2002)
Mejia-Olvera, M., Cantu-Paz, E.: DGENESIS-software for the execution of destributed genetic algorithms. In: Proceedings XX Conference Latinoamerica de Informatica, pp. 935–946 (1994)
Melab, N., Talbi, E.-G., Mezmaz, M., Wei, B.: Parallel Hybrid Multi-objective Meta-heuristics on P2P Systems. In: Olaru, S., Zomaya, A.Y. (eds.) Handbook of Bioinspired Computing, pp. 649–663. CRC Press, Boca Raton (2006)
Milojicic, D., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: HP Laboratories Palo Alto. Peer-to-Peer Computing. Technical Report HPL-2002-57, HP (March 8, 2002)
Mitten, L.G.: Branch-and-bound Methods: General formulation and properties. Operations Research 18, 24–34 (1970)
Schollmeier, R.: A definition of Peer-to-Peer networking for the classification of Peer-to-Peer architectures and applications. In: 2001 International Conference on Peer-to-Peer Computing (P2P 2001), Linko pings Universitet, Sweden. IEEE, Los Alamitos (2001)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operations Research 64, 278–285 (1993)
Tanaka, Y., Sato, M., Hirano, M., Nakada, H., Sekiguchi, S.: Performance evaluation of firewall compliant globus-based wide-area cluster system. In: IEEE Symposium on High-Performace Distributed Computing (HPDC), vol. 9, p. 121 (2000)
Trienekens, H.W.J.M.: Parallel Branch and Bound on an MIMD System. Report 8640/A, Econometric Institute, Erasmus University Rotterdam (1989)
Trienekens, H.W.J.M., Bruin, A.: Towards a Taxonomy of Parallel Branch and Bound Algorithms. Report EUR-CS-92-01, Dept. of Computer Science, Erasmus University, Rotterdam (1992)
Yang, M.K., Das, C.R.: A Parallel Branch-and-Bound Algorithm for MIN-Based Multiprocessors, pp. 222–223. ACM, New York (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bendjoudi, A., Guerdah, S., Mansoura, M., Melab, N., Talbi, E.G. (2008). P2P B&B and GA for the Flow-Shop Scheduling Problem. In: Xhafa, F., Abraham, A. (eds) Metaheuristics for Scheduling in Distributed Computing Environments. Studies in Computational Intelligence, vol 146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69277-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-69277-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69260-7
Online ISBN: 978-3-540-69277-5
eBook Packages: EngineeringEngineering (R0)