Matches in SemOpenAlex for { <https://semopenalex.org/work/W2556555801> ?p ?o ?g. }
Showing items 1 to 98 of
98
with 100 items per page.
- W2556555801 abstract "From a mathematical point of view routing is the most complicated problem of selection from a vast number of optimal solution choices. Development of methods and algorithms for solving the routing problem is carried out for many years though the issue is still relevant. This is due to the fact that, first of all, this is a nondeterministic polynomial time complete problem (so called NP-complete problem), and thus to develop a universal algorithm for finding the exact optimal solution within a reasonable time is quite a challenging task. The emergence of new, more sophisticated computer equipment, giving powerful computing resources, as well as exclusive standards of the projected devices is the driving force behind the development of new algorithms for solving the routing problem. There are several approaches to solve NP-complete problems. The first class of algorithms includes methods, which explicitly or implicitly provide for the exponential running time of the algorithm. These include full enumeration method, linear and nonlinear programming, etc. The second class includes the so-called heuristic algorithms allowing one to get reasonably good solutions within an acceptable time. A comparative analysis of the methods and algorithms for the first two classes showed that these algorithms do not guarantee the global result. The operation of such algorithms is completed or after a local optimum, or after an implementation of a predetermined number of steps. The third class includes algorithms of randomly directed search, based on the concepts of modeling [1]. They allow you to obtain a set of alternative solutions, and as a result of their analysis to obtain optimal and quasi-optimal results. These algorithms use a simulation of evolution and natural selection methods, observed among living organisms in nature to select the strongest. These methods allow you to create extremely flexible, fast and efficient data analysis tools. In this regard, in the paper we use the developments based on these technologies. For the study we proposed to use swarm algorithm of the redistribution of connections between terminals on the basis of integration of models of adaptive behavior of an ant colony and collective alternative adaptation. We propose the swarm algorithm of connection permutation between pins based on the integration of two models: an adaptive behavior of ant colony and collective alternative adaptation. The essence of the integration of these models is that in the course of performing the search procedure the certain procedures of the ant colony algorithm are alternating with collective alternative adaptation. The conducted experimental studies have confirmed the effectiveness of the proposed paradigm." @default.
- W2556555801 created "2016-11-30" @default.
- W2556555801 creator A5005001580 @default.
- W2556555801 creator A5017213096 @default.
- W2556555801 creator A5027067890 @default.
- W2556555801 creator A5058604172 @default.
- W2556555801 creator A5058889703 @default.
- W2556555801 date "2015-01-01" @default.
- W2556555801 modified "2023-09-24" @default.
- W2556555801 title "SWARM-INTELLIGENCE-BASED ALGORITHM OF CONNECTIONS PERMUTATION BETWEEN PINS" @default.
- W2556555801 cites W1573676079 @default.
- W2556555801 cites W1576426930 @default.
- W2556555801 cites W1751300721 @default.
- W2556555801 cites W1971661364 @default.
- W2556555801 cites W2108913694 @default.
- W2556555801 cites W2110827694 @default.
- W2556555801 cites W2188408244 @default.
- W2556555801 cites W3147414854 @default.
- W2556555801 hasPublicationYear "2015" @default.
- W2556555801 type Work @default.
- W2556555801 sameAs 2556555801 @default.
- W2556555801 citedByCount "1" @default.
- W2556555801 countsByYear W25565558012018 @default.
- W2556555801 crossrefType "journal-article" @default.
- W2556555801 hasAuthorship W2556555801A5005001580 @default.
- W2556555801 hasAuthorship W2556555801A5017213096 @default.
- W2556555801 hasAuthorship W2556555801A5027067890 @default.
- W2556555801 hasAuthorship W2556555801A5058604172 @default.
- W2556555801 hasAuthorship W2556555801A5058889703 @default.
- W2556555801 hasConcept C11413529 @default.
- W2556555801 hasConcept C121332964 @default.
- W2556555801 hasConcept C126255220 @default.
- W2556555801 hasConcept C127705205 @default.
- W2556555801 hasConcept C154945302 @default.
- W2556555801 hasConcept C173801870 @default.
- W2556555801 hasConcept C176181172 @default.
- W2556555801 hasConcept C177264268 @default.
- W2556555801 hasConcept C199360897 @default.
- W2556555801 hasConcept C21308566 @default.
- W2556555801 hasConcept C24890656 @default.
- W2556555801 hasConcept C2777212361 @default.
- W2556555801 hasConcept C29248071 @default.
- W2556555801 hasConcept C311688 @default.
- W2556555801 hasConcept C31258907 @default.
- W2556555801 hasConcept C33923547 @default.
- W2556555801 hasConcept C41008148 @default.
- W2556555801 hasConcept C45374587 @default.
- W2556555801 hasConcept C74172769 @default.
- W2556555801 hasConcept C81917197 @default.
- W2556555801 hasConcept C91331118 @default.
- W2556555801 hasConceptScore W2556555801C11413529 @default.
- W2556555801 hasConceptScore W2556555801C121332964 @default.
- W2556555801 hasConceptScore W2556555801C126255220 @default.
- W2556555801 hasConceptScore W2556555801C127705205 @default.
- W2556555801 hasConceptScore W2556555801C154945302 @default.
- W2556555801 hasConceptScore W2556555801C173801870 @default.
- W2556555801 hasConceptScore W2556555801C176181172 @default.
- W2556555801 hasConceptScore W2556555801C177264268 @default.
- W2556555801 hasConceptScore W2556555801C199360897 @default.
- W2556555801 hasConceptScore W2556555801C21308566 @default.
- W2556555801 hasConceptScore W2556555801C24890656 @default.
- W2556555801 hasConceptScore W2556555801C2777212361 @default.
- W2556555801 hasConceptScore W2556555801C29248071 @default.
- W2556555801 hasConceptScore W2556555801C311688 @default.
- W2556555801 hasConceptScore W2556555801C31258907 @default.
- W2556555801 hasConceptScore W2556555801C33923547 @default.
- W2556555801 hasConceptScore W2556555801C41008148 @default.
- W2556555801 hasConceptScore W2556555801C45374587 @default.
- W2556555801 hasConceptScore W2556555801C74172769 @default.
- W2556555801 hasConceptScore W2556555801C81917197 @default.
- W2556555801 hasConceptScore W2556555801C91331118 @default.
- W2556555801 hasLocation W25565558011 @default.
- W2556555801 hasOpenAccess W2556555801 @default.
- W2556555801 hasPrimaryLocation W25565558011 @default.
- W2556555801 hasRelatedWork W1490512485 @default.
- W2556555801 hasRelatedWork W1492104315 @default.
- W2556555801 hasRelatedWork W1575149721 @default.
- W2556555801 hasRelatedWork W162124312 @default.
- W2556555801 hasRelatedWork W1754938819 @default.
- W2556555801 hasRelatedWork W1996680281 @default.
- W2556555801 hasRelatedWork W2063354397 @default.
- W2556555801 hasRelatedWork W2154367227 @default.
- W2556555801 hasRelatedWork W244184887 @default.
- W2556555801 hasRelatedWork W2553033844 @default.
- W2556555801 hasRelatedWork W2607264901 @default.
- W2556555801 hasRelatedWork W2727318870 @default.
- W2556555801 hasRelatedWork W2775175850 @default.
- W2556555801 hasRelatedWork W2914416689 @default.
- W2556555801 hasRelatedWork W3032979640 @default.
- W2556555801 hasRelatedWork W3104975307 @default.
- W2556555801 hasRelatedWork W3136693265 @default.
- W2556555801 hasRelatedWork W56093097 @default.
- W2556555801 hasRelatedWork W588504562 @default.
- W2556555801 hasRelatedWork W1990905155 @default.
- W2556555801 isParatext "false" @default.
- W2556555801 isRetracted "false" @default.
- W2556555801 magId "2556555801" @default.
- W2556555801 workType "article" @default.