Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem

Milanović, Marija — 2010

Mathematica Balkanica New Series

AMS Subj. Classification: 90C27, 05C85, 90C59 The topic is related to solving the generalized vertex cover problem (GVCP) by genetic algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem which was one of the first problems shown to be NP-hard. The definition of the GVCP and basics of genetic algorithms are described. Details of genetic algorithm and numerical results are presented in [8]. Genetic algorithm obtained high quality solutions in a short period...

Solving the Task Assignment Problem with a Variable Neighborhood Search

Kratica, Jozef;  Savić, Aleksandar;  Filipović, Vladimir;  Milanović, Marija — 2010

Serdica Journal of Computing

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...

Page 1

Download Results (CSV)