Data di Pubblicazione:
2013
Citazione:
Optimal solutions for routing problems with profits / C. Archetti, N. Bianchessi, M.G. Speranza. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - 161:4-5(2013), pp. 547-557. [10.1016/j.dam.2011.12.021]
Abstract:
In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to obtain primal bound values. In spite of its simplicity, the heuristic computes high quality solutions. Several unsolved benchmark instances have been solved to optimality.
Tipologia IRIS:
01 - Articolo su periodico
Keywords:
Routing; Profits; Branch-and-price; Heuristic; Capacitated Team Orienteering Problem; Capacitated Profitable Tour Problem
Elenco autori:
C. Archetti, N. Bianchessi, M.G. Speranza
Link alla scheda completa: