检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与应用》2011年第20期210-213,共4页Computer Engineering and Applications
基 金:国家自然科学基金(No.50968009);教育部高等学校博士点基金项目(No.20096204110003)~~
摘 要:针对公交时刻表设计问题,考虑客流到站的拥挤特征,结合公交车辆运行和乘客到站的时间约束,建立公交时刻表的优化模型。针对模型的特点,设计有序整数编码的遗传算法,对遗传操作进行改进,采用多种方式相结合的选择操作,以及绝对值比较法的区域交叉操作。通过实例测试,在满足公交企业和乘客需求的前提下,得到最优发车车次和车辆在起点站的发车时刻,并结合均衡时刻发车的结果,表明该算法能够有效地解决城市公交时刻表的优化问题。Considering the crowded characteristic of the passengers arrival, and the time constraints of the buses, the model of the bus timetable is established in this paper.According to the characteristic of the model, an orderly integer-coded genetic algorithm is designed to solve the problem, and it is also improved by means of combining various ways of selection operation and comparing with the absolute value of crossover operation.The optimization bus number can be obtained through a case study which meets the demands of transit enterprises and passengers.Compared with the balanced departure, the result is more reasonable,and it also demonstrates the algorithm is efficient to solve the bus timetable problem.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222