In this paper, we analyze the condition of three-station scattered freight loading problem and use least wasting ton kilometer as object building up optimal model of this problem. Three-station scattered freight loading is a continuous assignment problem, the carrying capacity is wasted when we organize many-station scattered freight loading and middle stations have not freight be loaded. How to optimize the three-station scattered freight loading problem so that made carrying capacity wasting least is a worthy problem under the condition of railway wagons shortage and transportation capacity density. We obtain the solution according genetic algorithm; dispose the inefficacious solution according chromosome fitness and incidence matrices. Finally some experiments are performed to show the effectiveness of the models and algorithms. The results indicate that GA is effective to solve such problem.
Solution of Three-Station Scattered Freight Loading Problem Based on Genetic Algorithm
First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China
2007-07-09
Conference paper
Electronic Resource
English
Solution of Three-Station Scattered Freight Loading Problem Based on Genetic Algorithm
British Library Conference Proceedings | 2007
|Three-Dimensional Loading Optimization Problem of Freight Transshipment in Multimodal Transportation
British Library Conference Proceedings | 2007
|Solution of minimum bounding box of scattered points based on genetic algorithm
British Library Online Contents | 2013
|Container Loading Problem Based on Improved Genetic Algorithm
British Library Conference Proceedings | 2007
|