Skip to main content
SpringerLink
Log in

A Two-Step Method for Solving Vector Optimization Problems on Permutation Configuration

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A class of problems of vector Euclidean combinatorial optimization is considered as problems of discrete optimization on the set of combinatorial configurations mapped into the Euclidean space. The properties of the graphs of combinatorial configurations used to describe the new method are given. A two-stage method for solving problems of vector Euclidean combinatorial optimization on combinatorial configurations of permutations is proposed. The results of the numerical experiment and their analysis are presented.

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. J. Jahn, Vector Optimization: Theory, Applications and Extensions, Springer-Verlag, Berlin–Heidelberg (2004).

    Book  Google Scholar 

  2. V. Emelichev, K. Kuzmin, and Y. Nikulin, “Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem,” Optimization, Vol. 54, No. 6, 545–561 (2005).

    Article  MathSciNet  Google Scholar 

  3. A. Engau and D. Sigler, “Pareto solutions in multicriteria optimization under uncertainty,” Europ. J. Oper. Research, Vol. 281, No. 2, 357–368 (2020).

    Article  MathSciNet  Google Scholar 

  4. M. Ehrgott and M. Wiecek, “Mutiobjective programming,” in: J. Figueira, S. Greco, and M. Ehrgott (eds.), Multiple Criteria Decision Analysis: State of the Art Surveys, Springer, New York (2005), pp. 667–708.

    Chapter  Google Scholar 

  5. V. V. Podinovski, “Decision making under uncertainty with unknown utility function and rank-ordered probabilities,” Europ. J. Oper. Research, Vol. 239, No. 2, 537–541 (2014).

    Article  MathSciNet  Google Scholar 

  6. K. Kuzmin, Y. Nikulin, and M. Makela, “On necessary and sufficient conditions of stability and quasistability in combinatorial multicriteria optimization,” Control and Cybernetics, Vol. 46, No. 4, 361–382 (2017).

    MathSciNet  MATH  Google Scholar 

  7. V. Emelichev and Yu. Nikulin, “On a quasistability radius for multicriteria integer linear programming problem of finding extremum solutions,” Cybern. Syst. Analysis, Vol. 55, No. 6, 949–957 (2019). https://doi.org/10.1007/s10559-019-00205-9.

    Article  MathSciNet  MATH  Google Scholar 

  8. I. V. Sergienko and V. A. Perepelitsa, “Polynomial and NP-full multiobjective problems of enumeration of alternatives,” in: Theory and Software Implementation of Discrete Optimization Methods [in Russian], V. M. Glushkov Inst. of Cybernetics, Kyiv (1989), pp. 58–69.

  9. M. Studniarski, L. Koliechkina, and E. Dvernaya, “Solving a combinatorial multiobjective optimization problem by genetic algorithm,” in: P. Kulczycki, P. Kowalski, and Sz. Łukasik (eds.), Contemporary Computational Science, Proc. 3rd Conf. on Inform. Technology, Systems Research and Computational Physics, Contemporary Computational Science (July 2–5, 2018, Kraców, Poland), Kraców (2018), pp. 144–156.

  10. E. G. Petrov, V. V. Kryuchkovskii, and K. E. Petrov, “Standard formalization of decision-making process under multicriteriality and interval uncertainty,” Problemy Inform. Tekhnol., No. 1, 7–13 (2014).

  11. I. V. Sergienko and V. P. Shilo, “Modern approaches to solving complex discrete optimization problems,” J. Autom. Inform. Sci., Vol. 48, No. 1, 15–24 (2016).

    Article  Google Scholar 

  12. N. V. Semenova and L. M. Kolechkina, Vector Problems of Discrete Optimization on Combinatorial Sets: Methods of Analysis and Solution [in Ukrainian], Naukova Dumka, Kyiv (2009).

    Google Scholar 

  13. L. N. Koliechkina and O. Pichugina, “Multiobjective optimization on permutations with applications,” DEStech Trans. on Comp. Sci. and Engineering, 61–75 (2018). https://doi.org/10.12783/dtcse/optim2018/27922.

  14. L. Koliechkina, O. Pichugina, and S. Yakovlev, “A graph-theoretic approach to multiobjective permutation-based optimization,” in: M. Jacimovic, M. Khachay, V. Malkova, and M. Posypkin (eds.), Optimization and Applications, Proc. 10th Intern. Conf. (OPTIMA 2019) (30 September–4 October, 2019, Petrovac, Montenegro), Springer Intern. Publ., Cham (2020), pp. 383–400.

  15. N. V. Semenova, L. N Kolechkina, and A. N. Nagornaya, “Solution and investigation of vector problems of combinatorial optimization on a set of permutations,” J. Autom. Inform. Sci., Vol. 40, No. 12, 67–80 (2008).

  16. N. V. Semenova and L. N. Kolechkina, “A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements,” Cybern. Syst. Analysis, Vol. 45, No. 3, 438–445 (2009). https://doi.org/10.1007/s10559-009-9110-8.

    Article  MATH  Google Scholar 

  17. N. V. Semenova, L. N. Kolechkina, and A. N. Nagornaya, “On approach to solving vector problems with fractionally linear functions of the criteria on the combinatorial set of arrangements,” J. Autom. Inform. Sci., Vol. 42, No. 2, 67–80 (2010).

    Article  Google Scholar 

  18. L. Koliechkina, O. A. Dvirna, and A. N. Nahirna, “Construction of a mathematical model of multiobjective optimization on permutations,” Control Systems and Computers, No. 2 (286), 23–29 (2020).

  19. Y. G. Stoyan and S. V. Yakovlev, “Theory and methods of Euclidian combinatorial optimization: Current status and prospects,” Cybern. Syst. Analysis, Vol. 56, No. 3, 366–379 (2020). https://doi.org/10.1007/s10559-020-00253-6.

    Article  MATH  Google Scholar 

  20. Y. G. Stoyan, S. V. Yakovlev, and O. S. Pichugina, The Euclidean Combinatorial Configurations, Constanta, Kharkiv (2017).

    Google Scholar 

  21. S. V. Yakovlev, “Formalization of spatial configuration optimization problems with a special function class,” Cybern. Syst. Analysis, Vol. 55, No. 4, 581–589 (2019). https://doi.org/10.1007/s10559-019-00167-y.

    Article  MathSciNet  MATH  Google Scholar 

  22. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, Springer-Verlag, Berlin–Heidelberg (2018).

    Book  Google Scholar 

  23. P. M. Pardalos, D-Z. Du, and R. L. Graham, Handbook of Combinatorial Optimization, Springer-Verlag, New York (2013).

  24. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Publications, Mineola (2013).

    MATH  Google Scholar 

  25. S. Butenko, P. M. Pardalos, and V. Shylo, Optimization Methods and Applications: in Honor of Ivan V. Sergienko’s 80th Birthday, Springer Intern. Publ., New York (2017). https://doi.org/10.1007/978-3-319-68640-0.

  26. L. Hulianytskyi and I. Riasna, “Formalization and classification of combinatorial optimization problems,” in: S. Butenko, P. M. Pardalos, and V. Shylo (eds.), Optimization Methods and Applications, Springer Intern. Publ., New York (2017), pp. 239–250.

  27. G. P. Donets and L. M. Kolechkina, Extremum Problems on Combinatorial Configurations [in Ukrainian], RVV PUET, Poltava (2011).

    Google Scholar 

  28. L. Koliechkina and O. Pichugina, “A horizontal method of localizing values of a linear function in permutation-based optimization,” in: H. A. Le Thi, H. M. Le, and T. Pham Dinh (eds.), Optimization of Complex Systems: Theory, Models, Algorithms and Applications, Springer Intern. Publ., Cham (2020), pp. 355–364.

  29. L. N. Koliechkina, O. A. Dvernaya, and A. N. Nagornaya, “Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations,” Cybern. Syst. Analysis, Vol. 50, No. 4, 620–626 (2014). https://doi.org/10.1007/s10559-014-9650-4.

    Article  MATH  Google Scholar 

  30. S. Yakovlev, O. Pichugina, and L. Koliechkina, “A lower bound for optimization of arbitrary function on permutations,” Lecture Notes in Computational Intelligence and Decision Making, Proc. Intern. Sci. Conf. “Intellectual Systems of Decision Making and Problem of Computational Intelligence” (ISDMCI 2020) (May 25–29, 2020, Zalizniy Port, Ukraine), Zalizniy Port (2020), pp. 195–212.

  31. G. P. Donets, L. N. Koliechkina, and A. N. Nahirna, “A method to solve conditional optimization problems with quadratic objective functions on the set of permutations,” Cybern. Syst. Analysis, Vol. 56, No. 2, 278–288 (2020). https://doi.org/10.1007/s10559-020-00243-8.

    Article  MATH  Google Scholar 

  32. L. N. Koliechkina and A. N. Nahirna, “Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations,” Cybern. Syst. Analysis, Vol. 56, No. 3, 455–465 (2020). https://doi.org/10.1007/s10559-020-00261-6.

    Article  MATH  Google Scholar 

  33. L. N. Koliechkina and O. A. Dvirna, “Solving extremum problems with linear fractional objective functions on the combinatorial configuration of permutations under multicriteriality,” Cybern. Syst. Analysis, Vol. 53, No. 4, 590–599 (2017). https://doi.org/10.1007/s10559-017-9961-3.

    Article  MATH  Google Scholar 

  34. L. N. Koliechkina, A. N. Nagornaya, and V. V. Semenov, “Method of solving problem of conditional optimization on combinatorial set of arrangements,” J. Autom. Inform. Sci., Vol. 51, No. 8, 31–42 (2019).

    Article  Google Scholar 

  35. V. A. Yemelichev, M. M. Kovalev, and M. K. Kravtsov, Polytopes, Graphs and Optimization, Cambridge Univ. Press, Cambridge (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Uniwersytet Łódzki (University of Lodz), Lodz, Poland

    L. N. Koliechkina

  2. Poltava University of Economics and Trade, Poltava, Ukraine

    O. A. Dvirna & S. V. Khovben

Authors
  1. L. N. Koliechkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. A. Dvirna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. V. Khovben
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. N. Koliechkina.

Additional information

Translated from Kibernetyka ta Systemnyi Analiz, No. 3, May–June, 2021, pp. 121–134.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Koliechkina, L.N., Dvirna, O.A. & Khovben, S.V. A Two-Step Method for Solving Vector Optimization Problems on Permutation Configuration. Cybern Syst Anal 57, 442–454 (2021). https://doi.org/10.1007/s10559-021-00369-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-021-00369-3

Keywords

Search

Navigation