Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959069 | Computers & Operations Research | 2017 | 11 Pages |
Abstract
The results obtained by the proposed algorithm outperform those obtained by other constructive heuristics in the literature for the problem, thus modifying substantially the state-of-the-art of efficient approximate procedures for the problem. In addition, the proposed algorithm even outperforms two of the best metaheuristics for many instances of the problem, using much lesser computation effort. The excellent performance of the proposal is also proved by the fact that the new heuristic found new best upper bounds for 35 of the 120 instances in Taillard's benchmark.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Victor Fernandez-Viagas, Jose M. Framinan,