Combining Metaheuristics and Exact Methods for Solving Exactly Multi-objective Problems on the Grid

This paper presents a parallel hybrid exact multi-objective approach which combines two metaheuristics – a genetic algorithm (GA) and a memetic algorithm (MA), with an exact method – a branch and bound (B&B) algorithm. Such approach profits from both the exploration power of the GA, the intensification capability of the MA and the ability of the B&B to provide optimal solutions with proof of optimality. To fully exploit the resources of a computational grid, the hybrid method is parallelized according to three well-known parallel models – the island model for the GA, the multi-start model for the MA and the parallel tree exploration model for the B&B. The obtained method has been experimented and validated on a bi-objective flow-shop scheduling problem. The approach allowed to solve exactly for the first time an instance of the problem – 50 jobs on 5 machines. More than 400 processors belonging to 4 different administrative domains have contributed to the resolution process during more than 6 days.

[1]  Enrique Alba,et al.  Metaheuristics and Parallelism , 2005 .

[2]  Gilles Fedak,et al.  XtremWeb: Building an Experimental Platform for Global Computing , 2000, GRID.

[3]  Dov Dori,et al.  Dimensioning analysis: toward automatic understanding of engineering drawings , 1992, CACM.

[4]  Chris Hankin,et al.  A Calculus of Gamma Programs , 1992, LCPC.

[5]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[6]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[7]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[8]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[9]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[10]  El-Ghazali Talbi,et al.  A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[11]  M. Vieillot.  Synthèse de programmes gamma en logique reconfigurable , 1995 .

[12]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

[13]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[14]  El-Ghazali Talbi,et al.  Adaptive mechanisms for multi-objective evolutionary algorithms , 2003 .

[15]  El-Ghazali Talbi,et al.  Towards a Coordination Model for Parallel Cooperative P2P Multi-objective Optimization , 2005, EGC.

[16]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .