| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420030 | Discrete Applied Mathematics | 2013 | 11 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
C. Archetti, N. Bianchessi, M.G. Speranza,