A Comparative Case Study on Shortest Path of Environmentally Sustainable Multi-Objective Transportation Problem: Dijkstra’s and Ant Colony Optimization Algorithms.

Abstract

Shortest path problem (SPP), is one of the most widely known topics in graph theory. Across various disciplines of SPP numerous real-world applications have been used. It is a combinatorial optimization (CO) problem that takes various forms. The main objective of this research is to determine a shortest path in a transport network based on a real-world case study that contemplates sustainable route planning. A comparative analysis of ACO and Dijkstra’s algorithms are accomplished in this study. Based on the real- world scenario, we describe the single- and multi-objective ACO and Dijkstra's algorithm to determine the shortest path problem. We have incorporated a Python code to solve the second case.