Abstract
An approach to combine a genetic algorithm with traditional linear programming based branch and bound for integer programming is described in this paper. Branch and bound provides a systematic search procedure for pure integer programming problems and a genetic approach offers the possibility of rapid movement towards a useful solution. Hence the two approaches look worthy of combination as a way to solve certain {0,1} integer programming problems. The approach has been tested out on satisfiability problems and computational results look promising in certain aspects of speed and solution quality.
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
References
J.E. Beasley and P.C. Chu. A genetic algorithm for the set covering problem. European Journal of Operational Research, 94:392–404, 1996.
C. Cotta, J.F. Aldana, A.J. Nebro, and J.M. Troya. Hybridizing genetic algorithms with branch and bound techniques for the resolution of the TSP. In D.W. Pearson, N.C. Steele, R.F. Albrecht (editors), Artificial Neural Nets and Genetic Algorithms, Wien, pages 277–280, 1995. Springer-Verlag.
Dash Associates Ltd, Blisworth, Northamptonshire, UK. XPRESS-MP.
K.A. de Jong and W.M. Spears. Using genetic algorithms to solve NP-complete problems. In Proceedings of the 3rd International Genetic Algorithms Conference, New Jersey, USA, 1989. Lawrence Erlbaum Associates.
I.P. Gent and T. Walsh. Easy problems are sometimes hard. Artificial Intelligence, 70:335–345, 1994.
A.H. Land and A.G. Doig. An automatic method for solving discrete programming problems. Econometrica, 28, 1960.
A. Nagar, S.S. Heragu, and J. Haddock. A combined branch-and-bound and genetic algorithm based for a flowshop scheduling algorithm. Annals of Operations Research, 63:397–414, 1996.
C. Reeves. Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, 63:371–396, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
French, A.P., Robinson, A.C., Wilson, J.M. (1998). A Hybrid Genetic / Branch and Bound Algorithm for Integer Programming. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_52
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6492-1_52
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83087-1
Online ISBN: 978-3-7091-6492-1
eBook Packages: Springer Book Archive