poster

Competitive simulated annealing and Tabu Search algorithms for the max-cut problem

Authors:

Emely Arráiz,

Oswaldo OlivoAuthors Info & Claims

GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation

Pages 1797 - 1798

https://doi.org/10.1145/1569901.1570167

Published: 08 July 2009 Publication History

Get Access

Abstract

The Max-Cut problem consists of partitioning the nodes of an undirected weighted graph into two subsets, such that the sum of the weights of the edges that connect two vertices in different partitions is maximized. It has applications in several fields like statistical physics, VLSI design, among others, and is known to be NP-Hard. We propose a Neighborhood generation method that balances diversity and quality of the obtained solutions. Consequently, the inclusion within Simulated Annealing and Tabu Search frameworks produces similar results to those reported by state-of-the-art methods such as VNSPR and Scatter Search, and in some cases improves them.

References

[1]

]]Arráiz, E., Olivo, O. Competitive Simulated Annealing and Tabu Search Algorithms for the Max-Cut Problem. www.ldc.usb.ve/~olivo/publications/ CompetitiveSAandTSforMaxCut.pdf

Digital Library

Google Scholar

[2]

]]Deza, M. and Laurent, M. Applications of Cut Polyhedra I. Journal of Computational Applied Math, 55(2):191--216, November 1994.

Digital Library

Google Scholar

[3]

]]Gaspero, L.D. and Schaerf, A. Tabu Search Techniques for Examination Timetabling. Lecture Notes in Computer Science, 2079:104--117, 2001.

Digital Library

Google Scholar

[4]

]]Glover, F. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. Discrete Applied Mathematics, 65(1--3):223--253, 1996.

Digital Library

Google Scholar

[5]

]]Helmberg, C. and Rendl, F. A Spectral Bundle Method for Semidefinite Programming. siopt, 10(3):673--696, 2000.

Digital Library

Google Scholar

[6]

]]Kahruman, S., Kolotoglu, E., Butenko, S. and Hicks, I.V. On Greedy Construction Heuristics for the MAX-CUT Problem. International Journal of Computational Science and Engineering, 3(3):211--218, 2007.

Digital Library

Google Scholar

[7]

]]Martí, R., Duarte, A. and Laguna, M. Advanced Scatter Search for the Max-Cut Problem. Informs Journal on Computing, page ijoc.1080.0275, 2008.

Digital Library

Google Scholar

Cited By

View all

Šević IJovanovic RUrošević DDavidović T(2024)Fixed Set Search Applied to the Max-Cut Problem2024 IEEE 8th Energy Conference (ENERGYCON)10.1109/ENERGYCON58629.2024.10488777(1-6)Online publication date: 4-Mar-2024
https://doi.org/10.1109/ENERGYCON58629.2024.10488777
Lin GZhu W(2018)A memetic algorithm for the max-cut problemInternational Journal of Computing Science and Mathematics10.1504/IJCSM.2015.0675446:1(69-77)Online publication date: 16-Dec-2018
https://dl.acm.org/doi/10.1504/IJCSM.2015.067544
Salto CAlba E(2018)Designing heterogeneous distributed GAs by efficiently self-adapting the migration periodApplied Intelligence10.1007/s10489-011-0297-936:4(800-808)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1007/s10489-011-0297-9
Show More Cited By

Index Terms

Competitive simulated annealing and Tabu Search algorithms for the max-cut problem
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
2. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms

Recommendations

A tabu search based hybrid evolutionary algorithm for the max-cut problem

Graphical abstractDisplay Omitted HighlightsWe design a hybrid evolutionary algorithm (TSHEA) for the max-cut problem.Results disclose TSHEA discovers new best solutions for 15 out of 91 instances.Analysis indicates the effectiveness of the designed key ...
An efficient tabu search for solving the uncapacitated single allocation hub location problem

Given an efficient tabu search the uncapacitated single allocation hub location problem.Given some new tabu rules.Given some new theoretical results for computing the changes in the objective function's value for three types of moves.Improved the best ...
A low-level hybridization between memetic algorithm and VNS for the max-cut problem
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation

The Max-Cut problem consists of finding a partition of the graph nodes into two subsets, such that the sum of the edge weights having endpoints in different subsets is maximized. This NP-hard problem for non planar graphs has different applications in ...

Comments

Information & Contributors

Information

Published In

GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation

July 2009

2036 pages

ISBN:9781605583259

DOI:10.1145/1569901

General Chair:
Franz Rothlauf
University of Mainz, Germany

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 July 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

GECCO09

Sponsor:

GECCO09: Genetic and Evolutionary Computation Conference

July 8 - 12, 2009

Québec, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
265
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Šević IJovanovic RUrošević DDavidović T(2024)Fixed Set Search Applied to the Max-Cut Problem2024 IEEE 8th Energy Conference (ENERGYCON)10.1109/ENERGYCON58629.2024.10488777(1-6)Online publication date: 4-Mar-2024
https://doi.org/10.1109/ENERGYCON58629.2024.10488777
Lin GZhu W(2018)A memetic algorithm for the max-cut problemInternational Journal of Computing Science and Mathematics10.1504/IJCSM.2015.0675446:1(69-77)Online publication date: 16-Dec-2018
https://dl.acm.org/doi/10.1504/IJCSM.2015.067544
Salto CAlba E(2018)Designing heterogeneous distributed GAs by efficiently self-adapting the migration periodApplied Intelligence10.1007/s10489-011-0297-936:4(800-808)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1007/s10489-011-0297-9
Xue LZeng RXu HHu ZWen Y(2017)Hypervolume-Based Multi-level Algorithm for the Bi-criteria Max-Cut ProblemBio-inspired Computing: Theories and Applications10.1007/978-981-10-7179-9_35(456-465)Online publication date: 9-Nov-2017
https://doi.org/10.1007/978-981-10-7179-9_35
Ma FHao J(2016)A multiple search operator heuristic for the max-k-cut problemAnnals of Operations Research10.1007/s10479-016-2234-0248:1-2(365-403)Online publication date: 1-Jun-2016
https://doi.org/10.1007/s10479-016-2234-0
Lin GZhu W(2014)Combining Clustered Adaptive Multistart and Discrete Dynamic Convexized Method for the Max-Cut ProblemJournal of the Operations Research Society of China10.1007/s40305-014-0045-z2:2(237-262)Online publication date: 17-Jun-2014
https://doi.org/10.1007/s40305-014-0045-z
Wei BYang MShen YRana RChou CHu WPetrioli CCox LWhitehouse K(2013)Real-time classification via sparse representation in acoustic sensor networksProceedings of the 11th ACM Conference on Embedded Networked Sensor Systems10.1145/2517351.2517357(1-14)Online publication date: 11-Nov-2013
https://dl.acm.org/doi/10.1145/2517351.2517357
Benlic UHao J(2013)Breakout Local Search for the Max-CutproblemEngineering Applications of Artificial Intelligence10.1016/j.engappai.2012.09.00126:3(1162-1173)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.engappai.2012.09.001
Salto CAlba ELuna FLanzi P(2011)Using landscape measures for the online tuning of heterogeneous distributed gasProceedings of the 13th annual conference companion on Genetic and evolutionary computation10.1145/2001858.2002070(691-694)Online publication date: 12-Jul-2011
https://dl.acm.org/doi/10.1145/2001858.2002070

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A tabu search based hybrid evolutionary algorithm for the max-cut problem

An efficient tabu search for solving the uncapacitated single allocation hub location problem

A low-level hybridization between memetic algorithm and VNS for the max-cut problem