PERMANENT DECOMPOSITION ALGORITHM FOR THE COMBINATORIAL OBJECTS GENERATION

Authors

  • Y. V. Turbal National University of Water and Environmental Engineering, Rivne, Ukraine, Ukraine
  • S. V. Babych College of National University of Life and Environmental Sciences of Ukraine, Rivne, Ukraine, Ukraine
  • N. E. Kunanets National University “Lviv Polytechnic”, Lviv, Ukraine, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2022-4-10

Keywords:

algorithm, permutation, permanent, decomposition, complexity

Abstract

Context. The problem of generating vectors consisting of different representatives of a given set of sets is considered. Such problems arise, in particular, in scheduling theory, when scheduling appointments. A special case of this problem is the problem of generating permutations.

Objective. Problem is considered from the point of view of a permanent approach and a well-known one, based on the concept of lexicographic order.

Method. In many tasks, it becomes necessary to generate various combinatorial objects: permutations, combinations with and without repetitions, various subsets. In this paper we consider a new approach to the combinatorial objects generation, which is based on the procedure of the permanent decomposition. Permanent is built for the special matrix of incidence. The main idea of this approach is including to the process of the algebraic permanent decomposition by row additional function for the column identifiers writing into corresponding data structures. In this case, the algebraic permanent in not calculated, but we get a specific recursive algorithm for generating a combinatorial object. The computational complexity of this algorithm is analyzed.

Results. It is investigated a new approach to the generation of complex combinatorial objects, based on the procedure of decomposition of the modified permanent of the incidence matrix by line with memorization of index elements.

Conclusions. The permanent algorithms of the combinatorial objects generation is investigated. The complexity of our approach in the case of permutation is compared with the lexicographic algorithm and the Johnson-Trotter algorithm.

The obtained results showed that our algorithm belongs to the same complexity class as the lexicographic algorithm and the Johnson-Trotter method. Numerical results confirmed the effectiveness of our approach.

Author Biographies

Y. V. Turbal, National University of Water and Environmental Engineering, Rivne, Ukraine

Dr. Sc., Professor of Computer Science and Applied Mathematics Department

S. V. Babych, College of National University of Life and Environmental Sciences of Ukraine, Rivne, Ukraine

Programming Department

N. E. Kunanets, National University “Lviv Polytechnic”, Lviv, Ukraine

Dr. Sc., Professor of Department of Information Systems and Networks

References

Bacchelli S., Barcucci E., Grazzini E., Pergola E. Exhaustive generation of combinatorial objects by ECO, Acta Informatica, 2004, Vol. 40, pp. 585–602.

Bacchelli S., Ferrari L., Pinzani R., Sprugnoli R. Mixed succession rules: The commutative case, Journal of Combinatorial Theory, 2010, Vol. 117, Series A, pp. 568– 582. DOI: 10.1016/j.jcta.2009.11.005

Barcucci E., Del Lungo A., Pergola E., Pinzani R. ECO: A methodology for the enumeration of combinatorial objects, Journal of Difference Equations and Applications, 1999, Vol. 5, pp. 435–490.

Del Lungo A., Duchi E., Frosini A., Rinaldi S. On the generation and enumeration of some classes of convex polyominoes, The Electronic Journal of Combinatorics, 2011, Vol. 11, № 1, pp. 1–46. DOI: 10.37236/1813

Arnaw Wadhonkar, Theng Deepti A Task Scheduling Algorithm Based on Task Length and Deadline in Cloud Computing, International Journal of Scientific & Engineering Research, 2016, Vol. 7, № 4, pp. 1905–1909.

Knuth D. E. The Art of Computer Programming, Vol. 4A : Combinatorial Algorithms Part 1. Boston, Addison-Wesley Professional, 2011.

Ruskey F. Combinatorial Generation. Working Version (1jCSC 425/520) [Electronic resourse], Department of Computer Science University of Victoria, 2003. Access mode: http://page.math.tu-berlin.de/~felsner/SemWS1718/Ruskey-Comb-Gen.pdf. Accessed 1 May 2020.

Kruchinin V. V. Methods for Developing Algorithms for Ranking and Unranking Combinatorial Objects Based on AND/OR Trees. Tomsk, V-Spektr, 2007.

Shablya Y., Kruchinin D., Kruchinin V. Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application, Mathematics, 2020, Vol. 8, № 962. DOI: 10.3390/math8060962

Flajolet P., Zimmerman P., Cutsem B. A calculus for the random generation of combinatorial structures, Theoretical Computer Science, 1994, Vol. 132, pp. 1–35.

Xin Chen, Yan Lan, Attila Benkő, György Dósa, Xin Han Optimal algorithms for online scheduling with bounded rearrangement at the end, Theoretical Computer Science. 2011, Vol. 412, No. 45, pp. 6269–6278. DOI: 10.1016/j.tcs.2011.07.014

Do P. T., Tran T. T. H, Vajnovszki V. Exhaustive generation for permutations avoiding (colored) regular sets of patterns, Discrete Applied Mathematics, 2019, Vol. 268. pp. 44–53.

Mirshekarian Sadegh, Šormaz Dušan N. Correlation of jobshop scheduling problem features with scheduling efficiency, Expert Systems with Applications, 2016, Vol. 62. pp. 131–147. DOI: 10.1016/j.eswa.2016.06.014

Humble Travis S. Yuma Nakamura, Kazuki Ikeda Application of Quantum Annealing to Nurse Scheduling Problem, Scientific Reports, 2019, Vol. 9, No. 1, P. 12837. DOI: 10.1038/s41598-019-49172-3

Fedoriaeva T. I. Combinatorial algorithms. Novosobirsk, Novosibirsk State University, 2011.

Downloads

Published

2022-12-11

How to Cite

Turbal, Y. V., Babych, S. V., & Kunanets, N. E. (2022). PERMANENT DECOMPOSITION ALGORITHM FOR THE COMBINATORIAL OBJECTS GENERATION. Radio Electronics, Computer Science, Control, (4), 119. https://doi.org/10.15588/1607-3274-2022-4-10

Issue

No. 4 (2022): Radio Electronics, Computer Science, Control

Section

Progressive information technologies

License

Copyright (c) 2022 Y. V. Turbal, S. V. Babych, N. E. Kunanets

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Creative Commons Licensing Notifications in the Copyright Notices

The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.

The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.

The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.