The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the area of applied optimisation, heuristics are a popular means to address computational problems of high complexity. Modelling the problem and mapping all variations of its solution into a so-called solution space are integral parts of this process. Representing solutions as graphs is common and, for a special type of graph, Prüfer Code (PC) offers a computationally efficient mapping (algorithms...
In this paper we outline a novel global heuristic tool to deal with a combination of the Capacitated P-Median (CPMP) and the Capacitated Minimum Spanning Tree (CMST) problems. This preliminary approach provides an efficient (in terms of power consumption due to emission or signal interferences) traffic-flow design for a setup consisting of a number of spatially distributed nodes transmitting information...
Multiple Sequence Alignment(MSA) is one of the most fundamental problems in biology information. At present, with the rapid increase in the sequence quantity, there is an urgent need to run the optimized algorithm of MSA, the researchers also made a lot of the problem solution, such as dynamic programming, including the Needleman-Wunsch algorithm and Carrillo-Lipman algorithm, Feng-Doolittle algorithm...
In this paper, we propose a novel approach for the optimal communication spanning tree (OCST) problem. Our algorithm is based on the Particle Swarm Optimization (PSO) technique and take account into node biased encoding (NBE) scheme to find nearly optimal solution. The new algorithm can achieve a result that is better than known heuristic algorithms do, as verified by a set of public benchmark problem...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.