The Subsystem of Solution of the Optimization Problem with Usage
of Best Effort Algorithm with Directional Hyper Square
Pavlo Denysyuk, Taras Teslyuk, Nazarii Banakh, Yuri Pidlypnyy,
Oleh Shepelyuk, Ivanna Panchuk
CAD Department, Lviv Polytechnic National University, UKRAINE, Lviv, S. Bandery street 12,
E-mail: [email protected], [email protected]
Abstract – In this paper the peculiarities of solution of the
optimization problem with usage of best effort algorithm with
directional hyper square are described.
Кеу words – optimization, algorithm, directional hyper
square.
I.
Introduction
From year to year the complexity of technical problems
merely increases, which causes different growth of
difficulty of problems in computer-aided design area
[1,2]. In particular, for optimization tasks of great length,
the developers more often appeal to statistical methods of
solving design problems [3,4]. Nowadays a number of
statistical methods of solving the optimization problem
are known, and one of the most used is best effort
algorithm with directional hyper square [5].
II.
Construction of the structure and of
system operation algorithm
Designed system consists of such elements (fig.1.):
 Mathematical kernel, in which is realized the functional
for search the optimum in accordance with hyper
square method;
 Auxiliary functional, in which is realized separation of
input functions and restrictions, presentation of
function in understandable structure for the program;
 Data load/storage system for rapid data input and
saving the results of programed work
 User interface, for convenient work between user and
the system.
Mathematical
processor
Auxiliary
functional
User interface
System for optimum search
using hyper square method
Data load/
storage system
Fig.1. Designed structure of projected system
As we can see from the above-indicated material –
designed structure bases on modular approach, which
gives an opportunity to organize effectively the
modernization and improvement of designed system.
The main elements of program system construction is
logical design operation. In particular, designed operation
system algorithm consists of such basic steps:
Step 1. Program start and initialization of all
subsystems.
Step 2. Input the initial data: 1) Data reading from the
file; 2) Input manually;
Step 3. Search settings.
Step4. Start searching the optimum.
Step 5. Test of the results: 1) Test schedules; 2) Check
the output;
Step 6. Is the result achieved? “Yes” – save the results
in file, transition to step 7; “No” – transition to step 8.
Step 7. Is it necessary to solve this program? “Yes” –
transition to step 2. “No” – transition to step 8.
Step 8. Complete the program.
Designed algorithm of operation system to search the
optimum of the function, using the Hyper Square method,
gives a chance to check the rightness and correctness of
its work.
III.
Development characteristics of the
system software support
We choose Java as an environment of system
development, which has number of advantages than
others.
Designed and realized class diagram of software
support. Here is a description and features each of the
classes:
Class Function Parser – is responsible for transfer the
text entry of the function to the form, which is clear for
program. The class splits the text and builds the tree
calculation functions, and after that can be used for
calculation of the value function in given point.
Class Function – represents the top of tree function. It
consists of left and right child, can also recursively
calculate the value of the function in given point.
Class Hypercube – is a mathematical kernel, in which
is realized the Hypercube method. It includes a functional
for method settings and convenient formation of the
results.
Class Data Reader – is responsible for reading the
condition of the problem from preset file.
Class Data Writer – is responsible for recording the
condition of the problem and results calculations in preset
file.
Class Tester – this class is created for testing the
functional of the mathematical kernel and auxiliary
classes. It is not used in the final project.
Class Java Paint UI – it is a Frame-class, in which is
situated the diagram of projection for optimum search,
there is class instance Plot Panel within.
Class Plot Panel – it is a Panel class, in which is drawn
a diagram of projection for optimum search in accordance
with preset commands.
The example of the main subsystem menu is shown in
fig.2, the example of graphical image of optimum search
is shown is fig.3. The system was tested with using
standard task. Received data concur with textual, which
claims about rightness and correctness of the operation
system.
Conclusion
1. Block diagram is designed; the system algorithm for
optimum search using best effort algorithm with
directional hyper square.
“COMPUTER SCIENCE & INFORMATION TECHNOLOGIES” (CSIT’2014), 18-22 NOVEMBER 2014, LVIV, UKRAINE
2. Software environment Java is selected for
implementation of the system, which provides
platform independence of software product.
3. Testing of designed system is held, which gives a
chance to claim about rightness and correctness of
software product.
References
[1] Теслюк В.М., Денисюк П.Ю. Автоматизація
проектування мікроелектромеханічних систем на
компонентному рівні: Монографія. - Львів:
Видавництво Львівської політехніки, 2011.-192 с.
[2] Норенков И.П. Основы автоматизированного
проектирования Учеб. для вузов. 2-е изд., перераб.
и доп. — М.: Изд-во МГТУ им. Н. Э. Баумана,
2002. — 336 c.: ил. — (Сер. Информатика в
техническом университете).
[3] Pavlo Denysyuk, Vasyl Teslyuk, Tariq (Moh’d Taisir)
Ali AlOmari, Tatyana Teslyuk. Development and
Study of Subsystem for Solution of Tasks of
Multicriterial Optimization, Proc. of the V-th
International Conference of Young Scientists
(MEMSTECH’2009) – Lviv – Polyana, 2009, pp.
166-167.
[4] Teslyuk V.M, Kryvyy R.Z, Teslyuk T.M, Tariq (Moh’d
Taisir) Ali AlOmari. Development of subsystems for
solving optimization problems with the help of genetic
algorithms., Proceedings of the of the Xth
International Conference CADSM 2009 "The
Experience of Designing and Application of CAD
Systems in Microelectronics" 24-28 February 2009
Lviv-Polyana, Ukraine, pp. 364
[5] Рейзлин В.И. Численне методы оптимизации:
учебное пособие; Томский политехнический
университет.
– Томск:
Изд-во
Томского
политехнического университета, 2011 – 105 с.
Fig.2. Results of the optimum search
Fig.3. Diagram of projection for optimum search
“COMPUTER SCIENCE & INFORMATION TECHNOLOGIES” (CSIT’2014), 18-22 NOVEMBER 2014, LVIV, UKRAINE