摘要
根据列车调度问题的特点 ,将其首先转换成一般的行车路线问题 ,并给出一种启发式算法 。
This paper examines the freight trian-dispatching problem under maximum distance restrictions. By introducing an imaginary depot, the problem is transformed into an equivalent vehicle routing problem, a heuristic algorithm is then given. Some computational experience are also presented.
出处
《系统工程理论方法应用》
1998年第3期50-53,59,共5页
Systems Engineering Theory·Methodology·Applications
