Advertisement

Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem

  • Michael Armbruster
  • Marzena Fügenschuh
  • Christoph Helmberg
  • Nikolay Jetchev
  • Alexander Martin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3906)

Abstract

We develop a primal heuristic based on a genetic algorithm for the minimum graph bisection problem and incorporate it in a branch-and-cut framework. The problem concerns partitioning the nodes of a weighted graph into two subsets such that the total weight of each set is within some lower and upper bounds. The objective is to minimize the total cost of the edges between both subsets of the partition. We formulate the problem as an integer program. In the genetic algorithm the LP-relaxation of the IP-formulation is exploited. We present several ways of using LP information and demonstrate the computational success.

Keywords

Genetic Algorithm Valid Inequality Hybrid Genetic Algorithm Edge Cost Primal Heuristic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Achterberg, T.: SCIP - a framework to integrate constraint and mixed integer programming. ZIB-Report (2004)Google Scholar
  2. 2.
    Armbruster, M., Fügenschuh, M., Helmberg, C., Jetchev, N., Martin, A.: LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. In: Operations Research Proceedings (to appear, 2005)Google Scholar
  3. 3.
    Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Programming 36(2), 157–173 (1986)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Baños, R., Gil, C., Ortega, J., Montoya, F.G.: Multilevel heuristic algorithm for graph partitioning. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 143–153. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Bui, T.N., Moon, B.R.: Genetic algorithm and graph partitioning. IEEE Trans. Comput. 45(7), 841–855 (1996)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Programming 74, 247–267 (1996)MathSciNetMATHGoogle Scholar
  7. 7.
    Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: A computational study. Math. Programmming 81(2), 229–256 (1998)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)MATHGoogle Scholar
  9. 9.
    Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)MATHGoogle Scholar
  10. 10.
    Jünger, M., Martin, A., Reinelt, G., Weismantel, R.: Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Programmming B 63(3), 257–279 (1994)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Kohmoto, K., Katayaman, K., Narihisa, H.: Performance of a genetic algorithm for the graph partitioning problem. Math. Comput. Modelling 38(11-13), 1325–1333 (2003)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Maini, H., Mehrotra, K., Mohan, C., Ranka, S.: Genetic algorithms for graph partitioning and incremental graph partitioning. In: Supercomputing 1994: Proceedings of the 1994 ACM/IEEE conference on Supercomputing, pp. 449–457. ACM Press, New York (1994)Google Scholar
  13. 13.
    Puchinger, J., Raidl, G.R.: Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 41–53. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  14. 14.
    Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Glob. Optim. 29(2), 225–241 (2004)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Information available at URL http://www.cplex.com

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michael Armbruster
    • 1
  • Marzena Fügenschuh
    • 2
  • Christoph Helmberg
    • 1
  • Nikolay Jetchev
    • 2
  • Alexander Martin
    • 2
  1. 1.Department of MathematicsChemnitz University of TechnologyChemnitzGermany
  2. 2.Department of MathematicsDarmstadt University of TechnologyDarmstadtGermany

Personalised recommendations