Skip to main content
SpringerLink
Log in

Teams of Global Equilibrium Search Algorithms for Solving the Weighted Maximum Cut Problem in Parallel

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

This paper investigates the impact of communication between optimization algorithms running in parallel. In particular, we focus on the weighted maximum cut (WMAXCUT) problem and compare different communication strategies between teams of GES algorithms running in parallel. The results obtained by teams encourage the development of team algorithms. They were significantly better than the algorithmic portfolio (no communication) approach and suggest that the communication between algorithms running in parallel is a promising research direction.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. P. Shylo and O. V. Shylo, “Solving the maxcut problem by the global equilibrium search,” Cybernetics and Systems Analysis, 46, No. 5, 744–754 (2010).

    Article  MATH  MathSciNet  Google Scholar 

  2. I. V. Sergienko and V. P. Shylo, Discrete Optimization Problems: Challenges, Solution Techniques, and Analysis [in Russian], Naukova Dumka, Kiev (2003).

    Google Scholar 

  3. V. P. Shylo, “The method of global equilibrium search,” Cybernetics and Systems Analysis, 35, No. 1, 68–74 (1999).

    Article  MathSciNet  Google Scholar 

  4. V. P. Shylo, O. V. Shylo, and V. A. Roschyn, “Solving weighted max-cut problem by global equilibrium search,” Cybernetics and Systems Analysis, 48, No. 4, 563–567 (2012).

    Article  MathSciNet  Google Scholar 

  5. V. P. Shylo and O. V. Shylo, “Path relinking scheme for the max-cut problem within global equilibrium search,” International J. of Swarm Intelligence Research (IJSIR), 2, No. 2, 42–51 (2011).

    Article  Google Scholar 

  6. F. Barahona, M. Grotschel, M. Juger, and G. Reinelt, “An application of combinatorial optimization to statistical physics and circuit layout design,” Operations Research, 36, 493–513 (1988).

    Article  MATH  Google Scholar 

  7. C. Helmberg and F. Rendl, “A spectral bundle method for semidefinite programming,” SIAM J. on Optimization, 10, No. 3, 673–696 (2000).

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Karp, “Reducibility among combinatorial problems” in: R. Miller and J. Thatcher (eds.), Complexity of Computer Computations, Plenum (1972), pp. 85–103.

  9. F. Hadlock, “Finding a maximum cut of a planar graph in polynomial time,” SIAM J. Comput., 4, No. 3, 221–225 (1975).

    Article  MATH  MathSciNet  Google Scholar 

  10. K. Krishnan and J. E. Mitchell, “A semidefinite programming based polyhedral cut and price approach for the maxcut problem,” Comput. Optim. Appl., 33, No. 1, 51–71 (2006).

    Article  MATH  MathSciNet  Google Scholar 

  11. M. X. Goemans and D. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” Journal of the ACM, 42, No. 6, 1115–1145 (1995).

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Marti, A. Duarte, and M. Laguna, “Advanced scatter search for the max-cut problem,” INFORMS J. on Computing, 21, 26–38 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  13. S. Burer, R. D. C. Monteiro, and Y. Zhang, “Rank-two relaxation heuristics for max-cut and other binary quadratic programs,” SIAM J. on Optimization, 12, 503–521 (2002).

    Article  MathSciNet  Google Scholar 

  14. P. Festa, P. M. Pardalos, M. G. C. Resende, and C. C. Ribeiro, “Randomized heuristics for the maxcut problem,” Optimization Methods and Software, 7, 1033–1058 (2002).

    Article  MathSciNet  Google Scholar 

  15. G. Palubeckis and V. Krivickiene, “Application of multistart tabu search to the max-cut problem,” Information Technology and Control, 31, No. 2, 29–35 (2004).

    Google Scholar 

  16. S. Kahruman, E. Kolotoglu, S. Butenko, and I. V. Hicks, “On greedy construction heuristics for the max-cut problem.,” Int. J. Comput. Sci. Eng., 3, No. 3, 211–218 (2007).

    Google Scholar 

  17. O. V. Shylo, O. A. Prokopyev, and J. Rajgopal, “On algorithm portfolios and restart strategies,” Operations Research Letters. 39, No.1, 49–52 (2011).

    Article  MATH  MathSciNet  Google Scholar 

  18. O. Mostovyi, O. A. Prokopyev, and O. V. Shylo, “On maximum speedup ratio of restart algorithm portfolios,” INFORMS Journal on Computing, 25, No. 2, 222–229 (2013).

    Article  MathSciNet  Google Scholar 

  19. V. P. Shylo, V. O. Roschyn, and P. V. Shylo, “Construction of an algorithm portfolio for the parallelization of the process of solving the WMAXCUT problem,” in: Computer Mathematics [in Russian], No. 2, 163–170, V. M. Glushkov Inst. Cybern. of NAS of Ukraine, Kiev (2014).

  20. F. Glover, M. Laguna, and R. Marti, “Fundamentals of scatter search and path relinking,” Control and Cybernetics, 39, 653–684 (2000).

    MathSciNet  Google Scholar 

  21. U. Benlic and J. K. Hao, “Breakout local search for the max-cut problem,” J. Engineering Applications of Artificial Intelligence, 26, No. 3, 1162–1173 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    V. P. Shylo & I. V. Sergienko

  2. University of Colorado, Boulder, USA

    F. Glover

Authors
  1. V. P. Shylo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Glover
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. I. V. Sergienko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. P. Shylo.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 20–29, January–February, 2015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shylo, V.P., Glover, F. & Sergienko, I.V. Teams of Global Equilibrium Search Algorithms for Solving the Weighted Maximum Cut Problem in Parallel. Cybern Syst Anal 51, 16–24 (2015). https://doi.org/10.1007/s10559-015-9692-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-015-9692-2

Keywords

Search

Navigation