Перегляд за автором "Lytvynenko, O."

Зараз показано 1 - 3 з 3
  • Зображення мініатюри
    Публікація
    Random Generation Of Combinatorial Sets With Special Properties
    (LUBLIN–RZESZOW, 2016) Grebennik, I.; Lytvynenko, O.
    General approach for solving the problem of random generation of compositional k  images of combinatorial sets (k-sets) has been proposed. K-sets are powerful apparatus that can be applied for solving many scientific and applied problems. Though many literature is dedicated to the problem of generating combinatorial configurations, existing studies deals mostly with simple combinatorial configurations like combinations, permutations etc. The algorithms of generation both basic combinatorial sets and k-sets have been described. Algorithm for random generation of basic sets allows generating various combinatorial sets, and laws of constructing basic combinatorial sets can be pre-set. If identification of the laws fails, the algorithm allows using other algorithms to generate basic sets. Complexity of described algorithms has been evaluated. The complexity of the algorithm of generation k-sets is determined by the complexity of generation of basic sets, as well as the complexity of operations of nsubstitution and a number of levels of a certain k-set. The described approach to the random generation is very flexible since it allows obtaining various results by varying algorithm parameters. In its turn, it allows adjusting the number of elements for both basic sets and k-sets. The developed software allows solving the described problems of random generation of k -sets and basic combinatorial sets.
  • Зображення мініатюри
    Публікація
    Three-dimensional one-to-one pickup and delivery routing problem with loading constraints
    (2016) Grebennik, I.; Lytvynenko, O.; Baranov, O.; Dupas, R.
    We propose mathematical model and solving strategy for PDP with 3D loading constraints in terms of combinatorial configuration instead of traditional approach that uses boolean variables. We solve traditional one-to-one Pickup and Delivery Problem in combination with problem of packing delivered items into vehicles by means of proposed combinatorial generation algorithm.
  • Немає доступних мініатюр
    Публікація
    Train arrangement in scheduling for rail-rail transshipment yard
    (UNWE, 2017) Grebennik, I.; Dupas, R.; Lytvynenko, O.; Urniaieva, I.
    Article considers problem of scheduling freight trains in rail-rail transshipment yards. Besides scheduling the service slots of trains, article additionally solves the problem of train arrangement, i.e. assigning each train to a railway track. Mathematical model and solving method for described problem are given. The key feature of given mathematical model is that is uses combinatorial objects (tuples of permutations) instead of traditional Boolean variables. Solution method is based on generation of combinatorial sets as well, which is quite unusual approach comparing with existing solution methods for described problem.