scholarly journals Path-finding Algorithm using Heuristic-based Genetic Algorithm

2017 ◽  
Vol 17 (5) ◽  
pp. 123-132
Author(s):  
Jung-Woon Ko ◽  
◽  
Dong-Yeop Lee
Keyword(s):  
Genetic Algorithm ◽  
Path Finding

scholarly journals The Combination of Morphological and Evolutionary Algorithms for Graph-based Pathfinding on Maps with Complex Topologies

2019 ◽  
Author(s):  
Игорь Савостин ◽  
Igor' Savostin ◽  
Андрей Трубаков ◽  
Andrey Trubakov
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Real Data ◽  
Combinatorial Complexity ◽  
Ant Algorithm ◽  
Stochastic Algorithms ◽  
Morphological Operations ◽  
Path Finding ◽  
Large Size ◽  
Dijkstra's Algorithm

One of the difficult problems to solve has always been and still remains the problem of finding a path either in a graphic chart or a graphic maze of large size. The main problem is that traditional algorithms require a lot of time due to combinatorial complexity. At the same time, both classical algorithms based on the search of variants (such as Dijkstra's algorithm, A*, ARA*, D* lite), and stochastic algorithms (ant algorithm, genetic), alongside with algorithms based on morphology (wave) are not always able to achieve the goal. The article proposes a new modification of the path-finding algorithm, which is a hybrid of the following: the morphological operations on graphic chart approach and genetic algorithm having a useful property of elasticity in time. The experiments (both synthetic and real data) have shown the feasibility of the proposed idea and its comparison with the most commonly used algorithms of contemporaneity.

scholarly journals Genetic algorithm based protocols to select cluster heads and find multi-hop path in wireless sensor networks: review

2018 ◽  
Vol 218 ◽  
pp. 03019 ◽  
Author(s):  
Mohammed Al-Shalabi ◽  
Mohammed Anbar ◽  
Tat-Chee Wan
Keyword(s):  
Genetic Algorithm ◽  
Optimization Technique ◽  
Specific Area ◽  
Modern Technology ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Path Finding ◽  
Radio Communication ◽  
Cluster Heads

A wireless sensor network (WSN) is a modern technology in radio communication. A WSN comprises a number of sensor nodes that are randomly spread in a specific area for sensing and monitoring physical attributes that are difficult to monitor by humans, such as temperature, fire, and pressure. Many problems, including data transmission, power consumption and selecting cluster heads, may occur due to the nature of WSNs. Various protocols have been conducted to resolve these issues. Most of the proposed protocols are based on the Genetic Algorithm as an optimization technique to select the Cluster Heads (CHs) or to find a multi-hop path for sending the data from the CHs to the Base Station (BS). This paper presents a comprehensive study of the protocols for WSNs that are proposed to come up with these issues. This study emphasises on CHs selection protocols and multi-hop path finding protocols and their strengths and weaknesses. A new taxonomy is presented to discuss these protocols on the basis of different classes. A complete comparison of the main features and behaviors of the protocols is conducted. This study will give basic guidelines for the researchers those have a motivation to develop a new CHs selection protocol or a multi-hop path finding protocol.

Multi-objective path finding in stochastic time-dependent road networks using non-dominated sorting genetic algorithm

2015 ◽  
Vol 42 (12) ◽  
pp. 5056-5064 ◽  
Author(s):  
Mojtaba Rajabi-Bahaabadi ◽  
Afshin Shariat-Mohaymany ◽  
Mohsen Babaei ◽  
Chang Wook Ahn
Keyword(s):  
Genetic Algorithm ◽  
Road Networks ◽  
Time Dependent ◽  
Path Finding ◽  
Multi Objective ◽  
Stochastic Time

The ground state energy of the ±J spin glass from the genetic algorithm

1994 ◽  
Vol 4 (9) ◽  
pp. 1281-1285 ◽  
Author(s):  
P. Sutton ◽  
D. L. Hunter ◽  
N. Jan
Keyword(s):  
Genetic Algorithm ◽  
Spin Glass ◽  
Ground State Energy ◽  
Ground State ◽  
State Energy
Sign in / Sign up

Export Citation Format

Share Document