Algorithm to solve a problem of optimum separation of sets with additional couplings
Journal Title: Комп’ютерне моделювання: аналіз, управління, оптимізація - Year 2017, Vol 2, Issue 2
Abstract
Problems of manufacturing arrangement have been considered for more than a century. However, they are still topical. For instance, despite the fact that a number of models and techniques to solve discrete problems of arrangement have been proposed, studies concerning continual problems are not practically available. At the same time, production development involves solution of a variety of problems which are described with the help of such models. Problems of multistage production to minimize total cost of product delivery and raw material as well as to provide coverage of a certain service area are among them. In this context, original set is continuous by its nature, and available discrete models need a great number of simplifications being detrimental to the final result. The paper considers a problem of optimum separation of sets with additional connections and arrangement of centres of subsets, which is a mathematical model of two-stage continual location-allocation problem. Complexity of the studies is that a mathematical model involves both discrete part and continual one thus requiring combined solution techniques. The necessity to develop such algorithms is undisputable since such models describe a number of important practical problems including those concerning the arrangement of points for natural raw material accumulating and processing. Moreover, the considered problem develops the theory of optimum separation of sets, and so it is important in terms of theory as well. Specific attention has been paid to the approach for the problem solving. The approach is to transform the original problem into a problem of infinite-dimensional mathematical programming and then into a problem of finite-dimensional optimization with the help of Lagrange function. Algorithm to solve a problem of optimum separation of sets with additional connections has been represented. The algorithm may be important from the viewpoint of its application to solve applied problems as well as from the viewpoint of further development of the theory of optimum separation of sets.
Authors and Affiliations
С. А. Ус, О. Д. Станіна
Keywords
Related Articles
- EP ID EP642483
- DOI -
- Views 125
- Downloads 0
Вопросы использования многомерных аппроксимаций типа Паде для обобщенного суммирования решений краевых задач
Целью этой работы является разработка методики построения многомерных аппроксимаций типа Паде для решения краевых задач и определение условий их сходимости. В теории многомерных дробно-рациональных аппроксимаций функций...
Метод пакетного навчання нейромереж нелінійної авторегресії для прогнозу прибутку інтернет-магазину
У статті розглядаються і аналізуються існуючі методи прогнозування прибутку інтернет-магазину. В сучасній електронній комерції є проблема недостатньої ефективності автоматизації бізнес-процесів інтернет-магазину. Ґрунтую...
The analysis of pecularities of the process of helical pipe-rolling with the use of information technologies
In this paper, we present the results of a study of the process of helical rolling of pipes using a deformation-geometric model based on block algorithms. The algorithms of the mathematical model in the form of a block s...
Questions of using multidimensional Pade-type approximations for the generalized summary of the decisions of the boundary-value problems
The aim of this work is to develop a methodology for constructing multidimensional Pade approximants for solving boundary value problems and determining the conditions for their convergence. In the theory of multidimensi...
Research of the trajectory of pollution diffusion from a point source depending on the nature of the landscape
The behavior of the flow of pollutants during process of diffusion from a chimney is investigated in this paper. It will help to understand the process of air pollution better. By means of the Solid Edge program three th...