ScholarLens Back to search
2010•Computer Knowledge and TechnologyRequires access

Shortest Path Problem and its Solution Methods Study

Zhou Xian-shu

Open publisher page 1 citations

Abstract

Shortest path problem is to find a shortest path from the start point to the end point in a given net graph.This paper will intro-duce four algorithm design methods,which are Dynamic programming,Dijkstra algorithm,A-star algorithm,Genetic algorithm,summarize their basic tenets,give the solving algorithm thought to the shortest path problem,analyse the algorithms and put forward the improving methods.

About this research paper

What this paper is about

Shortest path problem is to find a shortest path from the start point to the end point in a given net graph.This paper will intro-duce four algorithm design methods,which are Dynamic programming,Dijkstra algorithm,A-star algorithm,Genetic algorithm,summarize their basic tenets,give the solving algorithm thought to the shortest path problem,analyse the algorithms and put forward the improving methods.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Shortest path problem is to find a shortest path from the start point to the end point in a given net graph.This paper will intro-duce four algorithm design methods,which are Dynamic programming,Dijkstra algorithm,A-star algorithm,Genetic algorithm,summarize their basic tenets,give the solving algorithm thought to the shortest path problem,analyse the algorithms and put forward the improving methods.

Key concepts: Yen's algorithm, Shortest path problem, K shortest path routing, Computer science, Shortest Path Faster Algorithm, Dijkstra's algorithm, Constrained Shortest Path First, Widest path problem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Shortest Path Problem and its Solution Methods Study — Research Paper | ScholarLens