A public transit network route generation algorithm
| dc.contributor.author | Kiliç, Fatih | |
| dc.contributor.author | Gök, Mustafa | |
| dc.date.accessioned | 2025-01-06T17:29:42Z | |
| dc.date.available | 2025-01-06T17:29:42Z | |
| dc.date.issued | 2013 | |
| dc.description | 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 | |
| dc.description | 1st IFAC Workshop on Advances in Control and Automation Theory for Transportation Applications, ACATTA 2013 -- 16 September 2013 through 17 September 2013 -- Istanbul -- 103232 | |
| dc.description.abstract | 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. | |
| dc.identifier.doi | 10.3182/20130916-2-tr-4042.00033 | |
| dc.identifier.endpage | 166 | |
| dc.identifier.isbn | 978-390282351-9 | |
| dc.identifier.issn | 1474-6670 | |
| dc.identifier.issue | PART 1 | |
| dc.identifier.scopus | 2-s2.0-84896282558 | |
| dc.identifier.scopusquality | N/A | |
| dc.identifier.startpage | 162 | |
| dc.identifier.uri | https://doi.org/10.3182/20130916-2-tr-4042.00033 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14669/1297 | |
| dc.identifier.volume | 1 | |
| dc.indekslendigikaynak | Scopus | |
| dc.language.iso | en | |
| dc.publisher | IFAC Secretariat | |
| dc.relation.ispartof | IFAC Proceedings Volumes (IFAC-PapersOnline) | |
| dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.snmz | KA_20241211 | |
| dc.subject | Traffic control | |
| dc.subject | Travel time | |
| dc.subject | Complex combinatorial problem | |
| dc.subject | Cost saving | |
| dc.subject | Initialization procedures | |
| dc.subject | Public transit networks | |
| dc.subject | Road network | |
| dc.subject | Route generation | |
| dc.subject | Test runs | |
| dc.subject | Urban transportation | |
| dc.title | A public transit network route generation algorithm | |
| dc.type | Conference Object |
