An Efficient Genetic Algorithm for Solving Constraint Shortest Path Problem Through Specified Vertices

2018 ◽  
pp. 186-197
Author(s):  
Zhang Kai ◽  
Shao Yunfeng ◽  
Zhang Zhaozong ◽  
Hu Wei
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Shortest Path Problem

Application of Genetic Algorithm in modeling of Shortest Path problem

2020 ◽  
Author(s):  
Zhihui Yang ◽  
Huiwen Xia ◽  
Fuwen Su ◽  
Jiayu Zhao ◽  
Fan Feng
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Shortest Path Problem

Genetic Algorithm for Solving Fuzzy Shortest Path Problem in a Network with mixed fuzzy arc lengths

2011 ◽  
Author(s):  
Iraj Mahdavi ◽  
Ali Tajdin ◽  
Reza Hassanzadeh ◽  
Nezam Mahdavi-Amiri ◽  
Hosna Shafieian ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Shortest Path Problem ◽  
Arc Lengths

scholarly journals A genetic algorithm for the fuzzy shortest path problem in a fuzzy network

2020 ◽  
Author(s):  
Lihua Lin ◽  
Chuzheng Wu ◽  
Li Ma
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Ad Hoc ◽  
Real Life ◽  
Shortest Path Problem ◽  
Arc Length ◽  
Routing Problem ◽  
Path Lengths ◽  
Fuzzy Network ◽  
Arc Lengths

Abstract The shortest path problem (SPP) is an optimization problem of determining a path between specified source vertex s and destination vertex t in a fuzzy network. Fuzzy logic can handle the uncertainties, associated with the information of any real life problem, where conventional mathematical models may fail to reveal proper result. In classical SPP, real numbers are used to represent the arc length of the network. However, the uncertainties related with the linguistic description of arc length in SPP are not properly represented by real number. We need to address two main matters in SPP with fuzzy arc lengths. The first matter is how to calculate the path length using fuzzy addition operation and the second matter is how to compare the two different path lengths denoted by fuzzy parameter. We use the graded mean integration technique of triangular fuzzy numbers to solve this two problems. A common heuristic algorithm to solve the SPP is the genetic algorithm. In this manuscript, we have introduced an algorithmic method based on genetic algorithm for determining the shortest path between a source vertex s and destination vertex t in a fuzzy graph with fuzzy arc lengths in SPP. A new crossover and mutation is introduced to solve this SPP. We also describe the QoS routing problem in a wireless ad hoc network.

Developing a Genetic Algorithm to Solve Shortest Path Problem on a Raster Data Model

2008 ◽  
Vol 8 (18) ◽  
pp. 3289-3293 ◽  
Author(s):  
S. Behzadi ◽  
Ali A. Alesheikh ◽  
E. Poorazizi
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Data Model ◽  
Shortest Path Problem ◽  
Raster Data
Sign in / Sign up

Export Citation Format

Share Document