Abstract:
The generalized courier problem in the case when travel costs depend explicitly on the list of tasks that have not been performed (by the time of the travel) is considered. The original routing problem with dependent variables is represented in terms of an equivalent extremal problem with independent variables. An iterative method based on this representation is proposed for solving the original problem. The algorithm based on this method is implemented as a computer program.