Publication Type:

Conference Proceedings

Source:

Electronics and Communication Systems (ICECS), 2014 International Conference on, IEEE, Coimbatore (2014)

ISBN:

9781479923212

URL:

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6892655&tag=1

Keywords:

Algorithm design and analysis, communication networks, data routing, Dijkstra algorithm, Dijkstra's algorithm, Hardware, Intelligent Transport System, intelligent transportation systems, Microcontrollers, object oriented programming, object-oriented programming, optimal vehicle routing, PIC16F877a microcontroller, road traffic, robot path planning, Robots, routing, traffic conditions, traffic density, Vehicle dynamics, vehicle routing, Visualization

Abstract:

This paper proposes a novel approach in finding an optimal solution for vehicle routing. The intention here is to find the shortest time path between different points. Dijkstra's algorithm is a very popular technique used in communication networks for data routing and in path planning of robots. Normally the implementation of Dijkstra's algorithm involves initialization of weights depending upon a particular cost metric, namely, distance. Based on an analysis of these weights, a choice of right path is made. This conventional approach states that the shortest path will take minimum time to travel. However this may not always be true. Even depending on the traffic conditions prevailing at that particular instant, the time taken may vary. The proposed work takes into consideration the traffic density in a particular path which influences the time taken for travel and then suggests an optimal path. The results are validated using concepts of Object Oriented Programming and tested in a hardware environment using PIC16F877a micro controller.

Cite this Research Publication

N. Gayathri and Chandrakala, K. R. M. Vijaya, “A novel technique for optimal vehicle routing”, Electronics and Communication Systems (ICECS), 2014 International Conference on. IEEE, Coimbatore, 2014.