{"id":"https://openalex.org/W622102445","doi":null,"title":"A Swarm Based Method for Solving Transit Network Design Problem","display_name":"A Swarm Based Method for Solving Transit Network Design Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W622102445","mag":"622102445"},"language":"en","primary_location":{"id":"mag:622102445","doi":null,"is_oa":false,"landing_page_url":"https://atrf.info/papers/2013/2013_bagherian_massah_kermanshahi.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306421082","display_name":"Transport Research Forum","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Transport Research Forum","raw_type":null},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111384245","display_name":"Mehdi Bagherian","orcid":"https://orcid.org/0000-0002-2716-2611","observed_orcids":["https://orcid.org/0000-0002-2716-2611"]},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"The University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mehdi Bagherian","raw_affiliation_strings":["University of Queensland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Queensland","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073302739","display_name":"Saghar Massah","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saghar Massah","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5040425595","display_name":"Shahab Kermanshahi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Shahab Kermanshahi","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5791,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.87896318,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9726999998092651,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9726999998092651,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.008100000210106373,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.004900000058114529,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/discrete-particle-swarm-optimization","display_name":"discrete particle swarm optimization","score":0.9950000047683716},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.8130000233650208},{"id":"https://openalex.org/keywords/route-generation","display_name":"route generation","score":0.8610000014305115},{"id":"https://openalex.org/keywords/line-selection","display_name":"line selection","score":0.6790000200271606},{"id":"https://openalex.org/keywords/coverage-index","display_name":"coverage index","score":0.6660000085830688},{"id":"https://openalex.org/keywords/transit-planning","display_name":"public transport planning","score":0.6539999842643738}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.8441799879074097},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7470008134841919},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7185691595077515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5452260971069336},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.5266264081001282},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5084832906723022},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47913333773612976},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4787158966064453},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4158627390861511},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4133108854293823},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.41216155886650085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2932376563549042},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:622102445","doi":null,"is_oa":false,"landing_page_url":"https://atrf.info/papers/2013/2013_bagherian_massah_kermanshahi.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306421082","display_name":"Transport Research Forum","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Transport Research Forum","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":1.0,"display_name":"Industry, innovation and infrastructure"},{"id":"https://metadata.un.org/sdg/11","score":0.7250000238418579,"display_name":"Sustainable cities and communities"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W582866124","https://openalex.org/W639573532","https://openalex.org/W1526455201","https://openalex.org/W1573676079","https://openalex.org/W1583652789","https://openalex.org/W1996872168","https://openalex.org/W2016880844","https://openalex.org/W2020643724","https://openalex.org/W2074326697","https://openalex.org/W2076598517","https://openalex.org/W2076898726","https://openalex.org/W2104205822","https://openalex.org/W2125213524","https://openalex.org/W2158786338","https://openalex.org/W2163199665","https://openalex.org/W2165299997","https://openalex.org/W2378722512","https://openalex.org/W2402846924","https://openalex.org/W2543580944","https://openalex.org/W3147414854"],"related_works":["https://openalex.org/W3032061552","https://openalex.org/W2034158924","https://openalex.org/W2998544897","https://openalex.org/W2142804835","https://openalex.org/W4394875800","https://openalex.org/W2599689448","https://openalex.org/W2282947270","https://openalex.org/W2076598517","https://openalex.org/W3204243174","https://openalex.org/W2795275546"],"abstract_inverted_index":{"In":[0],"this":[1],"study,":[2],"a":[3,59],"Discrete":[4],"Particle":[5],"Swarm":[6],"Optimization":[7],"(DPSO)":[8],"algorithm":[9,61,120],"is":[10,25,35,45,62,78,99],"assimilated":[11],"to":[12,48,64,79],"solve":[13],"the":[14,28,51,56,66,72,85,96,118,123,130],"Transit":[15],"Network":[16],"Design":[17],"Problem":[18],"(TNDP).":[19],"First,":[20],"A":[21,41],"Mixed":[22],"Integer":[23],"Model":[24],"developed":[26,47],"for":[27],"TNDP.":[29],"The":[30,75,91],"solution":[31],"methodology":[32],"utilized":[33,63],"here":[34],"made":[36],"of":[37,69,95],"two":[38],"major":[39],"elements.":[40],"route":[42],"generation":[43],"module":[44],"firstly":[46],"generate":[49],"all":[50],"feasible":[52],"transit":[53],"lines.":[54],"Through":[55],"second":[57],"part,":[58],"DPSO":[60],"select":[65],"optimal":[67],"set":[68],"lines":[70],"from":[71],"constructed":[73],"ones.":[74],"objective":[76],"function":[77],"maximize":[80],"coverage":[81],"index":[82],"while":[83],"satisfying":[84],"operator":[86],"cost":[87],"upper":[88],"level":[89],"constraints.":[90],"efficacy":[92],"and":[93],"accuracy":[94],"implemented":[97],"algorithms":[98],"compared":[100],"with":[101,126],"ones":[102],"obtained":[103],"by":[104],"an":[105,111],"enumeration":[106],"process":[107],"as":[108,110],"well":[109],"enumeration-based":[112],"heuristic":[113],"approach.":[114],"Results":[115],"confirmed":[116],"that":[117],"PSO":[119],"can":[121],"find":[122],"optimum":[124],"combination":[125],"significant":[127],"decrease":[128],"in":[129],"computational":[131],"costs.":[132]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}