INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM

INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM

<p>The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination. Network analysis provides strong decision support for users in searchin...

Full description

Bibliographic Details
Main Authors: S. Behzadi, M. Kolbadinejad
Format: Article
Language:English
Published: Copernicus Publications 2019-10-01
Series:The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Online Access:https://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XLII-4-W18/201/2019/isprs-archives-XLII-4-W18-201-2019.pdf
id doaj-6b6311d75727421794b79c153e416eb2
record_format Article
spelling doaj-6b6311d75727421794b79c153e416eb22020-11-25T00:13:11ZengCopernicus PublicationsThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences1682-17502194-90342019-10-01XLII-4-W1820120310.5194/isprs-archives-XLII-4-W18-201-2019INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHMS. Behzadi0M. Kolbadinejad1Faculty of Civil Engineering, Shahid Rajaee Teacher Training University, Tehran, IranThe Ministry of Interior of the Islamic Republic of Iran<p>The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination. Network analysis provides strong decision support for users in searching shortest path. A lot of algorithms are designed for solving shortest path but most of them did not considered the conditions of the networks. Genetic Algorithm is a kind of Algorithm that has a lot of efficiency and it can be used for solving many kinds of problems. It also can be used based on the condition of the problems.</p><p>In this paper, Genetic Algorithm is used for solving shortest path in multistage process planning (MPP) problem. New mutations as well as crossover parameters are defined for each network based on the conditions of them. The results of our experimental demonstrate the effectiveness of the models.</p>https://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XLII-4-W18/201/2019/isprs-archives-XLII-4-W18-201-2019.pdf
collection DOAJ
language English
format Article
sources DOAJ
author S. Behzadi
M. Kolbadinejad
spellingShingle S. Behzadi
M. Kolbadinejad
INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
author_facet S. Behzadi
M. Kolbadinejad
author_sort S. Behzadi
title INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM
title_short INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM
title_full INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM
title_fullStr INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM
title_full_unstemmed INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM
title_sort introducing a novel method to solve shortest path problems based on structure of network using genetic algorithm
publisher Copernicus Publications
series The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
issn 1682-1750
2194-9034
publishDate 2019-10-01
description <p>The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination. Network analysis provides strong decision support for users in searching shortest path. A lot of algorithms are designed for solving shortest path but most of them did not considered the conditions of the networks. Genetic Algorithm is a kind of Algorithm that has a lot of efficiency and it can be used for solving many kinds of problems. It also can be used based on the condition of the problems.</p><p>In this paper, Genetic Algorithm is used for solving shortest path in multistage process planning (MPP) problem. New mutations as well as crossover parameters are defined for each network based on the conditions of them. The results of our experimental demonstrate the effectiveness of the models.</p>
url https://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XLII-4-W18/201/2019/isprs-archives-XLII-4-W18-201-2019.pdf
work_keys_str_mv AT sbehzadi introducinganovelmethodtosolveshortestpathproblemsbasedonstructureofnetworkusinggeneticalgorithm
AT mkolbadinejad introducinganovelmethodtosolveshortestpathproblemsbasedonstructureofnetworkusinggeneticalgorithm
_version_ 1725395921910366208

Similar Items