Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1708378 | Applied Mathematics Letters | 2012 | 5 Pages |
Abstract
A special and important network structured linear programming problem is the shortest path problem. Classical shortest path problems assume that there are unit of shipping cost or profit along an arc. In many real occasions, various attributes (various costs and profits) are usually considered in a shortest path problem. Because of the frequent occurrence of such network structured problems, there is a need to develop an efficient procedure for handling these problems. This paper studies the shortest path problem in the case that multiple attributes are considered along the arcs. The concept of relative efficiency is defined for each path from initial node to final node. Then, an efficient path with the maximum efficiency is determined.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Alireza Amirteimoori,