{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T23:33:45Z","timestamp":1774481625844,"version":"3.50.1"},"reference-count":29,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T00:00:00Z","timestamp":1653177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2021YFB3900900"],"award-info":[{"award-number":["2021YFB3900900"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>Adding new lines on the basis of the existing public transport network is an important way to improve public transport operation networks and the quality of urban public transport service. Aiming at the problem that existing routes are rarely considered in the previous research on public transportation network planning, a public transportation network optimization method based on an ant colony optimization (ACO) algorithm coupled with the existing routes is proposed. First, the actual road network and existing bus lines were abstracted with a graph data structure, and the integration with origin\u2013destination passenger flow data was completed. Second, according to the ACO algorithm, combined with the existing line structure constraints and ant transfer rules at adjacent nodes, new bus-line planning was realized. Finally, according to the change of direct passenger flow in the entire network, the optimal bus-line network optimization scheme was determined. In the process of node transfer calculation, the algorithm adopts the Softmax strategy to realize path diversity and increase the path search range, while avoiding premature convergence and falling into local optimization. Moreover, the elite ant strategy increases the pheromone release on the current optimal path and accelerates the convergence of the algorithm. Based on existing road network and bus lines, the algorithm carries out new line planning, which increases the rationality and practical feasibility of the new bus-line structure.<\/jats:p>","DOI":"10.3390\/ijgi11050317","type":"journal-article","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T02:57:02Z","timestamp":1653274622000},"page":"317","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["An Improved Ant Colony Algorithm for Urban Bus Network Optimization Based on Existing Bus Routes"],"prefix":"10.3390","volume":"11","author":[{"given":"Yuanyuan","family":"Wei","sequence":"first","affiliation":[{"name":"Institute of Geospatial Information, Information Engineering University, Zhengzhou 450001, China"},{"name":"School of Geography and Tourism, Zhengzhou Normal University, Zhengzhou 450001, China"}]},{"given":"Nan","family":"Jiang","sequence":"additional","affiliation":[{"name":"Institute of Geospatial Information, Information Engineering University, Zhengzhou 450001, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3840-4601","authenticated-orcid":false,"given":"Ziwei","family":"Li","sequence":"additional","affiliation":[{"name":"School of Water Conservancy Engineering, Zhengzhou University, Zhengzhou 450001, China"}]},{"given":"Dongdong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Zhengzhou Tiamaes Technology Co., Ltd., Zhengzhou 450001, China"}]},{"given":"Minjie","family":"Chen","sequence":"additional","affiliation":[{"name":"Institute of Geospatial Information, Information Engineering University, Zhengzhou 450001, China"}]},{"given":"Miaomiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"The First Institute of Geological Survey, Bureau of Geology and Mineral Exploration and Development of Henan Province, Zhengzhou 450001, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,5,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tranpol.2013.07.003","article-title":"Evaluating the impact of bus network planning changes in Sydney, Australia","volume":"30","author":"Mulley","year":"2013","journal-title":"Transp. Policy"},{"key":"ref_2","first-page":"140","article-title":"Method of public transit network planning based on strategy equilibrium transit assignment","volume":"15","author":"Xu","year":"2015","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.trb.2015.06.014","article-title":"Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm","volume":"81","author":"Arbex","year":"2015","journal-title":"Transport. Res. B-Meth."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trc.2019.12.004","article-title":"A two-phase optimization model for the demand-responsive customized bus network design","volume":"111","author":"Huang","year":"2020","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_5","first-page":"441","article-title":"A mathematical model for designing optimal urban gas networks, an ant colony algorithm and a case study","volume":"28","author":"Torkinejad","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2490","DOI":"10.1016\/j.apm.2007.09.030","article-title":"Generalized minimal cost flow problem in fuzzy nature: An application in bus network planning problem","volume":"32","author":"Ghatee","year":"2008","journal-title":"Appl. Math. Model"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s00291-011-0251-6","article-title":"Line planning in public transportation: Models and methods","volume":"34","year":"2012","journal-title":"OR Spectr."},{"key":"ref_8","unstructured":"Dorigo, M. (1992). Optimization, Learning and Natural Algorithms, Politecnico di Milano, Dipartimento di Elettronica."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and St\u00fctzle, T. (2004). Ant Colony Optimization, MIT Press.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref_11","first-page":"1161","article-title":"The hyper-cube framework for ant colony optimization","volume":"34","author":"Blum","year":"2004","journal-title":"IEEE Trans. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Soares, J., Sousa, T., Vale, Z.A., Morais, H., and Faria, P. (2011, January 24\u201328). Ant colony search algorithm for the optimal power flow problem. Proceedings of the 2011 IEEE Power and Energy Society General Meeting, Detroit, MI, USA.","DOI":"10.1109\/PES.2011.6039840"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/10106049.2019.1595176","article-title":"An improved ant colony optimization based algorithm for user-centric multi-objective path planning for ubiquitous environments","volume":"36","author":"Masoumi","year":"2019","journal-title":"Geocarto Int."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12469-011-0046-9","article-title":"An ant system application to the bus network design problem: An algorithm and a case study","volume":"3","author":"Poorzahedy","year":"2011","journal-title":"Public Transp."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Martynova, Y.A., Martynov, Y.A., Mustafina, D.B., and Asmolovskiy, V. (2014, January 16\u201318). Ant colony algorithm for rational transit network design of urban passenger transport. Proceedings of the 2014 International Conference on Mechanical Engineering, Automation and Control Systems (MEACS), Tomsk, Russia.","DOI":"10.1109\/MEACS.2014.6986883"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Hu, W., Wang, C., and Zuo, X. (2019, January 10\u201313). An ant colony optimization based approach to adjust public transportation network. Proceedings of the 2019 IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand.","DOI":"10.1109\/CEC.2019.8790117"},{"key":"ref_17","first-page":"234","article-title":"Bridging the gap between weak-demand areas and public transport using an ant-colony simulation-based optimization","volume":"45","author":"Giovanni","year":"2020","journal-title":"Transp. Res. Proc."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jtrangeo.2021.103075","article-title":"Short-term forecasts on individual accessibility in bus system based on neural network model","volume":"93","author":"Zuo","year":"2021","journal-title":"J. Transp. Geogr."},{"key":"ref_19","first-page":"62","article-title":"A review on the ant colony optimization metaheuristic: Basis, models and new trends","volume":"1","author":"Herrera","year":"2002","journal-title":"North Am. J. Sports Phys. Ther. Najspt"},{"key":"ref_20","unstructured":"Dorigo, M. (1991, January 11\u201313). The ant system: An autocatalytic optimizing process. Proceedings of the First European Conference on Artificial Life, Paris, France."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX-MIN ant system","volume":"16","author":"Hoos","year":"2000","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.plrev.2005.10.001","article-title":"Ant colony optimization: Introduction and recent trends","volume":"2","author":"Blum","year":"2005","journal-title":"Phys. Life Rev."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","article-title":"An ant colony system hybridized with a new local search for the sequential ordering problem","volume":"12","author":"Gambardella","year":"2000","journal-title":"Informs J. Comput."},{"key":"ref_24","first-page":"134","article-title":"Study on route optimization of bus network path based on improved ant colony algorithm","volume":"37","author":"Wu","year":"2021","journal-title":"Microcomput. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Birattari, M., Blum, C., Clerc, M., St\u00fctzle, T., and Winfield, A.F.T. (2008). Ant Colony Optimization and Swarm Intelligence: 6th International Conference, ANTS 2008, Lecture Notes in Computer Science, Springer.","DOI":"10.1007\/978-3-540-87527-7"},{"key":"ref_26","unstructured":"Jang, E., Gu, S., and Poole, B. (2016). Categorical reparameterization with gumbel-softmax. arXiv."},{"key":"ref_27","unstructured":"Ministry of Housing and Urban-Rural Development of the People\u2019s Republic of China (2018). Standard for Urban Comprehensive Transport System Planning, GB\/T51328-2018, State Council the People\u2019s Republic of China."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and St\u00fctzle, T. (2010). Ant Colony Optimization: Overview and Recent Advances, Springer US.","DOI":"10.1002\/9780470400531.eorms0030"},{"key":"ref_29","unstructured":"Bondarenko, M., Kerr, D., Sorichetta, A., and Tatem, A.J. (2020). Census\/Projection-Disaggregated Gridded Population Datasets for 189 Countries in 2020 Using Built-Settlement Growth Model (BSGM) Outputs, WorldPop, University of Southampton."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/11\/5\/317\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:16:36Z","timestamp":1760138196000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/11\/5\/317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,22]]},"references-count":29,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2022,5]]}},"alternative-id":["ijgi11050317"],"URL":"https:\/\/doi.org\/10.3390\/ijgi11050317","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,22]]}}}