| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652105 | Electronic Notes in Discrete Mathematics | 2015 | 8 Pages |
Abstract
In this paper, we propose a polynomial way for optimally partitioning a giant tour using integer linear programming. The obtained model is extended to the mTSP with limited visits per tour. A hybridization of the variable neighborhood search (VNS) heuristic with these mathematical models is also presented. Computational experiments are conducted using a conventional solver to illustrate the performance of some of these split-based models as well as their hybridization with VNS.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
