Solving the Task Assignment Problem with a Variable Neighborhood Search

Kratica, Jozef, et al. "Solving the Task Assignment Problem with a Variable Neighborhood Search." Serdica Journal of Computing 4.4 (2010): 435-446. <http://eudml.org/doc/11398>.

@article{Kratica2010,
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.* This research was partially supported by the Serbian Ministry of Science and Ecology under project 144007.},
author = {Kratica, Jozef, Savić, Aleksandar, Filipović, Vladimir, Milanović, Marija},
journal = {Serdica Journal of Computing},
keywords = {Task Assignment; Multiprocessor Systems; Variable Neighborhood Search; Assignment Problems; Combinatorial Optimization; numerical examples; task assignment; multiprocessor systems; variable neighborhood search; assignment problem; combinatorial optimization},
language = {eng},
number = {4},
pages = {435-446},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Solving the Task Assignment Problem with a Variable Neighborhood Search},
url = {http://eudml.org/doc/11398},
volume = {4},
year = {2010},
}

TY - JOUR
AU - Kratica, Jozef
AU - Savić, Aleksandar
AU - Filipović, Vladimir
AU - Milanović, Marija
TI - Solving the Task Assignment Problem with a Variable Neighborhood Search
JO - Serdica Journal of Computing
PY - 2010
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 4
IS - 4
SP - 435
EP - 446
AB - 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.* This research was partially supported by the Serbian Ministry of Science and Ecology under project 144007.
LA - eng
KW - Task Assignment; Multiprocessor Systems; Variable Neighborhood Search; Assignment Problems; Combinatorial Optimization; numerical examples; task assignment; multiprocessor systems; variable neighborhood search; assignment problem; combinatorial optimization
UR - http://eudml.org/doc/11398
ER -