%0 Journal Article %1 IJACSA.2011.021224 %A Bogdanovic, Milena %D 2011 %J International Journal of Advanced Computer Science and Applications(IJACSA) %K Integer NP-complete algorithms. degree-bounded genetic graph graphs; linear problems; programming; the theory; %N 12 %T Solving the MDBCS Problem Using the Metaheuric–Genetic Algorithm %U http://ijacsa.thesai.org/ %V 2 %X The problems degree-limited graph of nodes considering the weight of the vertex or weight of the edges, with the aim to find the optimal weighted graph in terms of certain restrictions on the degree of the vertices in the subgraph. This class of combinatorial problems was extensively studied because of the implementation and application in network design, connection of networks and routing algorithms. It is likely that solution of MDBCS problem will find its place and application in these areas. The paper is given an ILP model to solve the problem MDBCS, as well as the genetic algorithm, which calculates a good enough solution for the input graph with a greater number of nodes. An important feature of the heuristic algorithms is that can approximate, but still good enough to solve the problems of exponential complexity. However, it should solve the problem heuristic algorithms may not lead to a satisfactory solution, and that for some of the problems, heuristic algorithms give relatively poor results. This is particularly true of problems for which no exact polynomial algorithm complexity. Also, heuristic algorithms are not the same, because some parts of heuristic algorithms differ depending on the situation and problems in which they are used. These parts are usually the objective function (transformation), and their definition significantly affects the efficiency of the algorithm. By mode of action, genetic algorithms are among the methods directed random search space solutions are looking for a global optimum.

@article{IJACSA.2011.021224, abstract = { The problems degree-limited graph of nodes considering the weight of the vertex or weight of the edges, with the aim to find the optimal weighted graph in terms of certain restrictions on the degree of the vertices in the subgraph. This class of combinatorial problems was extensively studied because of the implementation and application in network design, connection of networks and routing algorithms. It is likely that solution of MDBCS problem will find its place and application in these areas. The paper is given an ILP model to solve the problem MDBCS, as well as the genetic algorithm, which calculates a good enough solution for the input graph with a greater number of nodes. An important feature of the heuristic algorithms is that can approximate, but still good enough to solve the problems of exponential complexity. However, it should solve the problem heuristic algorithms may not lead to a satisfactory solution, and that for some of the problems, heuristic algorithms give relatively poor results. This is particularly true of problems for which no exact polynomial algorithm complexity. Also, heuristic algorithms are not the same, because some parts of heuristic algorithms differ depending on the situation and problems in which they are used. These parts are usually the objective function (transformation), and their definition significantly affects the efficiency of the algorithm. By mode of action, genetic algorithms are among the methods directed random search space solutions are looking for a global optimum. }, added-at = {2014-02-21T08:00:08.000+0100}, author = {Bogdanovic, Milena}, biburl = {https://www.bibsonomy.org/bibtex/293505a921cd139d771468a6b80a03521/thesaiorg}, interhash = {21b99a8860125eddf0e5f99ceef038e4}, intrahash = {93505a921cd139d771468a6b80a03521}, journal = {International Journal of Advanced Computer Science and Applications(IJACSA)}, keywords = {Integer NP-complete algorithms. degree-bounded genetic graph graphs; linear problems; programming; the theory;}, number = 12, timestamp = {2014-02-21T08:00:08.000+0100}, title = {{Solving the MDBCS Problem Using the Metaheuric–Genetic Algorithm}}, url = {http://ijacsa.thesai.org/}, volume = 2, year = 2011 }