Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/2900| Title: | Solving the Task Assignment Problem with a Variable Neighborhood Search | Authors: | Kratica, Jozef Savić, Aleksandar Filipović, Vladimir Milanović, Marija |
Affiliations: | Numerical Mathematics and Optimization Informatics and Computer Science |
Keywords: | Task assignment;multiprocessor systems;Variable neighborhood search;assignment problems;Combinatorial optimization | Issue Date: | 2010 | Publisher: | Sofia : Institute of Mathematics and Informatics of the Bulgarian Academy of Sciences | Journal: | Serdica Journal of Computing | Abstract: | In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed VNS approach reaches all optimal solutions in a quite short amount of computational time. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/2900 |
| Appears in Collections: | Research outputs |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.