A suboptimal algorithm for solving a transportation routing problem. (English. Russian original) Zbl 0531.90069
Sov. Autom. Control 15, No. 6, 1-5 (1982); translation from Avtomatika 1982, No. 6, 5-9 (1982).
Summary: We consider the rational organization of deliveries in optimization of a transportation work. An efficient computational algorithm based on the branch-and-bound method is proposed. This algorithm makes it possible to solve practical routing problems of rather high dimension.
MSC:
| 90C08 | Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) |
| 65K05 | Numerical mathematical programming methods |
| 90C35 | Programming involving graphs or networks |
| 90B10 | Deterministic network models in operations research |
