IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v56y2005i5d10.1057_palgrave.jors.2601837.html
   My bibliography  Save this article

Multilevel graph partitioning: an evolutionary approach

Author

Listed:
  • S Küçükpetek

    (Middle East Technical University)

  • F Polat

    (Middle East Technical University)

  • H Oğuztüzün

    (Middle East Technical University)

Abstract

The graph partitioning problem is defined as that of dividing the vertices of an undirected graph into a set of balanced parts through the removal of a set of edges, whose size is to be minimized. A number of researchers have investigated multilevel schemes, which coarsen the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partitioning of the original graph. In this paper, a genetic algorithm for the coarsening phase of a multilevel scheme for graph partitioning is presented. The proposed approach has been demonstrated to improve the solution quality at the expense of running time.

Suggested Citation

  • S Küçükpetek & F Polat & H Oğuztüzün, 2005. "Multilevel graph partitioning: an evolutionary approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 549-562, May.
    • Handle: RePEc:pal:jorsoc:v:56:y:2005:i:5:d:10.1057_palgrave.jors.2601837
    DOI: 10.1057/palgrave.jors.2601837
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601837
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601837?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1989. "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning," Operations Research, INFORMS, vol. 37(6), pages 865-892, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A Awasthi & S S Chauhan & M Parent & Jean-Marie Proth, 2010. "Algorithms for partitioning of large routing networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1159-1167, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maria da Conceição Cunha, 1999. "On Solving Aquifer Management Problems with Simulated Annealing Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 13(3), pages 153-170, June.
    2. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
    3. Dell'Amico, Mauro & Trubian, Marco, 1998. "Solution of large weighted equicut problems," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 500-521, April.
    4. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
    5. Orlin, James & Sharma, Dushyant, 2003. "The Extended Neighborhood: Definition And Characterization," Working papers 4392-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    6. Melissa Gama & Bruno Filipe Santos & Maria Paola Scaparra, 2016. "A multi-period shelter location-allocation model with evacuation orders for flood disasters," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 299-323, September.
    7. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    8. M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
    9. Antunes, Antonio & Peeters, Dominique, 2001. "On solving complex multi-period location models using simulated annealing," European Journal of Operational Research, Elsevier, vol. 130(1), pages 190-201, April.
    10. Chang-Yong Lee & Dongju Lee, 2014. "Determination of initial temperature in fast simulated annealing," Computational Optimization and Applications, Springer, vol. 58(2), pages 503-522, June.
    11. Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
    12. Noureddine Bouhmala, 2019. "Combining simulated annealing with local search heuristic for MAX-SAT," Journal of Heuristics, Springer, vol. 25(1), pages 47-69, February.
    13. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
    14. Yiyo Kuo, 2014. "Design method using hybrid of line-type and circular-type routes for transit network system optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 600-613, July.
    15. Doole, Graeme J., 2007. "A primer on implementing compressed simulated annealing for the optimisation of a constrained simulation model in Microsoft Excel," Working Papers 7420, University of Western Australia, School of Agricultural and Resource Economics.
    16. F. Martinelli, 1999. "Stochastic Comparison Algorithm for Discrete Optimization with Estimation of Time-Varying Objective Functions," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 137-159, October.
    17. Gabriel M. Portal & Marcus Ritt & Leonardo M. Borba & Luciana S. Buriol, 2016. "Simulated annealing for the machine reassignment problem," Annals of Operations Research, Springer, vol. 242(1), pages 93-114, July.
    18. Graeme J. Doole & David J. Pannell, 2008. "Optimisation of a Large, Constrained Simulation Model using Compressed Annealing," Journal of Agricultural Economics, Wiley Blackwell, vol. 59(1), pages 188-206, February.
    19. LeBlanc, Larry J. & Shtub, Avraham & Anandalingam, G., 1999. "Formulating and solving production planning problems," European Journal of Operational Research, Elsevier, vol. 112(1), pages 54-80, January.
    20. Alex Bonutti & Sara Ceschia & Fabio De Cesco & Nysret Musliu & Andrea Schaerf, 2017. "Modeling and solving a real-life multi-skill shift design problem," Annals of Operations Research, Springer, vol. 252(2), pages 365-382, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:56:y:2005:i:5:d:10.1057_palgrave.jors.2601837. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.