| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6892770 | Computers & Operations Research | 2016 | 33 Pages |
Abstract
Extensive computational experiments, on a significant set of test problems, are carried out in order to empirically evaluate the performance of the proposed approaches. The computational results show that the Greedy Randomized Adaptive Search Procedure is effective in finding optimal or near optimal solutions in very limited computational time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Daniele Ferone, Paola Festa, Francesca Guerriero, Demetrio Laganà ,