| Autor: |
Vasyanin, V. A., Trofymchuk, O. M., Ushakova, L. P. |
| Předmět: |
|
| Zdroj: |
Cybernetics & Systems Analysis; Nov2022, Vol. 58 Issue 6, p966-976, 11p |
| Abstrakt: |
The paper considers the network problem of optimizing the routing of groupage cargo flows in the transportation network with given tariffs for the transportation and handling of flows and constraints on the capacities of arcs, nodes, and the time of delivery of individual goods to a receiver. To compute the delivery time, the authors have proposed the method for generating a reference matrix of the union of flows of individual cargoes and efficient algorithms that allow determining the nodes of union and united flows for all corresponding pairs in a multicommodity network. It is proved that one can transform a network problem with tariffs into an integer linear programming problem with block structure and binding constraints in polynomial time. The peculiarities of solving the transformed problem using well-known methods of integer programming and software packages are presented. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink