The Open Cybernetics & Systemics Journal

2015, 9 : 541-545
Published online 2015 June 26. DOI: 10.2174/1874110X01509010541
Publisher ID: TOCSJ-9-541

Research of Improved Dijkstra Algorithm Based Park Logistics Scheduling

Mo Taiping , Duan Renhang and Zhao Peisi
School of Electronic Engineering & Automation, Guilin University of Electronic Technology, Guangxi, 541004, P.R. China.

ABSTRACT

In the research of the park gathering industry manufacturing mode, the route of existing systems to provide logistics and transportation services often cannot meet the actual scheduling needs. To find a suitable distribution method is necessary. In this paper, based on the background of the industrial park logistics scheduling, the Dijkstra algorithm is investigated and proposed an improved algorithm based on the original algorithm. Experimental results show that the improved Dijkstra algorithm not only retains the advantages of the original algorithm, but also can quickly and accurately find out the optimal delivery route based on the latest traffic conditions, significantly improve the logistics park path search efficiency and optimize the quality of the scheduling. Realized reduce consumption, improve efficiency and reduce the purposes of logistics costs throughout the park.

Keywords:

Park logistics scheduling, Dijkstra algorithm, optimal path, impact factor.