Goods Transportation Problem Solving via Routing Algorithm

TL;DR

This paper presents a graph-based heuristic routing algorithm tailored for a specific goods transportation problem, aiming to minimize delivery costs on an undirected graph with a single good type.

Contribution

It introduces a novel heuristic-driven routing algorithm specifically designed for a simplified goods transportation problem, focusing on cost minimization.

Findings

The algorithm effectively reduces transportation costs.

The heuristic approach provides efficient solutions.

The method is applicable to similar transportation scenarios.

Abstract

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.