{"id":"https://openalex.org/W2083225422","doi":"https://doi.org/10.7148/2013-0551","title":"An Integrated Model Of Parallel Processing And PSO Algorithm For Solving Optimum Highway Alignment Problem","display_name":"An Integrated Model Of Parallel Processing And PSO Algorithm For Solving Optimum Highway Alignment Problem","publication_year":2013,"publication_date":"2013-05-27","ids":{"openalex":"https://openalex.org/W2083225422","doi":"https://doi.org/10.7148/2013-0551","mag":"2083225422"},"language":"en","primary_location":{"id":"doi:10.7148/2013-0551","is_oa":false,"landing_page_url":"https://doi.org/10.7148/2013-0551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2013 Proceedings edited by: Webjorn Rekdalsbakken, Robin T. Bye, Houxiang Zhang","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5022547442","display_name":"Seyed Farzan Kazemi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Seyed Farzan Kazemi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020491763","display_name":"Yousef Shafahi","orcid":"https://orcid.org/0000-0003-4267-4348"},"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":"Yousef Shafahi","raw_affiliation_strings":["Sharif University of Technology"],"affiliations":[{"raw_affiliation_string":"Sharif University of Technology","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022547442"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.21996916,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"551","last_page":"557"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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.9986000061035156,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9758999943733215,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9678999781608582,"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/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7410072684288025},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7090590596199036},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6607844233512878},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5957031846046448},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5755812525749207},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.49954915046691895},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4586808979511261},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4478673040866852},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4432544410228729},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.42912936210632324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13236945867538452}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7410072684288025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7090590596199036},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6607844233512878},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5957031846046448},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5755812525749207},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.49954915046691895},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4586808979511261},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4478673040866852},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4432544410228729},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.42912936210632324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13236945867538452},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7148/2013-0551","is_oa":false,"landing_page_url":"https://doi.org/10.7148/2013-0551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2013 Proceedings edited by: Webjorn Rekdalsbakken, Robin T. Bye, Houxiang Zhang","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1480195994","https://openalex.org/W1886215955","https://openalex.org/W1971368545","https://openalex.org/W1981418042","https://openalex.org/W2031780366","https://openalex.org/W2080569432","https://openalex.org/W2152195021","https://openalex.org/W2165299997","https://openalex.org/W3136883406","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2116677773","https://openalex.org/W2155261584","https://openalex.org/W2584231425","https://openalex.org/W1934426788","https://openalex.org/W4312509357","https://openalex.org/W3123416417","https://openalex.org/W2013038594","https://openalex.org/W23263483","https://openalex.org/W1599844062","https://openalex.org/W2350700808"],"abstract_inverted_index":{"Optimum":[0],"highway":[1,53],"alignment":[2,54],"is":[3,75,92,102,114],"among":[4],"the":[5,25,29,44,112],"most":[6],"substantial,":[7],"but":[8],"large":[9],"and":[10,24,34,64,79],"complicated":[11],"topics":[12],"in":[13,77],"transportation":[14],"area.":[15],"Infinite":[16],"number":[17],"of":[18,28,61,111],"feasible":[19],"solutions,":[20],"numerous":[21],"local":[22],"optima":[23],"constrained":[26],"feature":[27],"problem,":[30],"associated":[31],"with":[32,106],"complex":[33],"mainly":[35],"non-linear":[36],"constraints,":[37],"has":[38],"put":[39],"an":[40,58],"extra":[41],"effort":[42],"into":[43],"problem":[45,56],"solving":[46,52,95],"process.":[47],"This":[48],"paper":[49],"focuses":[50],"on":[51,116],"optimization":[55,67],"using":[57],"integrated":[59],"model":[60,113],"parallel":[62,84],"processing":[63],"particle":[65],"swarm":[66],"algorithm.":[68],"To":[69],"achieve":[70],"this":[71],"goal,":[72],"algorithm":[73],"parallelization":[74],"done":[76],"synchronous":[78],"asynchronous":[80],"manner.":[81],"For":[82],"assessing":[83],"performance,":[85],"corresponding":[86],"indexes":[87],"are":[88],"evaluated.":[89],"SRTM3":[90],"databank":[91],"used":[93],"for":[94,104],"real-world":[96,118],"problems.":[97,121],"The":[98,108],"penalty":[99],"function":[100],"approach":[101],"employed":[103],"dealing":[105],"constraints.":[107],"successful":[109],"application":[110],"investigated":[115],"two":[117],"route":[119],"location":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}