A Heuristic Algorithm for Optimizing Postal Transportation Schedule
We study a mathematical model for the network structured postal transportation schedule problem and its corresponding neural network (NN) algorithm in this paper. Through analyzing the specific characteristics of this problem and the shortcomings of the NN algorithm, we develop a heuristic algorithm. It is proved to be effective by our simulation results. And it can generate acceptable results with good performance.
Long Chen Guoyin Wang
Institute of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing, 400065, P. R. China
国际会议
8th International Conference on Neural Information Processing(ICONIP 2001)(第八届国际神经信息处理大会)
上海
英文
585-588
2001-11-14（万方平台首次上网日期，不代表论文的发表时间）