MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHM

The problem on improving precision properties of the fast approx imate algorithms without sacrifice of their resource properties is set. A multiple - purpose approach to the application of the modified Rom a novsky algorithm (MRA) and the selective - permutation method (SPM) for solving homogeneous...

Full description

Saved in:
Bibliographic Details
Main Authors: Rudolf A. Neydorf, Artem A. Zhikulin
Format: Article
Language:Russian
Published: Don State Technical University 2012-09-01
Series:Advanced Engineering Research
Subjects:
Online Access:https://www.vestnik-donstu.ru/jour/article/view/605
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850029477943312384
author Rudolf A. Neydorf
Artem A. Zhikulin
author_facet Rudolf A. Neydorf
Artem A. Zhikulin
author_sort Rudolf A. Neydorf
collection DOAJ
description The problem on improving precision properties of the fast approx imate algorithms without sacrifice of their resource properties is set. A multiple - purpose approach to the application of the modified Rom a novsky algorithm (MRA) and the selective - permutation method (SPM) for solving homogeneous allocation problems (HAP) i s proposed. The a pproach is based on the approximate solution improvement o b tained by the modified Romanovsky algorithm through the selected operation exchange between exec u tors. The comparative analysis with such approximate algorithms as the critical pat h technique (CPT) and the evolutional genetic algorithm (EGA) is carried out. The computational e xperiments at different problem parameter values are conducted. The combined application of the MRA a nd SPM for the mo d est dimension HAP solution permits to re ach rather high resource - precision figures in comparison to other approximate algorithms. However, at the higher problem dimensions, the SPM not even once improved th e sol utions obtained by the MRA, which most likely, is caused by the MRA high precision pr operties. That is why the a ppropriateness of the MRA and SPM application to the high dimension HAP sol u tion invites fur ther investigations.
format Article
id doaj-art-9a4207fa74df4901993a01919a7cf5b7
institution DOAJ
issn 2687-1653
language Russian
publishDate 2012-09-01
publisher Don State Technical University
record_format Article
series Advanced Engineering Research
spelling doaj-art-9a4207fa74df4901993a01919a7cf5b72025-08-20T02:59:31ZrusDon State Technical UniversityAdvanced Engineering Research2687-16532012-09-011255054598MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHMRudolf A. Neydorf0Artem A. Zhikulin1Don State Technical University.Don State Technical University.The problem on improving precision properties of the fast approx imate algorithms without sacrifice of their resource properties is set. A multiple - purpose approach to the application of the modified Rom a novsky algorithm (MRA) and the selective - permutation method (SPM) for solving homogeneous allocation problems (HAP) i s proposed. The a pproach is based on the approximate solution improvement o b tained by the modified Romanovsky algorithm through the selected operation exchange between exec u tors. The comparative analysis with such approximate algorithms as the critical pat h technique (CPT) and the evolutional genetic algorithm (EGA) is carried out. The computational e xperiments at different problem parameter values are conducted. The combined application of the MRA a nd SPM for the mo d est dimension HAP solution permits to re ach rather high resource - precision figures in comparison to other approximate algorithms. However, at the higher problem dimensions, the SPM not even once improved th e sol utions obtained by the MRA, which most likely, is caused by the MRA high precision pr operties. That is why the a ppropriateness of the MRA and SPM application to the high dimension HAP sol u tion invites fur ther investigations.https://www.vestnik-donstu.ru/jour/article/view/605scheduling theoryhomogeneous problemapproximate methodsolution improvementselective a pproachperm utation algorithm.
spellingShingle Rudolf A. Neydorf
Artem A. Zhikulin
MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHM
Advanced Engineering Research
scheduling theory
homogeneous problem
approximate method
solution improvement
selective a pproach
perm utation algorithm.
title MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHM
title_full MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHM
title_fullStr MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHM
title_full_unstemmed MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHM
title_short MULTIPLE-PURPOSE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEMS BASED ON MODIFIED ROMANOVSKY ALGORITHM AND SELECTIVE-PERMUTATION ALGORITHM
title_sort multiple purpose solution to homogeneous allocation problems based on modified romanovsky algorithm and selective permutation algorithm
topic scheduling theory
homogeneous problem
approximate method
solution improvement
selective a pproach
perm utation algorithm.
url https://www.vestnik-donstu.ru/jour/article/view/605
work_keys_str_mv AT rudolfaneydorf multiplepurposesolutiontohomogeneousallocationproblemsbasedonmodifiedromanovskyalgorithmandselectivepermutationalgorithm
AT artemazhikulin multiplepurposesolutiontohomogeneousallocationproblemsbasedonmodifiedromanovskyalgorithmandselectivepermutationalgorithm