  This paper outlines the ideas behind developing a graph-based
heuristic-driven routing algorithm designed for a particular instance of a
goods transportation problem with a single good type. The proposed algorithm
solves the optimization problem of satisfying the demand of goods on a given
undirected transportation graph with minimizing the estimated cost for each
traversed segment of the delivery path. The operation of the routing algorithm
is discussed and overall evaluation of the proposed problem solving technique
is given.
