Optimal solutions for routing problems with profits |
| |
Authors: | C Archetti N Bianchessi MG Speranza |
| |
Institution: | Dipartimento Metodi Quantitativi, University of Brescia, C.da S. Chiara, 50, I-25122 Brescia, Italy |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|