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: | Pang, Jacquelyn Jiaqi |
---|---|
Other Authors: | Justin Dauwels |
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 |
Similar Items
-
Finding the shortest route using cases, knowledge, and Dijkstra's algorithm
by: Liu, Bing, et al.
Published: (2014) -
Finding all hops shortest paths with quality-of-service constraints
by: Su, Myat Mon.
Published: (2012) -
Dijkstra's algorithm vs transit algorithm
by: Chua, Esther Yizhen.
Published: (2011) -
Mobility on-demand algorithms for vehicle routing in Sentosa
by: Yong, Yong Qian
Published: (2017) -
Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach
by: CAO, Zhiguang, et al.
Published: (2016)