ACKNOWLEDGEMENT

I take this opportunity to remember the almighty and my parents, who blessed who bestowed
strength, courage to perseverance to undertake the present course of study and complete it
successful First and foremost, I would like to express a deep sense of gratitude and sincere
regard toward Director, for his sustained guidance, meticulous supervision, and constant
encouragement during our dissertation work. My special thanks to Dr. Anand Kumar Gupta
(HOD CSE), Mr. Sharad Singh (Project Coordinator) who helped me in the execution of this
work and for providing necessary facilities with full cooperation, bestowing his excellent
guidance, encouragement, inspiring, motivation, valuable suggestion throughout this
project work.
I express my heartfelt and sincere thanks to my project guide Mr. Sandeep Kumar (Tula’s
Institute) for his excellent guidance, caring, patience and providing me an excellent
atmosphere for the completion of this project. Concerning this venture without their
encouragement, patience, and moral support it would not have been possible for me to
complete this project.

Date: 02/06/2023

Submitted by:
Anjali Kumari
Kanak Sharma

i
 TABLE OF CONTENTS

CHAPTER TITLE PAGE

ABSTRACT v

LIST OF FIGURES iii

LIST OF SYMBOLS, ABBREVIATIONS iv

1. INTRODUCTION 09

2. LITERATURE REVIEW 12

3. PROJECT METHODOLOGY/ MATERIAL & METHODOLOGY 37

4. OBSERVATIONS 50

5. RESULTS & DISCUSSION 54

6. CONCLUSION AND FUTURE SCOPE 57

7. REFERENCES 61

ii
 LIST OF FIGURES

FIG.NO. TITLE PAGE NO.

1. History of Python 06

2. Python Installation 07

3. Python Environment Configuration 07

4. Pandas 08

5. Dequeue 10

6. Heap queue 11

7. Numpy 13

8. ACO Algorithm 16

9. CSS 22

10. Javascript 23

11. List 38

12. Frontier 39

13. Road Segment Dataset 44

14. City gps Dataset 44

15. Homepage 47

16. Menu bar 47

17. Input Field 48

18. Input 49

19. Results 49

iii
 LIST OF SYMBOLS/ABBREVIATIONS USED

ABBREVIATION MEANING
AI Artificial Intelligence
ML Machine Learning
ACO Ant Colony Optimization
A* A star
BFS Breadth First Search
DFS Depth First Search
HTML Hypertext Markup Language
CSS Cascading Style Sheets
JS Javascript

iv
 ABSTRACT

This project investigates and develops a logistics truck path optimization solution. This study
optimizes the route to save travel time, fuel consumption, and cost. Genetic, ant colony, and
Dijkstra algorithms are examined in logistics. A proprietary algorithm based on these
methods finds the optimal path for a given set of restrictions and preferences in the project.
The programme saves money while preserving accuracy and efficiency in real-world
circumstances. The article concludes with suggestions for further research and logistics
algorithm applications. Logistics relies on effective goods movement. Logistics businesses
must find the best vehicle route. This project report identifies the best logistics vehicle route
to cut expenses and boost efficiency to solve this problem. The report examines genetic, ant
colony, and Dijkstra optimization methods. This project's proprietary algorithm reduces
distance, fuel consumption, and journey time to lower transportation costs. The programme
saves money while preserving accuracy and efficiency in real-world circumstances. The
algorithm can optimize logistics truck routes for delivery, raw material transfer, and supply
chain management.

This project report investigates A*-based city navigation. Commuting and exploring require
city navigation. A* quickly finds optimal paths in many applications. A* combines graph
traversal and heuristic search to find the shortest path between two sites. We investigate its
theoretical roots. Algorithms explore node growth, cost functions, and distance estimates. For
path finding, we map the road network using spatial data structures and GIS. Cities need real-
time navigation. A* improves with map and traffic data. Dynamic cost function adjustments
account for traffic congestion, enhancing route planning accuracy and efficiency. City maps
test our implementation. We test the A* pathfinding method. A* is faster and more accurate.
A* algorithm-based city navigation finishes this project report. Heuristic search and efficient
pathfinding provide optimal real-time navigation. The discoveries improve navigation
systems.

Keywords: Proprietary Algorithm, Dijkstra optimization, Heuristic search etc.