Technical Papers
Dec 21, 2019

Optimal Design of Feeder-Bus Network with Split Delivery

Publication: Journal of Transportation Engineering, Part A: Systems
Volume 146, Issue 3

Abstract

Feeder-bus networks between urban rail transit systems and bus stops are inefficient in terms of the cost incurred by passengers, the time taken to reach the destination, and the number and frequency of feeder buses. To solve these issues, a new split delivery model using genetic algorithm (GA) for the feeder-bus network design problem (FBNDP), which is based on the transfer network, is proposed. To accomplish this, the general many-to-one assumption between bus stops and routes is discarded and replaced by the many-to-many assumption, wherein multiple bus stops are served by multiple routes, while considering a new split delivery method. This model is called the feeder-bus network design problem with split delivery (FBNDP-SD). The use of GA and the many-to-many assumption through repeat bus stops resulted in the effective distribution of passenger demand among different routes, reducing the passengers’ generalized travel expenses and optimizing the network structure. While the construction of the FBNDP-SD solution, as well as the interconversion of the FBNDP solution and FBNDP-SD solution, is realized, this paper provides a new research direction of FBNDP.

Get full access to this article

View all available purchase options and get full access to this article.

Data Availability Statement

Some or all data, models, or code generated or used during the study are available from the corresponding author by request, including the coordinate data of nodes in the case studies.

Acknowledgments

This paper is supported by the National Natural Science Foundation of China (No. 71471179).

Disclaimer

Any statements expressed in these materials are those of the individual authors and do not necessarily represent the views of ASCE, which takes no responsibility for any statement made herein. No reference made in this publication to any specific method, product, process, or service constitutes or implies an endorsement, recommendation, or warranty thereof by ASCE. The materials are for general information only and do not represent a standard of ASCE, nor are they intended as a reference in purchase specifications, contracts, regulations, statutes, or any other legal document. ASCE makes no representation or warranty of any kind, whether expressed or implied, concerning the accuracy, completeness, suitability, or utility of any information, apparatus, product, or process discussed in this publication, and assumes no liability therefor. This information should not be used without first securing competent advice with respect to its suitability for any general or specific application. Anyone utilizing this information assumes all liability arising from such use, including but not limited to infringement of any patent or patents.

References

Charisis, A., C. Iliopoulou, and K. Kepaptsoglou. 2018. “DRT route design for the first/last mile problem: Model and application to Athens, Greece.” Public Transp. 10 (3): 499–527. https://doi.org/10.1007/s12469-018-0188-0.
Chen, S., B. Golden, and E. Wasil. 2007. “The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results.” Networks 49 (4): 318–329. https://doi.org/10.1002/net.20181.
Chien, S., and P. Schonfeld. 2010. “Joint optimization of a rail transit line and its feeder bus system.” J. Adv. Transp. 32 (3): 253–284. https://doi.org/10.1002/atr.5670320302.
Chien, S., and Z. Yang. 2000. “Optimal feeder bus routes on irregular street networks.” J. Adv. Transp. 34 (2): 213–248. https://doi.org/10.1002/atr.5670340204.
Ciaffi, F., E. Cipriani, and M. Petrelli. 2012. “Feeder bus network design problem: A new metaheuristic procedure and real size applications.” Procedia Social Behav. Sci. 54 (2290): 798–807. https://doi.org/10.1016/j.sbspro.2012.09.796.
Deng, L., W. Gao, Y. Fu, and W. Zhou. 2013. “Optimal design of the feeder-bus network based on the transfer system.” Discrete Dyn. Nat. Soc. 2013: 1–10. https://doi.org/10.1155/2013/483682.
Deng, L., W. Gao, T. Lai, and Q. Zeng. 2012. “Optimal design of feeder-bus network related to urban rail transit based on transfer network.” J. Railway Sci. Eng. 9 (6): 77–83. https://doi.org/10.3969/j.issn.1672-7029.2012.06.014.
Hurdle, V. F. 1973. “Minimum cost locations for parallel public transit lines.” Transp. Sci. 7 (4): 340–350. https://doi.org/10.1287/trsc.7.4.340.
Jin, M., K. Liu, and B. Eksioglu. 2008. “A column generation approach for the split delivery vehicle routing problem.” Oper. Res. Lett. 36 (2): 265–270. https://doi.org/10.1016/j.orl.2007.05.012.
John, H. T., and Y. Sun. 2019. “Optimizing bus stop locations for walking access: Stops-first design of a feeder route to enhance a residential plan.” Environ. Plann. B: Urban Anal. City Sci. 1–23. https://doi.org/10.1177/2399808318824108.
Khmelev, A., and Y. Kochetov. 2015. “A hybrid VND method for the split delivery vehicle routing problem.” Electron. Notes Discrete Math. 47 (Feb): 5–12. https://doi.org/10.1016/j.endm.2014.11.002.
Kuah, G. K., and J. Perl. 1988. “Optimization of feeder bus routes and bus stop spacing.” J. Transp. Eng. 114 (3): 341–354. https://doi.org/10.1061/(ASCE)0733-947X(1988)114:3(341).
Kuah, G. K., and J. Perl. 2017. “The feeder-bus network-design problem.” J. Oper. Res. Soc. 40 (8): 751–767. https://doi.org/10.1057/jors.1989.127.
Kuan, S. N., H. L. Ong, and K. M. Ng. 2004. “Applying metaheuristics to feeder bus network design problem.” Asia-Pac. J. Oper. Res. 21(4): 543–560. https://doi.org/10.1142/S0217595904000382.
Kuan, S. N., H. L. Ong, and K. M. Ng. 2006. “Solving the feeder bus network design problem by genetic algorithms and ant colony optimization.” Adv. Eng. Software 37 (6): 351–359. https://doi.org/10.1016/j.advengsoft.2005.10.003.
Lenstra, J. K., and A. H. G. R. Kan. 1981. “Complexity of vehicle routing and scheduling problems.” Networks 11 (2): 221–227. https://doi.org/10.1002/net.3230110211.
Li, X., M. Wei, J. Hu, Y. Yuan, and H. Jiang. 2018. “An agent-based model for dispatching real-time demand-responsive feeder bus.” Math. Prob. Eng. 2018 (1): 1–11. https://doi.org/10.1155/2018/6925764.
Lin, J., and H. Wong. 2014. “Optimization of a feeder-bus route design by using a multiobjective programming approach.” Transp. Plann. Technol. 37 (5): 430–449. https://doi.org/10.1080/03081060.2014.912418.
Matins, C. L., and M. V. Pato. 1998. “Search strategies for the feeder bus network design problem.” Eur. J. Oper. Res. 106 (2–3): 425–440. https://doi.org/10.1016/S0377-2217(97)00283-X.
May, A. D. 1991. “Integrated transport strategies: A new approach to urban transport policy formulation in the UK.” Transp. Rev. 11 (3): 223–247. https://doi.org/10.1080/01441649108716786.
Mohaymany, A. S., and A. Gholami. 2010. “Multimodal feeder network design problem: Ant colony optimization approach.” J. Transp. Eng. 135 (4): 323–331. https://doi.org/10.1061/(ASCE)TE.1943-5436.0000110.
Shrivastav, P., and S. L. Dhingra. 2001. “Development of feeder routes for suburban railway station using heuristic approach.” J. Transp. Eng. 127 (4): 334–341. https://doi.org/10.1061/(ASCE)0733-947X(2001)127:4(334).
Shrivastava, P., and M. O’Mahony. 2006. “A model for development of optimized feeder routes and coordinated schedules—A genetic algorithms approach.” Transp. Policy 13 (5): 413–425. https://doi.org/10.1016/j.tranpol.2006.03.002.
Shrivastava, P., and M. O’Mahony. 2007. “Design of feeder route network using combined genetic algorithm and specialized repair heuristic.” J. Public Transp. 10 (2): 109–133. https://doi.org/10.5038/2375-0901.10.2.7.
Soto, M., M. Sevaux, A. Rossi, and A. Reinholz. 2017. “Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem.” Comput. Ind. Eng. 107 (May): 211–222. https://doi.org/10.1016/j.cie.2017.03.022.
Sun, B., M. Wei, C. Yang, Z. Xu, and H. Wang. 2018. “Personalised and coordinated demand-responsive feeder transit service design: A genetic algorithms approach.” Future Internet 10 (7): 61. https://doi.org/10.3390/fi10070061.
Tabassum, S., S. Tanaka, F. Nakamura, and A. Ryo. 2017. “Feeder network design for mass transit system in developing countries (case study of Lahore, Pakistan).” Transp. Res. Procedia 25: 3133–3146. https://doi.org/10.1016/j.trpro.2017.05.343.
Xiong, J., W. Guan, L. Song, A. Huang, and C. Shao. 2013. “Optimal routing design of a community shuttle for metro stations.” J. Transp. Eng. 139 (12): 1211–1223. https://doi.org/10.1061/(ASCE)TE.1943-5436.0000608.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering, Part A: Systems
Journal of Transportation Engineering, Part A: Systems
Volume 146Issue 3March 2020

History

Received: Jan 8, 2019
Accepted: Jul 8, 2019
Published online: Dec 21, 2019
Published in print: Mar 1, 2020
Discussion open until: May 21, 2020

Permissions

Request permissions for this article.

Authors

Affiliations

Lian-bo Deng [email protected]
Professor, School of Traffic and Transportation Engineering, Central South Univ., Changsha 410075, China. Email: [email protected]
Master Student, School of Traffic and Transportation Engineering, Central South Univ., Changsha 410075, China (corresponding author). Email: [email protected]
Ning-xin Zeng [email protected]
Master Student, School of Traffic and Transportation Engineering, Central South Univ., Changsha 410075, China. Email: [email protected]
Master Student, School of Traffic and Transportation Engineering, Central South Univ., Changsha 410075, China. ORCID: https://orcid.org/0000-0001-8084-346X. Email: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share