%0 Journal Article
%T The Research of Terminal Distribution  Network Path Optimization
%A Xufeng Zhang
%A Xinyu Zhang
%J Journal of Computer and Communications
%P 28-37
%@ 2327-5227
%D 2014
%I Scientific Research Publishing
%R 10.4236/jcc.2014.25002
%X <p class=\"MsoNormal\">
	<span style=\"font-size:10pt;font-family:'}', serif;\" lang=\"EN-US\"><span style=\"font-size:12px;font-family:Verdana;\">This paper presents an
optimization problem about terminal distribution network path, defining the
research problem through its distribution operation process, next to the
terminal distribution route optimization. To begin with, dynamic optimization
algorithm</span><span class=\"apple-converted-space\" style=\"font-size:12px;font-family:Verdana;\"> </span><span style=\"font-size:12px;font-family:Verdana;\">is</span><span class=\"apple-converted-space\" style=\"font-size:12px;font-family:Verdana;\"> </span><span style=\"font-size:12px;font-family:Verdana;\">built, the first from the target
distribution node distribution vehicle, and goods to N customers</span><span class=\"apple-converted-space\" style=\"font-size:12px;font-family:Verdana;\"> </span><span style=\"font-size:12px;font-family:Verdana;\">are</span><span class=\"apple-converted-space\" style=\"font-size:12px;font-family:Verdana;\"> </span><span style=\"font-size:12px;font-family:Verdana;\">delivered,
in the most appropriate distribution route to the minimum distribution distance
and optimizing the terminal distribution path.</span><span class=\"apple-converted-space\" style=\"font-size:12px;font-family:Verdana;\"> </span><span style=\"font-size:12px;font-family:Verdana;\">Two parts to build and example areincluding
algorithm.</span></span> 
</p>
%K The Terminal Distribution
%K Dynamic Optimization Algorithm
%K Path Optimization
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=44187