Skip to main content
SpringerLink
Log in

Fragmentary Structures in Discrete Optimization Problems

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The paper considers a combinatorial object (a fragmentary structure) and investigates the properties of this object. It is shown that a number of discrete optimization problems can be considered as optimization problems on a fragmentary structure. Optimization problem reduces to an unconditional combinatorial optimization problem on a set of permutations. Variants of algorithms to find approximate solutions for optimization problems of fragmentary structure are proposed.

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. H. Whitney, “On the abstract properties of linear dependence,” Amer. J. of Mathematics, Vol. 57, No. 3, 509–533 (1935).

    Article  MathSciNet  MATH  Google Scholar 

  2. Â. Korte, L. Lovasz, and R. Schrader, Greedoids, Springer-Verlag, Berlin (1991).

    Book  MATH  Google Scholar 

  3. V. P. Il’ev, “Problems on independence systems solvable by greedy algorithm,” Diskr. Matem., Vol. 21, No. 4, 85–94 (2009).

    Article  MathSciNet  Google Scholar 

  4. V. A. Perepelitsa, Multicriteria Models and Methods for Optimization Problems on Graphs, LAP Lambert Academic Publ. GmbH&Co. KG, Saarbrucken (2013).

    Google Scholar 

  5. G. P. Donets, Graseful Tree Numbering [in Ukrainian], Kyiv (2017).

  6. J. F. Goncalves, “A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem,” Europ. J. of Operational Research, Vol. 183(3), 1212–1229 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  7. I. V. Kozin, “Evolutionary–fragmentary model of the pentomino packing problem,” Diskr. Analiz i Issled. Operatsii, Vol. 21, No. 6, 35– 50 (2014).

    MATH  Google Scholar 

  8. B. K. Lebedev and E. I. Voronin, “Genetic algorithm of the distribution of junctions over layers in multilayered global tracing VLSIC,” Izvestiya YuFU, Tekhnicheskie Nauki, Special Issue: Intellectual CAD Systems, No. 7 (132), 14–21 (2012).

  9. I. V. Kozin and E. V. Krivtsun, “Modeling of one-layer and two-layer tracings,” Upravl. Sistemy i Mashiny, No. 2, 58–64 (2016).

  10. N. K. Maksyshko and T. V. Zakhovalko, Models and Methods to Solve Applied Covering Problems on Graphs and Hypergraphs [in Ukrainian], Poligraph, Zaporozhye (2009).

    Google Scholar 

  11. P. Brucker, “On the complexity of clustering problems,” in: M. Beckmenn and H. P. Kunzi (eds.), Optimization and Operations Research, Lecture Notes in Economics and Mathematical Systems, Vol. 157, 45–54 (1978).

  12. R. Ruiz and C. Maroto, “A comprehensive review and evaluation of permutation flowshop heuristics,” Europ. J. of Operational Research, Vol. 165, 479–494 (2005).

  13. I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Challenges, Solution Methods, Analysis [in Russian], Naukova Dumka, Kyiv (2003).

    Google Scholar 

  14. J. H. Holland, Adaptation in Natural and Artificial Systems, MIT Press, Boston, MA (1992).

    Google Scholar 

  15. V. M. Kureichik, Genetic Algorithms. State of the Art. Problems. Prospects. Izvestiya RAN, TiSU, No. 1, 144–160 (1999).

  16. Ì. Dorigo, Optimization, Learning, and Natural Algorithms, PhD Thesis, Dipartimento di Elettronica, Politechnico Di Milano, Italy (1992).

  17. S. D. Shtovba, “Ant algorithms: Theory and application,” Programmirovanie, No. 4, 1–16 (2005).

Download references

Author information

Authors and Affiliations

  1. Zaporizhzhya National University, Zaporizhzhya, Ukraine

    I. V. Kozin, N. K. Maksyshko & V. A. Perepelitsa

Authors
  1. I. V. Kozin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. K. Maksyshko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. A. Perepelitsa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. V. Kozin.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, November–December, 2017, pp. 125–131.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kozin, I.V., Maksyshko, N.K. & Perepelitsa, V.A. Fragmentary Structures in Discrete Optimization Problems. Cybern Syst Anal 53, 931–936 (2017). https://doi.org/10.1007/s10559-017-9995-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-017-9995-6

Keywords

Search

Navigation