engleski

Comparing basic variable neighborhood search and its extensions

In this article the basic variable neighborhood search (VNS) approach and its extensions are applied to solve the task assignment problem. Emphasis is placed on comparing the computational results and reliability in the case of a small number of iterations. Four different approaches within VNS were compared and the computational results were statistically analyzed for different numbers of iterations.

Variable neighborhood search; task assignment problem; multiple processors

nije evidentirano