{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T02:12:19Z","timestamp":1724292739117},"reference-count":27,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,11,20]],"date-time":"2006-11-20T00:00:00Z","timestamp":1163980800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer aided Civil Eng"],"published-print":{"date-parts":[[2007,1]]},"abstract":"Abstract:\u2003<\/jats:bold> This study presents an optimization model for a bus network design based on the coarse\u2010grain parallel ant colony algorithm (CPACA). It aims to maximize the number of direct travelers per unit length, that is, direct traveler density, subject to route length and nonlinear rate constraints (ratio of the length of a route to the shortest road distance between the origin and destination). CPACA is a new optimal algorithm that (1) develops a new strategy to update the increased pheromone, called Ant\u2010Weight, by which the path\u2010searching activities of ants are adjusted based on the objective function, and (2) uses parallelization strategies of an ant colony algorithm (ACA) to improve the calculation time and the quality of the optimization. Data collected in Dalian City, China, are used to test the model and the algorithm. The results show that the optimized bus network has significantly reduced transfers and travel time. They also reveal that the proposed CPACA is effective and efficient compared to some existing ant algorithms.<\/jats:italic> <\/jats:p>","DOI":"10.1111\/j.1467-8667.2006.00469.x","type":"journal-article","created":{"date-parts":[[2006,11,20]],"date-time":"2006-11-20T09:53:41Z","timestamp":1164016421000},"page":"44-55","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":120,"title":["A Parallel Ant Colony Algorithm for Bus Network Optimization"],"prefix":"10.1111","volume":"22","author":[{"given":"Zhongzhen","family":"Yang","sequence":"first","affiliation":[]},{"given":"Bin","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Chuntian","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,11,20]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0968-090X(94)00011-S"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2003.08.018"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219525998000119"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-3279-4_6"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8667.00309"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(1995)121:6(544)"},{"key":"e_1_2_7_8_1","first-page":"841","volume-title":"Computers in Urban Planning and Urban Management","author":"Dashora M.","year":"1998"},{"key":"e_1_2_7_9_1","unstructured":"Dorigo M.(1992) Optimization learning and natural algorithms Ph.D. thesis Politecnico di Milano Italy ."},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/3009501"},{"key":"e_1_2_7_12_1","first-page":"533","article-title":"An expert system for the preliminary design and location of high capacity bus stops","volume":"34","author":"Fernandez R.","year":"1993","journal-title":"Traffic Engineering Control"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(01)00102-8"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.3.237.12636"},{"key":"e_1_2_7_15_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_7_16_1","unstructured":"Guan J. F. Yang H.&Wirasinghe S. C.(2004) Determine network transit line configuration for optimal passenger line assignment inProceedings of the 2004 IEEE International Conference on Networking Sensing & Control 2 839\u201343."},{"key":"e_1_2_7_17_1","unstructured":"Hasselstr\u00f6\u0151m D.(1981) Public transportation planning\u2014A mathematical programming approach Doctoral dissertation University of G\u00f6\u0151teborg Sweden ."},{"key":"e_1_2_7_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00367-3"},{"key":"e_1_2_7_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015057701750"},{"key":"e_1_2_7_20_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(1990)116:4(517)"},{"key":"e_1_2_7_21_1","unstructured":"Simonis C.(1981) Optimierung von omnibuslinien. Berichte stadt\u2013region\u2013land Institut f\u00fcr Stadtbauwesen RWTH Aachen."},{"key":"e_1_2_7_22_1","first-page":"B15","article-title":"Heuristic procedures for planning demand\u2010oriented traffic routes in public transport systems","volume":"23","author":"Sonntag H.","year":"1979","journal-title":"Z. Operation Research Series A-B"},{"key":"e_1_2_7_23_1","volume-title":"Optimization of Transport Networks","author":"Steenbrink P. A.","year":"1974"},{"key":"e_1_2_7_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5775-3_22"},{"issue":"4","key":"e_1_2_7_25_1","first-page":"359","article-title":"Sloving TSP Problems by ant colony optimization and noising method","volume":"4","author":"Su C. T.","year":"2003","journal-title":"Commerce & Management Quarterly"},{"key":"e_1_2_7_26_1","volume-title":"Planning and Management Technology for Urban Transit Systems","author":"Wang W.","year":"2001"},{"issue":"10","key":"e_1_2_7_27_1","first-page":"1240","article-title":"An ant colony algorithm with mutation features","volume":"36","author":"Wu Q. H.","year":"1999","journal-title":"Journal of Computer Research & Development"},{"key":"e_1_2_7_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00321-7"}],"container-title":["Computer-Aided Civil and Infrastructure Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fj.1467-8667.2006.00469.x","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/j.1467-8667.2006.00469.x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T00:27:44Z","timestamp":1696897664000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/j.1467-8667.2006.00469.x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,20]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["10.1111\/j.1467-8667.2006.00469.x"],"URL":"https:\/\/doi.org\/10.1111\/j.1467-8667.2006.00469.x","archive":["Portico"],"relation":{},"ISSN":["1093-9687","1467-8667"],"issn-type":[{"value":"1093-9687","type":"print"},{"value":"1467-8667","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,20]]},"assertion":[{"value":"2006-11-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}