Optimizing postal networks using Fibonacci heap method

by Filip Bedjovski

Submitted : Spring 2015

  Every postal office uses the most basic approach for mail delivery: get the mail from one post office and deliver it to the closest postal office to the receiver. By representing every postal office as a node from one graph, an algorithm can be made to find the minimum cost and maximum effectiveness to deliver the mail. And that process can be faster by using Fibonacci sequence as a heap method to make the search faster.

[ Back ]