The traveling salesman problem with profits considering time-dependent cost and multi-trip mode

The study extends the traveling salesman problem with profits by considering time-dependent cost and multi-trip mode. Based on the introduction of alternative arcs, a network flow model is established and an exact label setting approach is designed. Upper bound of the partial label is put forward to accelerate the approach. Computational results show the effectiveness of the proposed approach.