Abstract
Production resettings is a vital element of production flexibility and optimizing the setup tasks scheduling within a production channel is required to improve production rate. This paper deals with a NP-Hard production resetting optimization problem based on an industrial case. 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 the genetic algorithm to improve the upper bound and thus speeding up the Branch-and-Bound while the genetic algorithm uses the content of the Branch-and-Bound stack to reduce its search space. Both methods are running in parallel and are therefore collaborating together.
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
Basseur, M., Lemesre, J., Dhaenens, C., Talbi, E.G.: Cooperation between Branch and Bound and Evolutionary Approaches to solve a BiObjective Flow Shop Problem. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 72–86. Springer, Heidelberg (2005)
Carlier, J.: Scheduling jobs with release dates and tails on identical parallel machines to minimize the makespan. European Journal of Operational Research 127, 298–306 (1987)
Cotta, C., Aldana, J.F., Nebro, A.J., Troya, J.M.: Hybridizing genetic algorithms with Branch and Bound techniques for the resolution of the TSP. In: Pearson, D.W., Steele, N.C., Albrect, R.F. (eds.), Artificial Neural Nets and Genetic Algorithms. Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, Ales, France, pp. 277–280 (1995)
French, A.P., Robinson, A.C., Wilson, J.M.: Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems. Journal of Heuristics 7, 551–564 (2001)
Garey, M.R., Johnson, D.S.: Strong NP-Completeness results: motivations, examples, and implications. Journal of the ACM 5(3), 499–508 (1978)
Gharbi, A., Haouari, M.: Minimizing makespan on parallel machines subject to release dates and delivery times. Journal of Scheduling 5, 329–355 (2002)
Gharbi, A., Haouari, M.: Optimal parallel machines scheduling with availability constraints. Discrete Applied Mathematics 148, 63–87 (2005)
Holland, J.: Adaptation in natural and artificial systems. University of Michigan Press, Michigan (1975)
Jouglet, A., Sevaux, M., Oguz, C.: Flowshop hybride: de nouvelles perspectives en mêlant algorithme génétique et propagation de contraintes. In: ROADEF 2005, Congrés de la Société Française en Recherche Opérationnelle, Tours, France (2005)
Lawler, E.L., Labetoulle, J.: On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM 25(4), 612–619 (1978)
Pessan, C., Néron, E., Bellenguez-Morineau, O.: Modélisation et planification des opérations de réglage de machines lors de changements de série. In: Gourgand, M., Riane, F. (eds.) MOSIM 2006 conference, 2nd edn., pp. 1545–1554 (2006)
Pessan, C., Bouquard, J.-L., Néron, E.: An unrelated parallel machines model for an industrial production resetting problem. European J. Industrial Engineering 2(2), 153–171 (2008)
Portman, M., Vignier, A., Dardilhac, D., Dezalay, D.: Branch and Bound crossed with GA to solve hybrid flowshops. Eur J Oper Res 107, 389–400 (1998)
Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In: Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, vol. 3562, pp. 41–53 (2005)
Rocha, P.L., Ravetti, M.G., Mateus, G.R.: The meta-heuristic grasp as an upper bound for a branch and bound algorithm in a scheduling problem with non-related parallel machines and sequence-dependent setup times. In: EU/ME Workshop, Nottingham, UK (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pessan, C., Bouquard, JL., Néron, E. (2008). Genetic Branch-and-Bound or Exact Genetic Algorithm?. In: Monmarché, N., Talbi, EG., Collet, P., Schoenauer, M., Lutton, E. (eds) Artificial Evolution. EA 2007. Lecture Notes in Computer Science, vol 4926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79305-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-79305-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79304-5
Online ISBN: 978-3-540-79305-2
eBook Packages: Computer ScienceComputer Science (R0)