首页 | 本学科首页   官方微博 | 高级检索  
     检索      

铁路车流径路优化的遗传算法设计
引用本文:农静,王磊,尹慧琳.铁路车流径路优化的遗传算法设计[J].同济大学学报(自然科学版),2010,38(1).
作者姓名:农静  王磊  尹慧琳
作者单位:1. 同济大学,电子与信息工程学院,上海,201804
2. 同济大学,中德学院,上海,200092
摘    要:将铁路车流径路的优化问题分解为两个:车流排列离散空间中车流排列优化,车流排列的评价计算.在给出车流排列的评价函数的定义后,引入旅行商问题的描述,把车流排列优化问题归约为TSP问题,从而给出了车流排列优化的复杂性分析.引入优先权编码,定义种群个体的适应值函数和相应的遗传操作,给出相应的遗传优化算法,并以实际运营数据为依据,进行仿真计算.通过同禁忌搜索法计算结果比较,遗传算法虽然在解的精度上略逊一筹,但计算工作量小得多,硬件要求也没有禁忌搜索法高.因此,具体选用应以具体情况而定.条件允许,最好将两种算法结合起来使用.

关 键 词:车流径路  遗传算法  评价函数  车流排列优化  旅行商问题  优先权编码

Optimization Design of Railway Car Flow Routing Based on Genetic Algorithm
NONG Jing,WANG Lei and YIN Huilin.Optimization Design of Railway Car Flow Routing Based on Genetic Algorithm[J].Journal of Tongji University(Natural Science),2010,38(1).
Authors:NONG Jing  WANG Lei and YIN Huilin
Institution:NONG Jing1,WANG Lei2,YIN Huilin2(1.College of Electronics , Information Engineering,Tongji University,Shanghai 201804,China,2.Chinese-German College of Postgraduate Studies,Shanghai 200092,China)
Abstract:Car flow routing optimization is decomposed into two parts:the evaluative function computing of car flow order and the car flow order permutation optimization.The paper first presents the definition of the function to evaluate the order,and then the introduction of the traveling salesman problem.By inducing that the car flow order permutation optimization is traveling salesman problem,an analysis is made of the computational complexity of the car flow routing optimization.The paper also presents a genetic a...
Keywords:car flow routing  genetic algorithm  evaluative function  car flow order permutation optimization  traveling salesman problem  priority weight coding
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《同济大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《同济大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号