• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2011, Vol. 33 ›› Issue (11): 75-79.

• 论文 • 上一篇    下一篇

公交车辆优化调度问题及其单亲遗传算

姚纯,李茂军   

  1. (长沙理工大学电气与信息工程学院,湖南 长沙 410114)
  • 收稿日期:2011-04-18 修回日期:2011-07-12 出版日期:2011-11-25 发布日期:2011-11-25

The Public Transport Dispatching Problem and Its ParthenoGenetic Algorithm

YAO  Chun,LI Maojun   

  1. (School of Electrical and Information Engineering,
    Changsha University of Science and Technology,Changsha 410114,China)
  • Received:2011-04-18 Revised:2011-07-12 Online:2011-11-25 Published:2011-11-25

摘要:

公交调度问题是一个典型的组合优化问题。本文结合我国城市公交常用调度模式,兼顾企业利益和乘客利益,建立了以企业收益满意度、乘客候车满意度为目标的公交线路发车频率优化模型,同时设计了一种求解该模型的单亲遗传算法。该算法在个体繁殖过程中引入随机变异步长并且增加中间子群体的迁移、重插入等操作。最后通过具体实例进行验证,仿真结果证实了算法的有效性。

关键词: 单亲遗传算法, 公交车调度, 数学模型, 变异步长, 中间群体

Abstract:

The bus scheduling problem is a typical combinatorial optimization problem. In this paper, combining with China’s urban public transport scheduling model and considering both the interests of company and passengers, the bus service frequency optimization model is established with company income satisfaction and passenger waiting satisfaction as the goals. Also a parthenogenetic algorithm for this model is designed. It introduces the random mutation step in individual reproduction, adding migration, reinsertion and other operations in intermediate subgroups. Finally, this algorithm is verified by a concrete examples. The simulation results show the superiority of the algorithm.

Key words: parthenogenetic algorithm;public transport dispatching;mathematical model;mutation step;intermediate group