科研之友
微信
新浪微博
Facebook
分享链接
摘要
The multi-vehicle covering tour problem (m-CTP) is defined on a graph G - (V boolean AND W, E), where V is a set of vertices that. can be visited and W is a set of vertices that must be covered but cannot be visited. The objective of the m-CTP is to obtain a set of total minimum cost tours on subset of V, while covering all v is an element of W by up to m vehicles. In this paper, we first generalize the original m-CTP by adding a realistic constraint, and then propose an algorithm for the generalized m-CTP using a column generation approach. Computational experiments show that our algorithm performs well and outperforms the existing algorithms.
- 出版日期2018-8
