Genetic Branch-and-Bound or Exact Genetic Algorithm?

Production resettings is a vital element of production flexibilityand optimizing the setup tasks scheduling within a productionchannel is required to improve production rate. This paper deals with aNP-Hard production resetting optimization problem based on an industrialcase. In this paper we present how to hybrid a Branch-and-Bound method for this problem with a genetic algorithm. The idea is to use thegenetic algorithm to improve the upper bound and thus speeding up theBranch-and-Bound while the genetic algorithm uses the content of theBranch-and-Bound stack to reduce its search space. Both methods arerunning in parallel and are therefore collaborating together.

[1]  Carlos Cotta,et al.  Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP , 1995, ICANNGA.

[2]  Odile Bellenguez-Morineau,et al.  Modélisation et planification des opérations de réglage de machines lors de changements de série , 2006 .

[3]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..

[4]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[5]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[6]  John M. Wilson,et al.  Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems , 2001, J. Heuristics.

[7]  Mohamed Haouari,et al.  Optimal parallel machines scheduling with availability constraints , 2005, Discret. Appl. Math..

[8]  Rudolf F. Albrecht,et al.  Artificial Neural Nets and Genetic Algorithms , 1995, Springer Vienna.

[9]  Emmanuel Neron,et al.  An unrelated parallel machines model for an industrial production resetting problem , 2008 .

[10]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[11]  Klaus Jansen,et al.  Experimental and Efficient Algorithms , 2003, Lecture Notes in Computer Science.

[12]  Jacques Carlier,et al.  Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .

[13]  Mohamed Haouari,et al.  Minimizing makespan on parallel machines subject to release dates and delivery times , 2002 .

[14]  Clarisse Dhaenens,et al.  Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem , 2004, WEA.

[15]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .