| Article ID: | iaor20023340 |
| Country: | China |
| Volume: | 40 |
| Issue: | 2 |
| Start Page Number: | 143 |
| End Page Number: | 146 |
| Publication Date: | Apr 2001 |
| Journal: | Journal of Fudan University |
| Authors: | Ye Yaohua, Yin Zhiwen, Zheng Fangxian, Zhong Wei, Wei Guohua, Zhu Yirong |
| Keywords: | networks: path, vehicle routing & scheduling |
Every day many items of post are delivered from the local post office to the branch post offices by vehicles in cities of China. It is required that the total distance travelled is to be minimized. It is called the local post transportation routes problem (LPTRP). A model of LPTRP and its algorithm are presented, and we have applied it to the organization of local post transportation routes for a big city in China. The scheme has reduced the distance travelled by 8.3 percent.