Довідкова матриця злиття потоків у задачах оптимізації упакувань на багатопродуктових мережах
The method for computing the help matrix of merging the small packages of discrete flows during solving the optimization of packings problem in multicommodity networks with restrictions on the period of delivery or the number of merges of flows is proposed. On the basis of the proved statements, eff...
Збережено в:
| Дата: | 2014 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | rus |
| Опубліковано: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2014
|
| Онлайн доступ: | http://journal.iasa.kpi.ua/article/view/32558 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | System research and information technologies |
Репозиторії
System research and information technologies| Резюме: | The method for computing the help matrix of merging the small packages of discrete flows during solving the optimization of packings problem in multicommodity networks with restrictions on the period of delivery or the number of merges of flows is proposed. On the basis of the proved statements, efficient computing algorithms for determining the nodes of merge and merged flows with the use of the help matrix for all pairs in a network are developed. Algorithms may be used inside the basic optimization schemes for calcu-lating the time of delivery of flows to the destination and checking for the appropriate restrictions during solving the various optimization problems of packings on transport networks, and also during the design and analysis of message transfers in virtual contain-ers in the state-of-the-art trunk data networks such as Backbone. |
|---|