Quantity distribution and network matching flow are two core problems of the empty wagon distribution. Based on abstracting these problems, EWDCO model and corresponding algorithm are devised. It is found that identical path constraint doesn't correspond with EWDCO model and convection constraint won't affect the optimal solution. Thus, EWDCO model can be described as linear integer programming model, and ACO is superior to other algorithms.
Model and Ant Colony Optimization Algorithms for Railway Empty Wagons Distribution
First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China
2007-07-09
Conference paper
Electronic Resource
English
Model and Ant Colony Optimization Algorithms for Railway Empty Wagons Distribution
British Library Conference Proceedings | 2007
|Engineering Index Backfile | 1921
Engineering Index Backfile | 1901
Engineering Index Backfile | 1944
|Engineering Index Backfile | 1908