Abstract:
The problem of constructing a cyclic route with minimal transport cost for delivering a homogeneous cargo from a set of producers to consumers by limited capacity vehicle is considered. It is assumed that the cost of transportation between points depends on time. The corresponding integer linear model is constructed. Computer experiments were carried out.
Keywords:routing, nonstationarity, linear integer programming, branchs and cuts method.