Optimization of Collector’s Route

Abstract

The article considers the problem of finding the optimal sequence of payment collection points to be visited by criterion based on minimizing the product of the cash being on vehicle and the delivery time. The essence of the task is illustrated on the numerical example. For solving the task, an algorithm based on the branch and bound method was developed. The availability of the search tree nodes is estimated on the basis of consequences from outspoken theorems.

Keywords:

algorithm, time, money, payment collection, minimization, permutation