The Comparison of Four Algorithms in Shortest Path Issue: Case Study

Abstract

The solution for many transportation problems is to find the most efficient and cost-effective route for the transportation of goods. Often, the most suitable route can be expressed as an algorithm. Selecting the optimal algorithm and using the most efficient route is essential for businesses in distributing their product in the most profitable way for the enterprise. This paper addresses a case study in an enterprise called "ASI" farm in Kosovo, which distributes products through its distribution points. The shortest path from the distribution points to the required locations is selected by comparing four different routes expressed in the form of four different algorithms. In developing transportation models, the primary concern is to come up with the best way possible for transporting goods produced at different factories or plants (called supply origins) to many warehouses or customers (called demand destinations). The most optimal route translates into the most efficient path or lower transportation cost and ultimately higher profit for the organization. In this case study, a transport problem network model has been developed, which then has been analysed in detail in order to minimize shipping costs. Then the results are compared from Solver to Excel.
Copyright © 2021 Praise Worthy Prize - All rights reserved.