Solving the MDBCS Problem Using the Metaheuric–Genetic Algorithm
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 2, Issue 12
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.
Authors and Affiliations
Milena Bogdanovic
Keywords
Related Articles
- EP ID EP124613
- DOI -
- Views 123
- Downloads 0
Opinion Mining and thought Pattern Classification with Natural Language Processing (NLP) Tools
Opinion mining from digital media is becoming the easiest way to obtain trivial aspects of the thinking trends. Currently, there exists no hard and fast modeling or classification over this for any society or global comm...
A Topic Modeling Based Solution for Confirming Software Documentation Quality
this paper presents an approach for evaluating and confirming the quality of the external software documentation using topic modeling. Typically, the quality of the external documentation has to mirror precisely the orga...
Ontology-based Query Expansion for Arabic Text Retrieval
The semantic resources are important parts in the Information Retrieval (IR) such as search engines, Question Answering (QA), etc., these resources should be available, readable and understandable. In semantic web, the o...
SW-SDF Based Personal Privacy with QIDB-Anonymization Method
Personalized anonymization is a method in which a guarding node is used to indicate whether the record owner is ready to reveal its sensitivity based on which anonymization will be performed. Most of the sensitive values...
Detection of Infected Leaves and Botanical Diseases using Curvelet Transform
The study of plants is known as botany and for any botanist it is a daily routine work to examine various plants in their research lab. This research efforts an image processing-based algorithm for extracting the region...