ScholarLens Back to search
2007•Information technology newsletterRequires access

An optimization algorithm of arbitrary shortest route between cities and its implementation

Jing Zhang

Open publisher page 3 citations

Abstract

This paper introduces a mathematical model and Dijkstra' algorithm of the shortest path,and uses Floyd' algorithm,which is an improved Dijkstra' algorithm,it changes the shortest path goal restrain of urban road into the solution of shortest path question,and builds a shortest model.It presents the course with MATLAB.The practical examples show the model and the algorithm are feasible.

About this research paper

What this paper is about

This paper introduces a mathematical model and Dijkstra' algorithm of the shortest path,and uses Floyd' algorithm,which is an improved Dijkstra' algorithm,it changes the shortest path goal restrain of urban road into the solution of shortest path question,and builds a shortest model.It presents the course with MATLAB.The practical examples show the model and the algorithm are feasible.

Why it matters

OpenAlex reports 3 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

This paper introduces a mathematical model and Dijkstra' algorithm of the shortest path,and uses Floyd' algorithm,which is an improved Dijkstra' algorithm,it changes the shortest path goal restrain of urban road into the solution of shortest path question,and builds a shortest model.It presents the course with MATLAB.The practical examples show the model and the algorithm are feasible.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An optimization algorithm of arbitrary shortest route between cities and its implementation — Research Paper | ScholarLens