An integration of mixed VND and VNS: the case of the multivehicle covering tour problem

详细信息    查看全文

• 作者：Manel Kammoun ; Houda Derbel ; Mostapha Ratli and Bassem Jarboui
• 刊名：International Transactions in Operational Research
• 出版年：2017
• 出版时间：May 2017
• 年：2017
• 卷：24
• 期：3
• 页码：663-679
• 全文大小：1122K
• ISSN：1475-3995

文摘

The multivehicle covering tour problem (m-CTP) is a transportation problem with different kinds of locations, where a set of locations must be visited while another set must be close enough to planned routes. Given two sets of vertices V and W, where V represents the set of vertices that may be visited and W is a set of vertices that must be covered by up to m vehicles, the m-CTP problem is to minimize vehicle routes on a subset of V including T, which represents the subset of vertices that must be visited through the use of potential locations in V. The variant of m-CTP without a route-length constraint is treated in this paper. To tackle this problem, we propose a variable neighborhood search heuristic based on variable neighborhood descent method. Experiments were conducted using the datasets based on traveling salesman problem library instances.