A Shortest Path Algorithm with Constraints in Networks

The paper deals with the shortest path problem with Constraints, and it is NP-complete problem. The problem is formulated as an optimization model. To solve this model Lagrangean relaxation algorithm is adopted. For the solution of the dual problem a subgradient method is used. The general algorithm steps for our problem are presented, and a numerical example on communication network is given to illustrate the effectiveness of the algorithm.