Please use this identifier to cite or link to this item: http://ir.futminna.edu.ng:8080/jspui/handle/123456789/12149
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSaidu, A. S.-
dc.contributor.authorKolo, Stephen Sunday-
dc.contributor.authorJimoh, O.D-
dc.date.accessioned2021-07-31T07:50:58Z-
dc.date.available2021-07-31T07:50:58Z-
dc.date.issued2020-
dc.identifier.urihttp://repository.futminna.edu.ng:8080/jspui/handle/123456789/12149-
dc.description.abstractThe public-transport (transit) operation planning process commonly includes four basic activities, usually performed in sequence: network design, timetable development, vehicle scheduling, and crew scheduling. This work addresses two activities: timetable development and vehicle-scheduling with different vehicles types. Alternative timetables are constructed with either even headways, but not necessarily even passenger loads or even average passenger loads, but not even headways. A method to construct timetables with the combination of both even-headway and even-load concepts is developed for multi-vehicle sizes. The vehicle-scheduling problem is based on given sets of trips and vehicle types arranged in decreasing order of vehicle cost. This problem can be formulated as a cost-flow network problem with an NP-hard complexity level. Thus, a heuristic algorithm is developed. A few examples are used as an expository device to illustrate the procedures developed.en_US
dc.language.isoen_USen_US
dc.publisherDepartment of Civil Engineering, FUTMinnaen_US
dc.relation.ispartofseries2nd International Civil Engineering Conference;4-
dc.subjectEven headwaysen_US
dc.subjectEven Loadsen_US
dc.subjectMulti-Vehicle typeen_US
dc.subjectPublic-transiten_US
dc.titleOptimal Multi-Vehicle Transit Timetabling and Vehicle Scheduling: A Reviewen_US
dc.typeArticleen_US
Appears in Collections:Civil Engineering

Files in This Item:
File Description SizeFormat 
saidu Abu Sadiq_ICEC 2020_Paper-4.pdf446.3 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.