Research on the Shortest Path Problem Based on Green Transportation

Article Preview

Abstract:

The shortest path problem is a typical mathematical optimization problem which often encountered in the production field and daily life. From the perspective of green transportation, in this paper, the shortest path problem in Hebei Province was put forward that applied the operations research knowledge, and solved the analysis by lingo11.0. The results showed that the shortest path is 2230.00 km that started from Shijiazhuang through each prefecture-level city, then back to Shijiazhuang. The shortest path from Shijiazhuang to Qinhuangdao is 589.00 km.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 1010-1012)

Pages:

1858-1861

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Information on http: /www. ilc. net. cn/map/HeBei/HeBei. jpg. html#userconsent.

Google Scholar

[2] Yunquan Hu, Basic and applied of operations research[C], 5 Edison, Beijing: Higher Education Press (2008).

Google Scholar

[3] Zhang H-W, Z Niu Z-G, LINGO8. 0 and its application in environmental systems optimization[C], Tianjin: Tianjin University Press (2005).

Google Scholar

[4] Vzsquez M., Vimont Y. Improved results on the 0-1 multidimensional knapsack problem [J]. European Journal of Operational Research, 165(1): 70-81, (2005).

DOI: 10.1016/j.ejor.2004.01.024

Google Scholar