Article ID: | iaor20133098 |
Volume: | 229 |
Issue: | 3 |
Start Page Number: | 673 |
End Page Number: | 682 |
Publication Date: | Sep 2013 |
Journal: | European Journal of Operational Research |
Authors: | Lim Andrew, Zhu Wenbin, Cheang Brenda, Luo Zhixing |
Keywords: | orienteering |
In the capacitated team orienteering problem (CTOP), we are given a set of homogeneous vehicles and a set of customers each with a service demand value and a profit value. A vehicle can get the profit of a customer by satisfying its demand, but the total demand of all customers in its route cannot exceed the vehicle capacity and the length of the route must be within a specified maximum. The problem is to design a set of routes that maximizes the total profit collected by the vehicles. In this article, we propose a new heuristic algorithm for the CTOP using the ejection pool framework with an adaptive strategy and a diversification mechanism based on toggling between two priority rules. Experimental results show that our algorithm can match or improve all the best known results on the standard CTOP benchmark instances proposed by Archetti et al. (2008).