[PDF] Top 20 Differential evolution in shortest path problems

... value in the objective function ...consists in determining the shortest path between any two nodes in the network using the Dijkstra algorithm, and saving this values to posterior ... See full document

... Generally genetic algorithm will find good solutions in reasonable amount of time, but increases in time to find solutions if they are applied to harder and bigger problems. To overcome this problem ... See full document

... [11]]. In MAs, a local search mechanism is applied to members of the population in order to exploit the most promising regions gath- ered from global sampling done in the evolutionary ...uals ... See full document

... advancement in numerical computing power, TPBVPs can be converted to nonlinear programming problems that are solvable even for problems with many variables and constraints using numerical algorithms ... See full document

... routing problems, which can arise in the design of high-performance printed circuit boards (PCBs), have been proven to be ...NP-hard. In this article, we propose a mixed integer linear programming ... See full document

... challenging problems in biomedicine and genomics is how to identify the disease ...genes. In this study, we developed a computational method to identify colorectal cancer-related genes based on (i) ... See full document

... Differential evolution (DE) is one of the efficient evolutionary computing techniques that seem to be effective to handle optimization problems in many practical ...resulting in low ... See full document

... optimization problems were first studied in [Gupta and Rosenhead, ...RO problems were introduced by Kouvelis and Yu ...Robust Shortest Path problem [Karaşan et ...P-Hard problems ... See full document

... developments in Kalman smoothing, MAP state-path esti- mation by means of nonlinear optimization was considered as a generalization of linear smoothing to nonlinear systems subject to Gaussian noise (Bryson ... See full document

... of shortest path problem on dynamic networks have been analyzed: reoptimization of shortest paths and time-dependent ...these problems can be traced back respectively to the works of Gallo ... See full document

... map in O(log n) time [1] in comparison with O(n) time on multi-mesh network ...respectively. Shortest path routing is a kind of routing which attempts to send data packets over an ... See full document

... issues in communication networks (Jayakumar and Gopinath, ...optimal path for packet transmission within a specified time so as to satisfy the Quality of Service ...route in many communication ... See full document

... given in [HSD04], motivated by the RLC circuit of ...behave in an ideal way, and considering Kirchhoff’s laws, it is shown in [HSD04] that we only need two variables to fully describe the system, ... See full document

... location, path planning involves identifying a trajectory that will cause the robot to reach the goal location when executed ...[1]. Path planning is a strategic problem-solving competence, as the robot ... See full document

... devices in an internetwork ...used in communication on the internet are the OSI and ...best path to route the ...available in the ...protocols. In distance vector protocol, the router ... See full document

... findings in the study were: (1) Swallowing regions and the whole-brain metrics showed a similar node degree distribution and optimal small-world ...reported in this study provided new insights into how ... See full document

... provides path protection in addition to dynamic QoS awareness ...performance in terms of computation time and the solution becomes ...time. Shortest Path Adaptive Link Weight (SPALW) ... See full document

... Later, inspired by the above result, Zhang studied in [21] system (1.4) for a different range of exponents to those in [12]. Indeed, he proved that for α, β, r, s < 0 satisfying some appropriate ... See full document

... followed in AntHocNet [2, 8, 22, 23], which is a reactive-proactive multipath algorithm for routing in ...results in the presence of several types of ant-like agents. In particular, the design ... See full document

... order p. The fractional integral boundary conditions were introduced recently in [24]. Nonlocal conditions were initiated by Bitsadze [16]. As remarked by Byszewski [18–20], the nonlocal condition can be more ... See full document