• SHORTEST PATH OF A DOUBLY WEIGHTED GRAPH IN TRANSPORTATON PROBLEMS

Abstract

One of the important issues in everyday life is optimization problem involving reduction of cost and distance of distribution and transportation of goods. Researchers are always in line with this objective, by providing search tools trying various approaches to minimize such costs and distances. The purpose of this paper is to examine the problem and its solution by using graph theoretic algorithms and related theorems. Also, using the properties of a doubly weighted graph - a graph in which both vertices and edges are weighted, we develop a doubly weighted structure in matters of transport networks and then to find a shortest path with maximum vertex weights.