An integration of mixed VND and VNS: the case of the multivehicle covering tour problem. (17th October 2016)

• Record Type: Journal Article
• Authors: Kammoun, Manel; Derbel, Houda; Ratli, Mostapha; Jarboui, Bassem
• Is Part Of: International transactions in operational research. Volume 24:Number 3(2017)
• Page Start: 663
• Page End: 679
• Publication Date: 2016-10-17
• Subjects: covering tour problem -- heuristic algorithms -- variable neighborhood search; Operations research -- Periodicals; 003
• DOI: 10.1111/itor.12355
• Languages: English
• ISSNs: 0969-6016

Abstract

Abstract: 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.