DocumentCode
1598177
Title
Notice of Retraction
Numerical Simulation of Optimal Transport Paths
Author
Qinglan Xia
Author_Institution
Dept. of Math., Univ. of California at Davis, Davis, CA, USA
Volume
1
fYear
2010
Firstpage
521
Lastpage
525
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
Transport networks with branching structures are observable not only in nature as in trees, blood vessels, etc. but also in efficiently designed transport systems such as used in railway configurations and postage delivery networks. Mathematically, such a branching transport network is modeled by an optimal transport path between two probability measures (representing the source and the target). An essential feature of such a transport path is to favor group transportation in a large amount. This article provides numerical simulation of optimal transport paths. We first construct an initial transport path, and then modify the path as much as possible by using both local and global minimization algorithms.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
Transport networks with branching structures are observable not only in nature as in trees, blood vessels, etc. but also in efficiently designed transport systems such as used in railway configurations and postage delivery networks. Mathematically, such a branching transport network is modeled by an optimal transport path between two probability measures (representing the source and the target). An essential feature of such a transport path is to favor group transportation in a large amount. This article provides numerical simulation of optimal transport paths. We first construct an initial transport path, and then modify the path as much as possible by using both local and global minimization algorithms.
Keywords
numerical analysis; optimisation; probability; transportation; trees (mathematics); branching transport network; global minimization algorithm; local minimization algorithm; numerical simulation; optimal transport path; probability; Atomic measurements; Blood vessels; Computational modeling; Computer simulation; Mathematical model; Numerical models; Numerical simulation; Rail transportation; Rivers; Topology; Stein tree; branching structure; optimal transport path; simulation; transport network;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Modeling and Simulation, 2010. ICCMS '10. Second International Conference on
Conference_Location
Sanya, Hainan
Print_ISBN
978-1-4244-5642-0
Type
conf
DOI
10.1109/ICCMS.2010.30
Filename
5421335
Link To Document