Abstract:
The problem of constructing of the shortest cyclic route for delivery of homogeneous cargo from producers to consumers using vehicle with given capacity is considered. Formalizations in the boolean quadratic and integer linear programming are offered. Comparative analysis of efficiency of three exact algorithms is made. The problem of finding minimum tolerable vehicle capacity is considered as auxiliary. The relation between length of optimal route and vehicle capacity is empirically analyzed.
Keywords:routing, cycle, integer linear programming, quadratic Boolean programming.