0% found this document useful (0 votes)
5 views8 pages

Shortest Path Algorithms

This project focuses on a shortest path algorithm using vector edge costs in Jaipur city, considering both traffic and distance. The algorithm employs Dijkstra's method alongside a convolution technique to optimize paths primarily for lower traffic. The output includes a detailed path taken by a car from the source to the destination, showcasing the effectiveness of the approach.

Uploaded by

Abhinav Agarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views8 pages

Shortest Path Algorithms

This project focuses on a shortest path algorithm using vector edge costs in Jaipur city, considering both traffic and distance. The algorithm employs Dijkstra's method alongside a convolution technique to optimize paths primarily for lower traffic. The output includes a detailed path taken by a car from the source to the destination, showcasing the effectiveness of the approach.

Uploaded by

Abhinav Agarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Shortest Path Algorithms

Multi Objective Optimization

Group 14
Introduction

● In this project we worked with shortest path algorithm where edge cost is vector rather than
scaler.
● We choose Jaipur city as our playground, where different nodes are different points in the city and
vertices is basically the path between them.
● We have two edge cost, first is the traffic between the two nodes and other is distance.
● Then we used shortest path algorithms and convolution method to find optimum path between
two user specified points.
Convolution Method
● We select a function which transforms vector weights into scalar weights.
● We have used Linear Convolution where scaler weight is calculated as linear combination of
vector weight combination.

● We choose λ1 = 0.4 and λ2 = 0.6.


● We have optimized our algorithm more towards traffic, such that it finds path with less traffic.
Shortest Path Algorithm
● Our program is making use of the Shortest Path algorithm given by Dijkstra.
● In our program the traffic matrix is one edge cost and the other edge cost is the distance between two
points.Our algorithm uses the convolution method to calculate the final value on the basis of which the
path of car is decided.
● The car can move in all eight directions if the road is unblocked(4 along diagonals and 4 basic
directions).Our program calculates the final values in each direction using the convolution formula and
insert them in the priority queue on the basis on lesser values first.
● We then perform the Dijkstra algorithm approach of marking each node visited and then going onto the
next unvisited node and check if the new final value is lesser than the current value stored.
● We keep on performing it till we reach the destination.Hence an optimal path from source to destination if
it exists is obtained.
Working

Distance Matrix Traffic Matrix


Output
16 50

Car has reached Destination

If you want to see the path followed by Car press 1

(1,4)(jaipur junction) -> (2,5) -> (3,6) -> (3,7) -> (3,8)(chand pole) -> (4,9) -> (5,10) -> (6,11) -> (6,12) -> (6,13) ->
(5,14) -> (4,13) -> (3,14) -> (2,15) -> (2,16) -> (1,17) -> (1,18) -> (1,19)(LNMIIT)
Group Members

1. Harsh Chauhan - 19UCS034


2. Samarth Agarwal - 19UCS063
3. Abhinav Agarwal - 19UCS254
4. Sumit Ailani - 19UCS255
5. Yash Kedia - 19UCS256
Thank You

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy