Adaptive Micro-Channel Real-Time Interactive Systems of Nanchang Road Congestion Based on Improved Dijkstra Algorithm

Article Preview

Abstract:

The key technology research and development projects of national vehiclenetworking system needs, software products and components, developed withindependent intellectual property rights and core technologies based onimproved Dijkstra algorithm Nanchang road congestion adaptive system based onmicro-channel real-time interaction; main contents of transportation forNanchang adaptive significance of congestion vehicle networking applications,the status quo and research problems. GPS has immediate feedback andmicro-channel platform for mutual exchange of powerful features. Thuscountermeasures to enhance vehicle networking applications, Jiangxi Science andTechnology Park level. Developed based on the GPSNanchang traffic congestion adaptive micro-channel platform system, thesoftware product has low prices, professional, practical, easy installation,simple operation, with independent intellectual property rights, perfectlysuited for automotive units practical operation. Has a strong competitiveadvantage. The research results can be widely used in the province actual carservice units (including the use of e-commerce), a system price of Wu Yuan,automotive service products can be formed in Jiangxi Province, the developmentof new industries and generate significant economic benefits.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 1079-1080)

Pages:

638-641

Citation:

Online since:

December 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Christina Gunkel, Alexander Stepper, Arne Müller, Christine Müller.  Micro crack detection with Dijkstra's shortest path algorithm[J]. Machine Vision and Applications . 2012 (3).

DOI: 10.1007/s00138-011-0324-1

Google Scholar

[2] Li Rui.  Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS[J]. Key Engineering Materials . 2010 (419).

DOI: 10.4028/www.scientific.net/kem.419-420.557

Google Scholar

[3] Vladica Tintor, Jovan Radunović.  Distributed Dijkstra sparse placement routing algorithm for translucent optical networks[J]. Photonic Network Communications . 2009 (1).

DOI: 10.1007/s11107-008-0170-x

Google Scholar

[4] Xavier Gandibleux, Frédéric Beugnies, Sabine Randriamasy.  Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function[J]. 4OR . 2006 (1).

DOI: 10.1007/s10288-005-0074-x

Google Scholar