Solving the MDBCS Problem Using the Metaheuric–Genetic Algorithm

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

Nonlinear Mixing Model of Mixed Pixels in Remote Sensing Satellite Images Taking Into Account Landscape

Nonlinear mixing model of mixed pixels in remote sensing satellite images taking into account landscape is proposed. Most of linear mixing models of mixed pixels do not work so well because the mixed pixels consist of se...

Phishing Website Detection: An Improved Accuracy through Feature Selection and Ensemble Learning

This research focuses on evaluating whether a website is legitimate or phishing. Our research contributes to improving the accuracy of phishing website detection. Hence, a feature selection algorithm is employed and inte...

Impact of IP Addresses Localization on the Internet Dynamics Measurement

Many projects have sought to measure the dynamics of the Internet by using end-to-end measurement tools. The RADAR tool has been designed in this context. It consists in periodically tracing the routes from a monitor tow...

Android Application to Assess Smartphone Accelerometers and Bluetooth for Real-Time Control

Modern smart phones have evolved into sophisticated embedded systems, incorporating hardware and software features that make the devices potentially useful for real-time control operations. An object-oriented Android app...

A Design of Pipelined Architecture for on-the-Fly Processing of Big Data Streams

Conventional processing infrastructures have been challenged by huge demand of stream-based applications. The industry responded by introducing traditional stream processing engines along-with emerged technologies. The o...

Download PDF file
  • EP ID EP124613
  • DOI -
  • Views 108
  • Downloads 0

How To Cite

Milena Bogdanovic (2011). Solving the MDBCS Problem Using the Metaheuric–Genetic Algorithm. International Journal of Advanced Computer Science & Applications, 2(12), 161-167. https://europub.co.uk/articles/-A-124613