IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/475018.html
   My bibliography  Save this article

A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section

Author

Listed:
  • Ai-fan Ling

Abstract

A heuristic algorithm based on VNS is proposed to solve the Max 3-cut and Max 3-section problems. By establishing a neighborhood structure of the Max 3-cut problem, we propose a local search algorithm and a variable neighborhood global search algorithm with two stochastic search steps to obtain the global solution. We give some numerical results and comparisons with the well-known 0.836-approximate algorithm. Numerical results show that the proposed heuristic algorithm can obtain efficiently the high-quality solutions and has the better numerical performance than the 0.836-approximate algorithm for the NP-Hard Max 3-cut and Max 3-section problems.

Suggested Citation

  • Ai-fan Ling, 2012. "A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section," Mathematical Problems in Engineering, Hindawi, vol. 2012, pages 1-16, August.
    • Handle: RePEc:hin:jnlmpe:475018
    DOI: 10.1155/2012/475018
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2012/475018.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2012/475018.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/475018?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:475018. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.