Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
11008026 | Information Sciences | 2019 | 40 Pages |
Abstract
In this paper we use Basic Variable Neighborhood Search (BVNS) methodology to solve the VBP. In particular, we propose three constructive procedures and six improvement methods. We introduce a novel scheme for calculating the objective function which substantially reduces the computing time as compared with the direct implementation. After a set of preliminary experiments, the best BVNS design is compared with the state-of-the-art over the same set of instances obtaining better results for both, quality of the solutions and execution time. These results are further confirmed by non-parametric statistical tests.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Alberto HerrĂ¡n, J. Manuel Colmenar, Abraham Duarte,