Mathematical models and algorithms for acceptable and optimal cargo delivery routes constructing

Statement is given and mathematical properties are derived for the problem of constructing acceptable and optimal routing assignments for one or several vehicle types in case of given set of constraints on cargo receiving points and delivery time, and of simultaneous two or more tasks performance impossibility. Based on derived properties of acceptable and optimal sequences, the tasks solution algorithms are developed using modified sequential optimization methods, illustrated by numerical examples. The results of computing experiments are given.