Skip to main content
SpringerLink
Log in

Kernel Technology to Solve Discrete Optimization Problems

  • SYSTEMS ANALYSIS
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The kernel technology is proposed to solve discrete optimization problems. It forms solution kernel and allows efficient stochastic perturbations of this solution in iterative schemes. Comparative analysis of the two versions of the new algorithm for the quadratic assignment problem (with and without kernel allocation technology) and modern algorithms demonstrated the efficiency of this technology in terms of speed and solution quality. The kernel technology can be easily incorporated into the available algorithms.

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. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Books on Computer Science, Dover Publ. (1998).

  2. V. P. Shylo, “The method of global equilibrium search,” Cybern. Syst. Analysis, Vol. 35, No. 1, 68–74 (1999).

    Article  MathSciNet  Google Scholar 

  3. R. E. Burkard, “Quadratic assignment problems,” European J. of Oper. Res., Vol. 15, 283–289 (1984).

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

    Article  MathSciNet  Google Scholar 

  5. V. P. Shylo and O. V. Shylo, “Solving unconstrained binary quadratic programming problems by global equilibrium search,” Cybern. Syst. Analysis, Vol. 47, No. 6, 889–897 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  6. P. M. Pardalos and O. V. Shylo, “An algorithm for the job shop scheduling problem based on global equilibrium search techniques,” Computational Management Science, Vol. 3, No. 4, 331–348 (2006).

    Article  MathSciNet  MATH  Google Scholar 

  7. U. Benlic and J. K. Hao, “Memetic search for the quadratic assignment problem,” Expert Systems with Applications, Vol. 42, No. 1, 584–595 (2015).

  8. T. James, C. Rego, and F. Glover, “A cooperative parallel tabu search algorithm for the quadratic assignment problem,” European J. of Oper. Res., Vol. 195, No. 3, 810–826 (2009).

  9. A. Misevicius and B. Kilda, “Iterated tabu search: An improvement to standard tabu search,” Information Technology and Control, Vol. 35, No. 3, 187–197 (2006).

  10. A. Misevicius, “An improved hybrid genetic algorithm: New results for the quadratic assignment problem,” Knowledge Based Systems, Vol. 17, No. 2–4, 65–73 (2004).

    Article  Google Scholar 

  11. U. Benlic and J. K. Hao, “Breakout local search for the quadratic assignment problem,” Applied Math. and Computation, Vol. 219, No. 9, 4800–4815 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  12. T. Stutzle, “Iterated local search for the quadratic assignment problem,” European J. of Oper. Res., Vol. 174, No. 3, 1519–1539 (2006).

  13. F. Glover and M. Laguna, Tabu Search. Kluwer Academic Publishers, Boston (1997).

    Book  MATH  Google Scholar 

  14. V. P. Shylo, F. Glover, and I. V. Sergienko, “Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel,” Cybern. Syst. Analysis, Vol. 51, No. 1, 16–24 (2015).

    Article  MATH  Google Scholar 

  15. V. P. Shylo and O. V. Shylo, “Algorithm portfolios and teams in parallel optimization,” in: S. Butenko, P. M. Pardalos, and V. Shylo (eds.), Optimization Methods and Applications, Springer, New York (2017), pp. 453–465.

Download references

Author information

Authors and Affiliations

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

    I. V. Sergienko & V. P. Shylo

Authors
  1. I. V. Sergienko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. P. Shylo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. V. Sergienko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, November–December, 2017, pp. 73–83.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sergienko, I.V., Shylo, V.P. Kernel Technology to Solve Discrete Optimization Problems. Cybern Syst Anal 53, 884–892 (2017). https://doi.org/10.1007/s10559-017-9990-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-017-9990-y

Keywords

Search

Navigation