Implementation of Dijkstra's shortest path algorithm for vehicle routing
On-demand services that requires the picking up of passengers and sharing of rides among passengers is a complex Vehicle Routing Problems set. Services like Uber and Grab, have been finding the most optimum way to make their services less costly so as the increase their profit margin. ST Engineering...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/71551 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | On-demand services that requires the picking up of passengers and sharing of rides among passengers is a complex Vehicle Routing Problems set. Services like Uber and Grab, have been finding the most optimum way to make their services less costly so as the increase their profit margin. ST Engineering and NTU has also been working on autonomous vehicles in hopes that it can take over the public transport systems in the near future. My project thus focuses on traffic simulations within Singapore to find the shortest path between any source and destination as this would reduce fuel consumption and allow more passengers to take on the service within a time frame. We will use a traffic simulation software, PTV VISSIM to simulate the traffic conditions along Singapore map. However, to simulate specific conditions, it requires MATLAB (COM programming) to give specific commands to the cars in VISSIM. My project is to implement Dijkstra’s algorithms via COM programming to find the shortest path between any two locations. |
|---|