期刊文献+

定制公交多目标鲁棒优化模型与算法 被引量:1

Multiobjective Robust Optimization Model and Algorithm for Customized Bus
下载PDF
导出
摘要 为了确定定制公交在路网中的行驶路径,文章研究了乘客等车时间不确定环境中定制公交行驶路线的鲁棒优化问题:(1)以最小化运营公司的经营费用、最小化乘客的出行时间为优化目标,以车辆的容量限制、乘客的上、下车时间窗、不确定的乘客等车时间等为约束条件,建立了定制公交多目标鲁棒优化模型;(2)采用改进的NSGA-Ⅱ算法(Nondominated Sorting Genetic AlgorithmⅡ)进行求解,用基于未到达交通节点顺序的自然数编码方法进行编码,以锦标赛选择策略进行选择操作以及采用均匀变异方式进行变异操作;(3)选取兰州市局部路网进行案例研究。研究结果表明,运用本文建立的定制公交多目标鲁棒优化模型及求解算法,能快速得到满足优化目标的行驶路径。选用合理的行驶路线能够节约乘客的出行成本,增加运营公司的收益。 In order to determine the driving route of customized bus in the road network,this article studied the Robust optimization problem of customized bus driving route under uncertain passenger waiting time environment:(1)With the minimized operating costs of operating companies and the minimized passenger travel time as the optimization objective,and with the capacity constraints of vehicles,the get-on/off time window of passengers,and the uncertain waiting time of passengers as the constraint conditions,this article established the multi-objective Robust optimization model of customized bus.(2)Then it was solved by improved NSGA-II algorithm(Nondominated Sorting Genetic AlgorithmⅡ),and was programmed by natural number coding method based on the sequence of non-reached traffic nodes,with the tournament selection strategy for selection operation and the uniform mutation method for mutation operation;(3)Part of road network in Lanzhou was selected for case studies.The research results showed that using the multi-objective Robust optimization model and the solution algorithm of customized bus established in this article can quickly get the driving route to meet the optimization objectives.Choosing the reasonable travel route can save the travel cost of passengers and increase the income of operation company.
作者 陶浪 马昌喜 TAO Lang;MA Chang-xi(School of Traffic and Transportation,Lanzhou Jiaotong University,Lanzhou,Gansu.730070)
出处 《西部交通科技》 2018年第1期174-180,共7页 Western China Communications Science & Technology
基金 国家自然科学基金(编号:51408288)
关键词 城市交通 鲁棒优化 NSGA-Ⅱ算法 定制公交 锦标赛选择策略 Urban traffic Robust optimization NSGA-Ⅱalgorithm Customized bus Tournament selection strategy
  • 相关文献

参考文献4

二级参考文献47

  • 1J.D. Schaffer. Some experiments in machine learning using vector evaluated genetic algorithms: [Doctoral Dissertation]. Nashville TN:Vanderbilt University, 1984.
  • 2D.E. Goldberg. Genetic algorithms for search, optimization, and machine learning[M]. Reading Massachusetts: Addison-Wesley Publishing Compnay,1989.
  • 3C.M. Fonseca, P. J. Fleming. Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization[A].Proceedings of the Fifth International Conference on Genetic Algorithms[C]. San Mateo California: University of Illinois at Urbana-Champaign, Morgan Kauffman Publishers, 1993,416 ~ 423.
  • 4J. Horn, N. Nafploitis, D. E. Goldberg. A niched Pareto genetic algorithm for multiobjective optimization[A]. In: Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence[C]. Piscataway New Jersey:IEEE Service Center,1994. vol.1,82~87.
  • 5A.G. Kunha, P. Oliveira, J. A. Covas. (1997). Use of genetic algorithms in multicriteria optimization to solve industrial problems[A]. In: Thomas Back. Proceedings of the Seventh International Conference on Genetic Algorithms[C]. San Mateo California:Michigan State University, Morgan kaufmann Publishers, 1997,682 ~688.
  • 6K. Mitra, K. Deb, S. K. Gupta. Multiobjective dynamic optimization of an industrial Nylon 6 semibatch reactor using genetic algorithms[J].Journal of Applied Polymer Science, 1998,69(1):69 ~ 87.
  • 7C.M. Fonseca, P. J. Fleming. Multiobjective optimization and multiple constraint handling with evolutionary algorithms-Part Ⅱ:Application example[J]. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 1998,28(1):38 ~ 47.
  • 8E. Zitzler, L. Thiele. Multiobjective optimization using evolutionary algorithms-A comparative case study[A]. In: A. E. Eiben. Parallel Problem Solving from Nature V[C]. Amsterdam: Springer-Verlag,1998,292 ~ 301.
  • 9D.A. Van Veldhuizen,G. B. Lamont. Evolutionary Computation and Convergence to a Pareto Front[A]. In: J. R. Koza. Late Breaking Papers at the Genetic Programming 1998 Conference[C]. Stanford University California: Stanford University Bookstore, 1998, 221~228.
  • 10N. Srinivas, K. Deb. Multiobective optimization using nondominated sorting in genetic algorithms[R]. Technical report, Department of Mechanical Engineering, Indian Institute of Technology, Kanput,India, 1993.

共引文献73

同被引文献11

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部