Small Quantities of Cargo Transportation Route Selection Base on Minimum Spanning Tree Algorithm

Hong Yan Yu; Jin Long Ke; Meng Ting Li

doi:10.4028/www.scientific.net/AMM.599-601.1692

Paper Titles

Research on Vague Set of Target Threat Information Fusion Algorithm
p.1671

Research on Wireless Network Traffic Modeling Based on Channel State
p.1679

Research on XML Documents and Relational Database Mapping Based on XML Schema
p.1683

Simulation of Clouds Dynamics Based on the Change of Sight Distance
p.1688

Small Quantities of Cargo Transportation Route Selection Base on Minimum Spanning Tree Algorithm
p.1692

Smart Meter Based on Smart Energy Profile for ZigBee and Power Line Communication Connectivity-Enabled Home Area Network
p.1696

Software Design for Micromouse Special Navigation
p.1700

Software Design for Micromouse Straight Path Navigation
p.1704

Solid Rocket Motor Finite Element Analysis Based on the Reverse Modeling of ICT Images
p.1708

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 599-601Small Quantities of Cargo Transportation Route...

Small Quantities of Cargo Transportation Route Selection Base on Minimum Spanning Tree Algorithm

Abstract:

This paper mainly studies the single distribution center in the circumstances, transport path selection and vehicle allocation problem of small batch of goods. Using the theory of minimum spanning tree theory to the entire logistics network path selection research, while determining the nodes need to configure the transport vehicle for shunt transport, further establish the logistic distribution routing out several cars choice model, but also provides a direction for future research on this type of problem.

You might also be interested in these eBooks

Frontiers of Manufacturing Science and Measuring Technology IV

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 599-601)

Pages:

1692-1695

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.599-601.1692

Citation:

Cite this paper

Online since:

August 2014

Authors:

Hong Yan Yu*, Jin Long Ke, Meng Ting Li

Keywords:

Minimum Spanning Tree Algorithm, Small Quantities of Goods, Transportation Route Selection, Vehicle Allocation Strategy

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Dantzig G., Ramser J., The truck dispatching problem, Management Science. 6(1959)88-91.

DOI: 10.1287/mnsc.6.1.80

Google Scholar

[2] Yang Yi, Gu Xingsheng, Overview of logistics distribution vehicle scheduling optimization, Journal of Southeast University (NATURAL SCIENCE EDITION). 12(2005)105-111.

Google Scholar

[3] Catia M.S. Machado, Sergio F. Mayerle, Vilmar Trevisan, A linear model for compound multicommodity network flow problems, Computers and Operations Research . 6 (2009)33-43.

DOI: 10.1016/j.cor.2009.09.012

Google Scholar

[4] Anthony Chen, Panatda Kasikitwiwat, Modeling capacity flexibility of transportation networks, Transportation Research Part A. 2 (2010), 74-85.

Google Scholar

[5] Shu-Chu Liu, Wei-Ting Lee, A heuristic method for the inventory routing problem with time windows, Expert Systems With Applications. 10 (2011)33-42.

DOI: 10.1016/j.eswa.2011.04.138

Google Scholar

[6] Bo-Liang Lin, Zhi-Mei Wang, Li-Jun Ji, Ya-Ming Tian, Guo-Qing Zhou, Optimizing the freight train connection service network of a large-scale rail system, Transportation Research Part B. 5 (2011)55-67.

DOI: 10.1016/j.trb.2011.12.003

Google Scholar

[7] Christopher Expósito-Izquierdo, Belén Melián-Batista, Marcos Moreno-Vega, Pre-Marshalling Problem: Heuristic solution method and instances generator, Expert Systems with Applications. 9 (2012)12-21.

DOI: 10.1016/j.eswa.2012.01.187

Google Scholar