Please use this identifier to cite or link to this item: https://scholarhub.balamand.edu.lb/handle/uob/7036
DC FieldValueLanguage
dc.contributor.advisorGerges, Najib N.en_US
dc.contributor.authorAintrazi, Sarahen_US
dc.date.accessioned2023-09-21T11:08:35Z-
dc.date.available2023-09-21T11:08:35Z-
dc.date.issued2023-
dc.identifier.urihttps://scholarhub.balamand.edu.lb/handle/uob/7036-
dc.descriptionIncludes bibliographical references (p. 64-68)en_US
dc.description.abstractGiven the shortfall of reliable public transport systems in Lebanon, the high mobility expenses, the burden of traffic congestion and the adverse socio-environmental costs associated with it, the implementation of sustainable transportation networks is crucial. While Lebanon is known to have very high rates of car ownership, workers and students are currently seeking affordable public transport solutions. This paper proposes and investigates the optimization of the bus network for the University of Balamand, to provide convenient and affordable transportation for students and staff. The main aim is to maximize service coverage and minimize mobility costs, while considering traffic data. A mathematical model that solves this problem as a Multiple Traveling Salesman Problem (MTSP) by using the Genetic Algorithm (GA) is proposed, where further constraints such as minimum and maximum number of cities to be visited are explored. This optimization problem is also modeled and analyzed using Network Analyst in ArcGIS Pro. By leveraging traffic data in network analysis, data-driven decisions can be taken, leading to more reliable, cost-effective, and user-centric network infrastructures. ArcGIS Network Analyst is used in two scenarios in the investigation. In Scenario 1, three buses are used to minimize resources and promote operational efficiency, whereas four buses are used in Scenario 2 to follow the established routes. The optimized routes outperformed the established ones in terms of efficiency. For customized mobility planning, it is advised to take into account student locations and real-time traffic data. Buses should operate on a set timetable to improve efficiency and service. The limitations of the mathematical model include presuming a single depot and excluding the actual road network. Future study should concentrate on creating a bus timetable and real-time or historical traffic data should be added to overcome these restrictions. Reliability, effectiveness, and commuter experience would all improve as a result.en_US
dc.description.statementofresponsibilityby Sarah Aintrazien_US
dc.format.extent1 online resource (x, 71 pages) : ill., tablesen_US
dc.language.isoengen_US
dc.rightsThis object is protected by copyright, and is made available here for research and educational purposes. Permission to reuse, publish, or reproduce the object beyond the personal and educational use exceptions must be obtained from the copyright holderen_US
dc.subjecttransportation, bus network, route optimization, genetic algorithm, shortest distance, Network Analyst, ArcGIS Proen_US
dc.subject.lcshTransportation--Planningen_US
dc.subject.lcshTransportation--Lebanon--Case studiesen_US
dc.subject.lcshTransportation--Public transportationen_US
dc.subject.lcshTransportation--Mathematical modelsen_US
dc.subject.lcshUniversity of Balamanden_US
dc.subject.lcshUniversity of Balamand--Dissertationsen_US
dc.subject.lcshDissertations, Academicen_US
dc.titleOptimization of bus routes : case study of the University of Balamanden_US
dc.typeThesisen_US
dc.contributor.corporateUniversity of Balamanden_US
dc.contributor.departmentDepartment of Civil Engineeringen_US
dc.contributor.facultyFaculty of Engineeringen_US
dc.contributor.institutionUniversity of Balamanden_US
dc.date.catalogued2023-09-21-
dc.description.degreeMS in Civil Engineeringen_US
dc.description.statusUnpublisheden_US
dc.identifier.OlibID316265-
dc.rights.accessrightsThis item is under embargo until end of year 2025.en_US
dc.provenance.recordsourceOliben_US
Appears in Collections:UOB Theses and Projects
Show simple item record

Record view(s)

70
checked on Nov 21, 2024

Google ScholarTM

Check


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