Please use this identifier to cite or link to this item:
https://doi.org/10.1080/0305215X.2013.812728
Title: | A bi-objective optimization approach for exclusive bus lane selection and scheduling design | Authors: | Khoo, H.L. Teoh, L.E. Meng, Q. |
Keywords: | bi-objective optimization exclusive bus lane non-dominated sorting genetic algorithm Pareto solution |
Issue Date: | 3-Jul-2014 | Citation: | Khoo, H.L., Teoh, L.E., Meng, Q. (2014-07-03). A bi-objective optimization approach for exclusive bus lane selection and scheduling design. Engineering Optimization 46 (7) : 987-1007. ScholarBank@NUS Repository. https://doi.org/10.1080/0305215X.2013.812728 | Abstract: | This study proposes a methodology to solve the integrated problems of selection and scheduling of the exclusive bus lane. The selection problem intends to determine which roads (links) should have a lane reserved for buses while the scheduling problem intends to find the time period of the application. It is formulated as a bi-objective optimization model that aims to minimize the total travel time of non-bus traffic and buses simultaneously. The proposed model formulation is solved by the hybrid non-dominated sorting genetic algorithm with Paramics. The results show that the proposed methodology is workable. Sets of Pareto solutions are obtained indicating that a trade-off between buses and non-bus traffic for the improvement of the bus transit system is necessary when the exclusive bus lane is applied. This allows the engineer to choose the best solutions that could balance the performance of both modes in a multimode transport system environment to achieve a sustainable transport system. © 2013 Taylor & Francis. | Source Title: | Engineering Optimization | URI: | http://scholarbank.nus.edu.sg/handle/10635/90890 | ISSN: | 10290273 | DOI: | 10.1080/0305215X.2013.812728 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.