期刊文献+

城市公共自行车高峰期需求不均衡的调度优化研究 被引量:22

Scheduling optimization research on demand imbalance of urban public bicycles during peak period
下载PDF
导出
摘要 通过对城市公共自行车系统自行车高峰期需求不均衡的使用状况进行研究,讨论公共自行车车辆调度优化,研究车辆路径问题。构建车辆优化调度模型,并设计禁忌搜索算法对模型进行求解,得出公共自行车需求高峰期车辆调度路径,最后构造算例对调度路径进行算例分析。研究结果表明:该模型具有一定的实用价值,可以实现城市公共自行车高峰期需求不均衡的车辆调度优化。 Through the research on the use of unbalanced condition of the urban public bicycle peak demand, the problem of vehicle scheduling of public bicycles was discussed, and the vehicle routing issue was investigated. The model of vehicle optimization scheduling was constructed. Consequently, the tabu search algorithm was designed to resolve the model and get the vehicle scheduling path of public bicycle peak demand. At last, the case examples for scheduling path were conducted. The results show the model has a certain practical value, since it can achieve vehicle scheduling optimization for urban public bicycle peak demand imbalance.
出处 《铁道科学与工程学报》 CAS CSCD 北大核心 2015年第2期441-448,共8页 Journal of Railway Science and Engineering
基金 湖南省交通科技项目(201248)
关键词 公共自行车 调度 需求不均衡 禁忌搜索算法 public bicycle scheduling imbalance demand tabu search algorithm
  • 相关文献

参考文献9

二级参考文献32

  • 1[1]Schrage L. Formulation and structure of more complex/realistic routing and scheduling problems[J]. Networks, 1981,11: 229-232.
  • 2[2]Sariklis D and Powell S. A heuristic method for the open vehicle routing problem[J]. Journal of the Operational Research Society, 2000,51: 564-573.
  • 3[3]Fu Z.and Wright M. Train plan model for British rail freight services through the channel tunnel[J]. Journal of the Operational Research Society, 1994,45(4):384-391.
  • 4[4]Dulac G, Ferland JA and Forgues PA. School bus routes generator in urbansurroundings[J]. Computers and Operations Research, 1980,7:199-213.
  • 5[5]Braca J, Bramel J, Posner B and Simchi-levi D. A computerized approach to the New York city school bus routing problem[J]. IIE Transactions, 1997,29:693-702.
  • 6[6]Li LYO and Fu Z. The school bus routing problem: a case study[J]. Journal of the Operational Research Society, 2002,53(5):552-558.
  • 7[7]Syslo MM, Deo N and Kowalik JS. Discrete Optimization Algorithms with Pascal Programs[M]. New Jersey: Prentice-Hall, Inc, 1983. 381-382.
  • 8[8]Brand(a~o) J. The open vehicle routing problem[R]. Presented in EURO 2001, Rotterdam, The Netherlands. 2001.
  • 9[9]Cripim J and Brand(a~o) J. Reactive tabu search and variable neighbourhood descent applied to the open vehicle routing problem[R]. Presented in Optimization 2001, Aveiro, Portugal. 2001.
  • 10[10]Fu Z and Eglese R. Train planning and timetabling - a kind of open vehicle routing problem with soft time windows[R]. Presented in IFORS 2002, Edinburgh, UK. 2002.

共引文献191

同被引文献100

引证文献22

二级引证文献81

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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