Abstract
The statement of the problem with quadratic fractional objective function on the set of permutations is considered. An algorithm for its solution is presented, which converts the quadratic fractional function into a system of two functionals. The solution of these functionals ensures finding the optimal solution to the problem. The results of computing experiments are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, Springer, Heidelberg–New York (2012).
G. C. Onwubolu and D. Davendra, Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization, Springer-Verlag, Berlin–Heidelberg (2009).
P. M. Pardalos, D. Du, and R. L. Graham, Handbook of Combinatorial Optimization, Springer, New York (2013).
L. F. Gulianitsky and I. V. Sergienko, “Meta-evolutionary method of deformed polyhedron in combinatorial optimization,” Cybern. Syst. Analysis, Vol. 44, No. 6, 70–79 (2007).
G. A. Donets and I. V. Sergienko, “A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems,” Cybern. Syst. Analysis, Vol. 50, No. 1, 2–7 (2014).
Y. G. Stoyan, S. V. Yakovlev, and O. V. Parshin, “Quadratic optimization on combinatorial sets in Rn” Cybern. Syst. Analysis, Vol. 27, No. 4, 561–567 (1991).
S. V. Yakovlev, N. I. Gil’, V. M. Komyak, and I. V. Aristova, Elements of the Theory of Geometrical Design [in Russian], Naukova Dumka, Kyiv (1995).
N. Z. Shor and P. I. Stetsyuk, “Lagrangian bounds n multiextremal polynomial and discrete optimization problems,” J. of Global Optimization, No. 23, 1–41 (2002).
G. Donets and L. M. Koliechkina, Extremum Problems on Combinatorial Configurations [in Ukrainian], PUET, Poltava (2011).
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, Optimization [in Russian], Nauka, Moscow (1981).
Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods of Geometrical Design [in Russian], Naukova Dumka, Kyiv (1986).
Yu. G. Stoyan and O. O. Emets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], ISDO, Kyiv (1993).
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).
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).
L. Koliechkina and O. Pichugina, “Multiobjective optimization on permutations with applications,” Destech Transactions on Computer Science and Engineering, 61–75 (2018). https://doi.org/10.12783/dtcse/optim2018/ 27922.
G. A. Donets and L. N. Kolechkina, “On one problem of optimization of a linear fractional function on permutations,” J. Autom. Inform. Sci., Vol. 42, No. 4, 1–12 (2010).
O. A. Emets and L. N. Kolechkina, “Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations,” Cybern. Syst. Analysis, Vol. 40, No. 3, 329–339 (2004).
N. Z. Shor and D. I. Solomon, Decomposition Methods in Linear Fractional Programming [in Russian], Shtiintsa, Kishinev (1989).
I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods of Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kyiv (1981).
O. A. Emets and O. A. Chernenko, Optimization of Linear Fractional Functions on Permutations [in Russian], Naukova Dumka, Kyiv (2011).
N. V. Semenova, L. M. Koliechkina, and A. M. Nahirna, “Solving vector optimization problems with linear fractional criteria functions on the combinatorial set of polypermutations,” Nauk. Visti Nats. Tekhn. Univers. Ukr. “Kyivs’kyi Politekhn. Instytut,” No. 2, 53–60 (2009).
N. V. Semenova, L. N. Kolechkina, and A. N. Nagornaya, “One 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).
L. Koliechkina, A. Nahirna, and O. Dvirna, “Quadratic optimization problem on permutation set with simulation of applied tasks,” in: Proc. 2nd Intern. Workshop on Computer Modeling and Intelligent Systems (CMIS-2019), Zaporizhzhia, Ukraine, April 15–19, 2019 (CEUR Workshop Proceedings, Vol. 2353) (2019), pp. 651–663. URL: http://ceur-ws.org/Vol-2353/paper52.pdf.
R. E. Burkard, “Quadratic assignment problems,” in: P. M. Pardalos, D.-Z. Du, and R. L. Graham (eds.), Handbook of Combinatorial Optimization, Springer, New York (2013), pp. 2741–2814. 10.1007/ 978-1-4419-7997-1_22.
P. Amaral, I. Bomze, and J. Judice, “Copositivity and constrained fractional quadratic problems,” Mathematical Programming, Vol. 146, 325–350 (2014).
L. N. Kolechkina, 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).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2020, pp. 129–140.
Rights and permissions
About this article
Cite this article
Koliechkina, L., Nahirna, A. Solutions of the Combinatorial Problem with a Quadratic Fractional Objective Function on the Set of Permutations. Cybern Syst Anal 56, 455–465 (2020). https://doi.org/10.1007/s10559-020-00261-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-020-00261-6