Optimal solutions for routing problems with profits

Citations of this article
Mendeley users who have this article in their library.


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. © 2011 Elsevier B.V. All rights reserved.




Archetti, C., Bianchessi, N., & Speranza, M. G. (2013). Optimal solutions for routing problems with profits. Discrete Applied Mathematics, 161(4–5), 547–557. https://doi.org/10.1016/j.dam.2011.12.021

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free