[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A New Method, the Fusion Fission, for the Relaxed k-way Graph Partitioning Problem, and Comparisons with Some Multilevel Algorithms

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

In this paper a new graph partitioning problem is introduced, the relaxed k-way graph partitioning problem. It is close to the k-way, also called multi-way, graph partitioning problem, but with relaxed imbalance constraints. This problem arises in the air traffic control area. A new graph partitioning method is presented, the Fusion Fission, which can be used to resolve the relaxed k-way graph partitioning problem. The Fusion Fission method is compared to classical Multilevel packages and with a Simulated Annealing algorithm. The Fusion Fission algorithm and the Simulated Annealing algorithm, both require a longer computation time than the Multilevel algorithms, but they also find better partitions. However, the Fusion Fission algorithm partitions the graph with a smaller imbalance and a smaller cut than Simulated Annealing does.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alpert, C.J., Huang, J.-H., Kahng, A.B.: Multilevel circuit partitioning. In: DAC, pp. 530–533 (1997)

  2. Bichot, C.-E., Alliot, J.-M. : A theoretical approach to defining the European Core Area. Technical report, LOG–ENAC/CENA (2005)

  3. Dhillon, I., Guan, Y., Kullis, B.: Kernel k-means, spectral clustering, and normalized cuts. In: ACM International Conference on Knowledge Discovery and Data Mining (2004)

  4. Diekmann, R., Monien, B., Preis, R.: Using Helpful Sets to Improve Graph Bisections. American Mathematical Society, Providence, RI (1995)

    Google Scholar 

  5. Eurocontrol: The impact of fragmentation in European ATM/CNS. Technical report, Eurocontrol (2006)

  6. FAA: Air Traffic ControL: FAA Order 7110.65K. Federal Aviation Administration (U.S. Department of Transportation) (1997)

  7. Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: ACM Design Automation Conference, pp. 175–181 (1982)

  8. Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comp. Sci. 1(3), 237–267 (1976)

    Article  MATH  Google Scholar 

  9. Greene, W.A.: Genetic algorithms for partitioning sets. Int. J. Artif. Intell. Tools 10(1–2), 225–241 (2001)

    Article  Google Scholar 

  10. Hallgren, A.: Restructuring European airspace: functional airspace blocks. Skyway, 20–22 (2005)

  11. Hendrickson, B., Leland, R.: The chaco users guide. Sandia National Laboratories, 2.0 edition (1995a)

  12. Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: ACM/IEEE Conference on Supercomputing (1995b)

  13. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; Part I, graph partitioning. Oper. Res. (Society of America) 37(6), 865–892 (1989)

    MATH  Google Scholar 

  14. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998a)

    Article  Google Scholar 

  15. Karypis, G., Kumar, V.: METIS : a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. University of Minnesota, 4.0 edition (1998b)

  16. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)

    Google Scholar 

  17. Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  Google Scholar 

  18. Kuntz, P., Layzell, P., Snyers, D.: A colony of ant-like agents for partitioning in VLSI technology. In: The Fourth European Conference on Artificial Life, pp. 417–424 (1997)

  19. Langham, A.E., Grant, P.W.: A multilevel k-way partitioning algorithm for finite element meshes using competing ant colonies. In: The Genetic and Evolutionary Computation Conf., vol. 2., pp. 1602–1608. Orlando, FL (1999a)

  20. Langham, A.E., Grant, P.W.: A multilevel k-way partitioning algorithm for finite element meshes using competing ant colonies. In: ACM GECCO (1999b)

  21. Pellegrini, F.: Schotch and LibScotch. ENSEIRB–LaBRI, Universit de Bordeaux I, 4.0 edition (2006)

  22. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)

    Article  Google Scholar 

  23. Soper, A., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Glob. Optim. 29, 225–241 (2004)

    Article  MATH  Google Scholar 

  24. Talbi, E.G., Bessiere, P.: A parallel genetic algorithm for the graph partitioning problem. In: Proceedings of the ACM International Conference on Supercomputing. ACM, Cologne (1991)

    Google Scholar 

  25. Walshaw, C.: The serial JOSTLE library user guide. University of Greenwich, 3.0 edition (2002)

  26. Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Ann. Oper. Res. 131, 325–372 (2004)

    Article  MATH  Google Scholar 

  27. Walshaw, C., Cross, M., McManus, K.: Multiphase mesh partitioning. Appl. Math. Model. 25, 123–140 (2000)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LOG (DSNA–ENAC), 7 av. Edouard Belin, 31000, Toulouse, France

    Charles-Edmond Bichot

Authors
  1. Charles-Edmond Bichot
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Charles-Edmond Bichot.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bichot, CE. A New Method, the Fusion Fission, for the Relaxed k-way Graph Partitioning Problem, and Comparisons with Some Multilevel Algorithms. J Math Model Algor 6, 319–344 (2007). https://doi.org/10.1007/s10852-007-9059-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-007-9059-4

Keywords

Mathematics Subject Classifications (2000)

Search

Navigation