Kiliç, FatihGök, Mustafa2025-01-062025-01-062013978-390282351-91474-667010.3182/20130916-2-tr-4042.000332-s2.0-84896282558https://doi.org/10.3182/20130916-2-tr-4042.00033https://hdl.handle.net/20.500.14669/1297et 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 Vehicles1st IFAC Workshop on Advances in Control and Automation Theory for Transportation Applications, ACATTA 2013 -- 16 September 2013 through 17 September 2013 -- Istanbul -- 103232Route 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.eninfo:eu-repo/semantics/openAccessTraffic controlTravel timeComplex combinatorial problemCost savingInitialization proceduresPublic transit networksRoad networkRoute generationTest runsUrban transportationConference Object166PART 1N/A1621