A numerical method for solving shortest path problems

Chebyshev pseudo-spectral method is one of the most efficient methods for solving continuous-time optimization problems. In this paper, we utilize this method to solve the general form of shortest path problem. Here, the main problem is converted into a nonlinear programming problem and by solving o...

Full description

Saved in:
Bibliographic Details
Published in:Calcolo 2018-03, Vol.55 (1), Article 14
Main Authors: Noori Skandari, M. H., Ghaznavi, M.
Format: Article
Language:English
Subjects:
Mathematics
Mathematics and Statistics
Numerical Analysis
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Chebyshev pseudo-spectral method is one of the most efficient methods for solving continuous-time optimization problems. In this paper, we utilize this method to solve the general form of shortest path problem. Here, the main problem is converted into a nonlinear programming problem and by solving of which, we obtain an approximate shortest path. The feasibility of the nonlinear programming problem and the convergence of the method are given. Finally, some numerical examples are considered to show the efficiency of the presented method over the other methods.
ISSN:0008-0624
1126-5434
DOI:10.1007/s10092-018-0256-5