全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

接运公交网络设计的多目标优化模型及遗传变邻域搜索求解算法

Keywords: 接运公交,网络设计,候选线路,多目标优化,遗传-变邻域搜索算法

Full-Text   Cite this paper   Add to My Lib

Abstract:

为了使接运公交网络更好地为轨道交通车站集散客流服务,将其作为研究对象,提出了接运公交网络的优化方法.考虑接运公交网络服务的需求量与接运公交供给密切相关、接运公交发车时刻与轨道交通车辆到站时刻构成有序衔接,以接运公交服务的乘客量最大化、接运乘客平均成本最小化、运营成本最小化为优化目标,构建了接运公交网络的多目标优化模型.为求解模型,设计了利用产生式方法获得Pareto解集的遗传-变邻域搜索算法.将设计的遗传-变邻域搜索算法与遗传算法、精确算法分别进行比较,通过算例验证了模型与算法的有效性.

References

[1]  KUAH G K,PERL J.Optimization of feeder bus routes and bus stop spacing[J].Jouranl of Transportation Engineering,1988,114(3):341-354.
[2]  CHIEN S,YANG Z.Optimal feeder bus routes on irregular street networks[J].Journal of Advanced Transportation,2000,34(2):213-248.
[3]  KUAH G K,PERL J.The feeder-bus network-design problem[J].Journal of the Operational Research Society,1989,40(8):751-767.
[4]  VERMA A,DHINGRA S L.Feeder bus routes generation within integrated mass transit planning framework[J].Jouranl of Transportation Engineering,2005,131(11):822-834.
[5]  KUAN S N,ONG H L,NG K M.Solving the feeder bus network design problem by genetic algorithms and ant colony optimization[J].Advances in Engineering Software,2006,37(6):351-359.
[6]  SHRIVASTAVA P,O’MAHONY M.Use of a hybrid algorithm for modeling coordinated feeder bus route network at suburban railway stations[J].Journal of Transportation Engineering,2009,135(1):1-8.
[7]  SHRIVASTAVA P,O’MAHONY M.A model for development of optimized feeder routes and coordinated schedules—a genetic algorithms approach[J].Transport Policy,2006,13(5):413-425.
[8]  孙杨,宋瑞,何世伟.弹性需求下的接运公交网络设计[J].吉林大学学报:工学版,2011,41(2):349-354.SUN Yang,SONG Rui,HE Shi-wei.Feeder bus network design under elastic demand[J].Journal of Jilin University:Engineering and Technology Edition,2011,41(2):349-354.(in Chinese)
[9]  FAN W.Optimal transit route network design problem:algorithms,implementations,and numerical results[D].Austin:Department of Civil Engineering,The University of Texas at Austin,2004.
[10]  CEDER A,STERN H I.Deficit function bus scheduling with deadheading trip insertions for fleet size reduction[J].Transportation Science,1981,15(4):338-363.
[11]  GEN M,CHENG R W.Genetic algorithms and engineering optimization[M].New York:Wiley Interscience,2000:39-40.
[12]  CHE Z H,CHIANG C J.A modified pareto genetic algorithm for multi-objective build-to-order supply chain planning with product assembly[J].Advances in Engineering Software,2010,41(7/8):1011-1022.
[13]  ADIBI M A,ZANDIEH M,AMIRI M.Multi-objective scheduling of dynamic job shop using variable neighborhood search[J].Expert Systems with Applications,2010,31(7):282-287.
[14]  MURATA T,ISHIBUCHI H,TANAKA H.Multiobjective genetic algorithm and its applications to flowshop scheduling[J].Computers and Industrial Engineering,1996,30(4):957-968.
[15]  ISHIBUCHI H,MURATA T.A multi-objective genetic local search algorithm and its application to flowshop scheduling[J].IEEE Transactions on Systems Man and Cybernetics,1998,28(3):392-403.
[16]  李凯.考虑节能降耗的关键机器调度问题研究[D].合肥:合肥工业大学管理学院,2009.LI Kai.Research on key-machine scheduling problems with consideration of engery conservation[D].Hefei:The School of Management of Hefei University of Technology,2009.(in Chinese)
[17]  FAN W,MACHEMEHL R B.Optimal transit route network design problem with variable transit demand:genetic algorithm approach[J].Journal of Transportation Engineering,2006,132(1):40-51.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133