A public transit network route generation algorithm
[ X ]
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IFAC Secretariat
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Route generation task in a public transit network is a complex combinatorial problem which cannot be manually solved. This paper presents a computer algorithm for the solution of this problem. The presented algorithm has a novel initialization procedure. The algorithm is implemented and tested on Mandl's Swiss Road network [Mandl, 1979]. Extensive test runs of the proposed algorithm on this network show that the proposed algorithm has better average travel times in all cases except one and offers up to 23% cost savings compared to the most recent work [Fan and Mumford, 2010]. © IFAC.
Açıklama
et al.; Net Muhendislik; Technical Committee of IFAC 7.1: Automotive Control; Technical Committee of IFAC 7.2: Marine Systems; Technical Committee of IFAC 7.3: Aerospace; Technical Committee of IFAC 7.5: Intelligent Autonomous Vehicles
1st IFAC Workshop on Advances in Control and Automation Theory for Transportation Applications, ACATTA 2013 -- 16 September 2013 through 17 September 2013 -- Istanbul -- 103232
1st IFAC Workshop on Advances in Control and Automation Theory for Transportation Applications, ACATTA 2013 -- 16 September 2013 through 17 September 2013 -- Istanbul -- 103232
Anahtar Kelimeler
Traffic control, Travel time, Complex combinatorial problem, Cost saving, Initialization procedures, Public transit networks, Road network, Route generation, Test runs, Urban transportation
Kaynak
IFAC Proceedings Volumes (IFAC-PapersOnline)
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
1
Sayı
PART 1
