Premium
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
Author(s) -
Kammoun Manel,
Derbel Houda,
Ratli Mostapha,
Jarboui Bassem
Publication year - 2017
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12355
Subject(s) - travelling salesman problem , descent (aeronautics) , variable neighborhood search , set (abstract data type) , heuristic , constraint (computer aided design) , combinatorics , variable (mathematics) , vehicle routing problem , computer science , mathematical optimization , constraint satisfaction problem , mathematics , metaheuristic , artificial intelligence , routing (electronic design automation) , engineering , mathematical analysis , computer network , geometry , programming language , probabilistic logic , aerospace engineering
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.