A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-16, 16 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-06-03
Country of Publication
Egypt
No. of Pages
16
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Ling, Aifan. 2012. A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section. Mathematical Problems in Engineering،Vol. 2012, no. 2012, pp.1-16.
https://search.emarefa.net/detail/BIM-1001627
Modern Language Association (MLA)
Ling, Aifan. A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section. Mathematical Problems in Engineering No. 2012 (2012), pp.1-16.
https://search.emarefa.net/detail/BIM-1001627
American Medical Association (AMA)
Ling, Aifan. A VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section. Mathematical Problems in Engineering. 2012. Vol. 2012, no. 2012, pp.1-16.
https://search.emarefa.net/detail/BIM-1001627
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1001627