Technical Papers
Jun 4, 2024

Enhancing Bicycle Trajectory Planning in Urban Environments through Complex Network Optimization

Publication: Journal of Urban Planning and Development
Volume 150, Issue 3

Abstract

This paper introduces a novel methodology for devising bike trajectory plans. In this approach, the entire trip is associated with a complex network or graph, where the nodes and edges correspond to potential trajectory segments. Utilizing the information collected from a bike-sharing system, the cost attributed to each segment is determined using the multinomial logistic regression (MLR) technique by analyzing its usage frequency and other user preferences. Consequently, segments with high usage and strong preferences entail lower costs, whereas those with limited use and weaker predilection assume higher costs. After assigning costs to all segments within the network, the subsequent step involves generating the trajectory with the lowest accumulated cost. Unlike other approaches, our method considers realistic conditions and user preferences without inconsistencies imposed by the techniques based on surveys. To validate the performance of the proposed method, a set of extensive experiments and case studies were conducted considering the urban model from downtown Guadalajara, Mexico. As a result, this approach improves the efficiency of the bike trajectory planning system by providing shorter and safer routes for both cyclists and motor vehicle drivers.

Practical Applications

The proposed bicycle trajectory planning methodology, grounded in multinomial logistic regression, unfolds various practical applications. Beyond conventional distance-centric models, our approach, driven by user-generated data from bike-sharing systems, crafts tailored routes prioritizing safety and convenience. This breakthrough optimizes trajectories and strategically targets new cyclist adoption, fostering sustainable biking cultures. Successfully validated in the urban model of Guadalajara, Mexico, our methodology equips urban planners and policymakers with a powerful tool for designing trajectories that are not only shorter but also safer. The versatility of our method extends its applicability to diverse data sets, positioning it as a forward-thinking solution in the realm of efficient and sustainable urban transportation. Practitioners can harness its potential to reshape micromobility systems, aligning them with the evolving needs of urban mobility. It is a comprehensive framework for crafting user-centric, secure, and efficient biking experiences. Cities aspiring to enhance their micromobility infrastructure could find a blueprint for urban planners in our methodology, facilitating the creation of accessible, safe, and enjoyable biking environments. In summary, our method catalyzes a transformative shift in micromobility, prompting cities to prioritize the development of not just functional but delightful biking experiences, ultimately contributing to healthier, more sustainable urban living.

Get full access to this article

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

Data Availability Statement

Data used in this research are open access and are available from the corresponding author upon reasonable request.

Acknowledgments

The authors thank their colleagues and students from Guadalajara University, who provided valuable feedback and interesting discussions that greatly enriched the development of the proposed method. The authors are particularly grateful for their suggestions and insights, which helped them to refine their approach and interpret their results more accurately.

References

AMIM (Agencia Metropolitana de Servicios de Infraestructura para la Movilidad del Área Metropolitana de Guadalajara). 2020. “Cómo se mueven los ciclistas en el AMG 2020.” Guadalajara. Accessed March 29, 2022. https://amim.mx/pdf/AFORO_GTAC.pdf.
Bannister, M. J., and D. Eppstein. 2012. “Randomized speedup of the Bellman–Ford algorithm.” In Proc., 9th Workshop on Analytic Algorithmicsand Combinatorics, 41–47. Philadelphia, PA: Society for Industrial and Applied Mathematics.
Beamer, S., K. Asanovic, and D. Patterson. 2012. “Direction-optimizing breadth-first search.” In Proc., Int. Conf. on High Performance Computing, Networking, Storage and Analysis, 1–10. London, UK: IEEE.
Bearn, C., C. Mingus, and K. Watkins. 2018. “An adaption of the level of traffic stress based on evidence from the literature and widely available data.” Res. Transp. Bus. Manage. 29: 50–62. https://doi.org/10.1016/j.rtbm.2018.12.002.
Bellman, R. 1958. “On a routing problem.” Q. Appl. Math. 16 (1): 87–90. https://doi.org/10.1090/qam/102435.
Bozzi, A. D., and A. Aguilera. 2021. “Shared e-scooters: A review of uses, health and environmental impacts, and policy implications of a new micro-mobility service.” Sustainability 13: 8676. https://doi.org/10.3390/su13168676.
Busato, F., and N. Bombieri. 2016. “An efficient implementation of the Bellman–Ford algorithm for Kepler GPU architectures.” IEEE Trans. Parallel Distrib. Syst. 27 (8): 2222–2233. https://doi.org/10.1109/TPDS.2015.2485994.
Cabral, L., and A. M. Kim. 2022. “An empirical reappraisal of the level of traffic stress framework for segments.” Travel Behav. Soc. 26: 143–158. https://doi.org/10.1016/j.tbs.2021.09.007.
Cormen, T. H., C. E. Leiserson, R. L. Rivest, and C. Stein. 2009. Introduction to algorithms. 3rd ed. Cambridge, MA: MIT Press.
Daraei, S., K. Pelechrinis, and D. Quercia. 2021. “A data-driven approach for assessing biking safety in cities.” EPJ Data Sci. 10 (1): 11. https://doi.org/10.1140/epjds/s13688-021-00265-y.
Desaulniers, G., and F. Soumis. 1995. “An efficient algorithm to find a shortest path for a car-like robot.” IEEE Trans. Rob. Autom. 11 (6): 819–828. https://doi.org/10.1109/70.478429.
Dijkstra, E. W. 1959. “A note on two problems in connexion with graphs.” Numer. Math. 1 (1): 269–271. https://doi.org/10.1007/BF01386390.
Freund, D., A. Norouzi-Fard, A. Paul, C. Wang, S. G. Henderson, and D. B. Shmoys. 2020. “Data-driven rebalancing methods for bike-share systems.” In Analytics for the sharing economy: Mathematics, engineering and business perspectives, edited by E. Crisostomi, B. Ghaddar, F. Häusler, J. Naoum-Sawaya, G. Russo, and R. Shorten, 255–278. Cham, Switzerland: Springer.
Gao, C., and Y. Chen. 2022. “Using machine learning methods to predict demand for bike sharing.” In Proc., ENTER Information and Communication Technologies in Tourism 2022 eTourism Conf., edited by J. L. Stienmetz, B. Ferrer-Rosell, and D. Massimo. 282–296. Cham, Switzerland: Springer.
Gobierno del Estado de Jalisco. 2017. “Plan Maestro de Movilidad Urbana No Motorizada del Área Metroplitana de Guadalajara Manual de Lineamientos Y Estándares Para Vías Peatonales Y Ciclovías.” Accessed March 23, 2023. http://www.iepcjalisco.org.mx/participacion-ciudadana/wp-content/uploads/2017/06/lineamientos-_ciclovias.pdf.
Guidon, S., D. J. Reck, and K. Axhausen. 2020. “Expanding a(n) (electric) bicycle-sharing system to a new city: Prediction of demand with spatial regression and random forests.” J. Transp. Geogr. 84: 102692. https://doi.org/10.1016/j.jtrangeo.2020.102692.
Hart, P., N. Nilsson, and B. Raphael. 1968. “A formal basis for the heuristic determination of minimum cost paths.” IEEE Trans. Syst. Sci. Cybern. 4 (2): 100–107. https://doi.org/10.1109/TSSC.1968.300136.
Hosmer, D. W., and S. Lemeshow. 1989. Applied logistic regression. New York: Wiley.
Hougardy, S. 2010. “The Floyd–Warshall algorithm on graphs with negative cycles.” Inf. Process. Lett. 110 (8–9): 279–281. https://doi.org/10.1016/j.ipl.2010.02.001.
Huertas, J. A., A. Palacio, M. Botero, G. A. Carvajal, T. van Laake, D. Higuera-Mendieta, S. A. Cabrales, L. A. Guzman, O. L. Sarmiento, and A. L. Medaglia. 2020. “Level of traffic stress-based classification: A clustering approach for Bogotá, Colombia.” Transp. Res. Part D Transp. Environ. 85: 102420. https://doi.org/10.1016/j.trd.2020.102420.
Hunt, J. D., and J. E. Abraham. 2007. “Influences on bicycle use.” Transportation 34: 453–470. https://doi.org/10.1007/s11116-006-9109-1.
Javaid, A. 2013. “Understanding Dijkstra's algorithm.” SSRN Electron. J. 1–27.
Jing, Z., G. Wang, S. Zhang, and C. Qiu. 2017. “Building Tianjin driving cycle based on linear discriminant analysis.” Transp. Res. Part D Transp. Environ. 53: 78–87. https://doi.org/10.1016/j.trd.2017.04.005.
Lanning, D. R., G. K. Harrell, and J. Wang. 2014. “Dijkstra’s algorithm and Google maps.” In Proc., of the 2014 ACM Southeast Regional Conf, 1–3. New York: Association for Computing Machinery.
Li, C., S. Yang, T. T. Nguyen, E. L. Yu, X. Yao, Y. Jin, H. G. Beyer, and P. N. Suganthan. 2008. Benchmark generator for CEC 2009 competition on dynamic optimization. Technical Rep. Leicester, UK: University of Leicester.
McFadden, D. L., et al. 2005. “Statistical analysis of choice experiments and surveys.” Mark. Lett. 16: 183–196. https://doi.org/10.1007/s11002-005-5884-2.
MIBICI. 2023a. “MIBICI | Datos abiertos.” MiBici. Accessed January 15, 2023. https://mibici.net/en/open-data/.
MIBICI. 2023b. “MIBICI | Mapa.” MiBici. Accessed January 15, 2023. https://www.mibici.net/en/map/.
Mirino, A. E. 2017. “Best routes selection using Dijkstra and Floyd–Warshall algorithm.” In Proc., 11th Int. Conf. on Information & Communication Technology and System, 155–158. London, UK: IEEE.
Moy, J. 1994. Open shortest path first version 2. RFQ 1583. Westborough, MA: Internet Engineering Task Force.
Oh, S. C., and A. J. Hildreth. 2016. Analytics for smart energy management. Cham, Switzerland: Springer International.
Pallottino, S., and M. G. Scutella. 1998. “Shortest path Algorithms in transportation models: Classical and innovative aspects.” In Equilibrium and Advanced Transportation Modelling, edited by P. Marcotte and S. Nguyen. Boston, MA: Springer.
Pérez-Castrillo, D., M. Sotomayor, and F. Castiglione. 2020. “Complex social and behavioral systems: Game theory and agent-based models.” In Encyclopedia of Complexity and Systems Science Series. New York: Springer.
Qi, X., Y. Gao, Y. Li, and M. Li. 2022, January. “K-nearest neighbors regressor for traffic prediction of rental bikes.” In Proc., 14th Int. Conf. on Computer Research and Development, 152–156. London, UK:
Saif, M. A., M. M. Zefreh, and A. Torok. 2018. “Public transport accessibility: A literature review.” Period. Polytech. Transp. Eng. 47 (1): 36–43. https://doi.org/10.3311/PPtr.12072.
Shaojie, Q., H. Nan, and H. Jianbin. 2021. “A dynamic convolutional neural network based shared-bike demand forecasting model.” ACM Trans. Intell. Syst. Technol. 12 (6): 1–24.
Sener, I. N., N. Eluru, and C. R. Bhat. 2009. “An analysis of bicycle route choice preferences in Texas, US.” Transportation 36: 511–539. https://doi.org/10.1007/s11116-009-9201-4.
Snizek, B., T. A. Nielsen, and H. Skov-Petersen. 2013. “Mapping bicyclists’ experiences in Copenhagen.” J. Transp. Geogr. 30: 227–233. https://doi.org/10.1016/j.jtrangeo.2013.02.001.
Stinson, M. A., and C. R. Bhat. 2003. “Commuter bicyclist route choice: Analysis using a stated preference survey.” Transp. Res. Rec. 1828 (1): 107–115. https://doi.org/10.3141/1828-13.
Tilahun, N. Y., D. M. Levinson, and K. J. Krizek. 2007. “Trails, lanes, or traffic: Valuing bicycle facilities with an adaptive stated preference survey.” Transp. Res. Part A Policy Pract. 41 (4): 287–301. https://doi.org/10.1016/j.tra.2006.09.007.
Unbehauen, J., S. Hellmann, S. Auer, and C. Stadler. 2012. “Knowledge extraction from structured sources.” In Vol. 7538 of Search computing: Broadening web search, edited by S. Ceri and M. Brambilla, 34–52. Berlin, Germany: Springer.
Wang, H., M. Palm, C. Chen, R. Vogt, and Y. Wang. 2016. “Does bicycle network level of traffic stress (LTS) explain bicycle travel behavior? Mixed results from an Oregon case study.” J. Transp. Geogr. 57: 8–18. https://doi.org/10.1016/j.jtrangeo.2016.08.016.
Yang, Z., J. Chen, J. Hu, Y. Shu, and P. Cheng. 2019. “Mobility modeling and data-driven closed-loop prediction in bike-sharing systems.” IEEE Trans. Intell. Transp. Syst. 20 (12): 4488–4499. https://doi.org/10.1109/TITS.2018.2886456.
Zhan, F. B., and C. E. Noon. 1998. “Shortest path algorithms: An evaluation using real road networks.” Transp. Sci. 32 (1): 65–73. https://doi.org/10.1287/trsc.32.1.65.
Zimmermann, M., T. Mai, and E. Frejinger. 2017. “Bike route choice modeling using GPS data without choice sets of paths.” Transp. Res. Part C Emerging Technol. 75: 183–196. https://doi.org/10.1016/j.trc.2016.12.009.

Information & Authors

Information

Published In

Go to Journal of Urban Planning and Development
Journal of Urban Planning and Development
Volume 150Issue 3September 2024

History

Received: Jun 20, 2023
Accepted: Mar 18, 2024
Published online: Jun 4, 2024
Published in print: Sep 1, 2024
Discussion open until: Nov 4, 2024

Permissions

Request permissions for this article.

Authors

Affiliations

Dept. de Ciencias Computacionales, Univ. de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara, Jal, C.P. 44430, México (corresponding author). ORCID: https://orcid.org/0000-0003-0123-1655. Email: [email protected]
Erik Cuevas [email protected]
Dept. de Ingeniería Electro-Fotónica, Univ. de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara, Jal, C.P. 44430, México. Email: [email protected]
Karla Avila [email protected]
Dept. de Innovación Basada en la Información y el Conocimiento, Univ. de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara, Jal, C.P. 44430, México. Email: [email protected]
Marco Perez-Cisneros [email protected]
Dept. de Ingeniería Electro-Fotónica, Univ. de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara, Jal, C.P. 44430, México. 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.

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