{"id":"https://openalex.org/W3013417486","doi":"https://doi.org/10.1051/ro/2020033","title":"An acceptability index based approach for solving shortest path problem on a network with interval weights","display_name":"An acceptability index based approach for solving shortest path problem on a network with interval weights","publication_year":2020,"publication_date":"2020-03-28","ids":{"openalex":"https://openalex.org/W3013417486","doi":"https://doi.org/10.1051/ro/2020033","mag":"3013417486"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2020033","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020033","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190140.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190140.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089713497","display_name":"Ali Ebrahimnejad","orcid":"https://orcid.org/0000-0001-6003-6601"},"institutions":[{"id":"https://openalex.org/I4210138903","display_name":"Qaemshahr Islamic Azad University","ror":"https://ror.org/03y0dv989","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210138903"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Ali Ebrahimnejad","raw_affiliation_strings":["Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran"],"raw_orcid":"https://orcid.org/0000-0001-6003-6601","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran","institution_ids":["https://openalex.org/I4210138903"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089713497"],"corresponding_institution_ids":["https://openalex.org/I4210138903"],"apc_list":null,"apc_paid":null,"fwci":3.9321,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92955013,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"55","issue":null,"first_page":"S1767","last_page":"S1787"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9847000241279602,"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.9847000241279602,"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision 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.9699000120162964,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8006917238235474},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.73373943567276},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7096129655838013},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5713121294975281},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.563467800617218},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5328128337860107},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.47847363352775574},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.4659857153892517},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4647964835166931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44988304376602173},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.41893577575683594},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.41041240096092224},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1687929928302765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16343539953231812}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8006917238235474},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.73373943567276},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7096129655838013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5713121294975281},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.563467800617218},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5328128337860107},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.47847363352775574},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.4659857153892517},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4647964835166931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44988304376602173},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.41893577575683594},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.41041240096092224},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1687929928302765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16343539953231812},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","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},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro/2020033","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020033","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190140.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:edpsciences.org:dkey/10.1051/ro/2020033","is_oa":true,"landing_page_url":null,"pdf_url":"https://www.rairo-ro.org/10.1051/ro/2020033/pdf","source":{"id":"https://openalex.org/S4306400744","display_name":"Springer Link (Chiba Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8488066","host_organization_name":"Chiba Institute of Technology","host_organization_lineage":["https://openalex.org/I8488066"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.1051/ro/2020033","raw_type":"Text"},{"id":"pmh:oai:numdam.org:RO_2021__55_S1_S1767_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2020033/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1051/ro/2020033","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020033","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190140.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3013417486.pdf","grobid_xml":"https://content.openalex.org/works/W3013417486.grobid-xml"},"referenced_works_count":62,"referenced_works":["https://openalex.org/W25941918","https://openalex.org/W1965423661","https://openalex.org/W1970013289","https://openalex.org/W1971921764","https://openalex.org/W1977545325","https://openalex.org/W1978943789","https://openalex.org/W1981906998","https://openalex.org/W1985261575","https://openalex.org/W1986129478","https://openalex.org/W1986564315","https://openalex.org/W1986955201","https://openalex.org/W1990453721","https://openalex.org/W1994937951","https://openalex.org/W2013934519","https://openalex.org/W2017782972","https://openalex.org/W2017833737","https://openalex.org/W2022391611","https://openalex.org/W2027448650","https://openalex.org/W2030321354","https://openalex.org/W2033104105","https://openalex.org/W2038504986","https://openalex.org/W2039114216","https://openalex.org/W2054326643","https://openalex.org/W2054743918","https://openalex.org/W2055923132","https://openalex.org/W2062014422","https://openalex.org/W2068758895","https://openalex.org/W2068851130","https://openalex.org/W2073914408","https://openalex.org/W2076989661","https://openalex.org/W2080638416","https://openalex.org/W2087463697","https://openalex.org/W2088332410","https://openalex.org/W2090568667","https://openalex.org/W2091226080","https://openalex.org/W2119702428","https://openalex.org/W2122967662","https://openalex.org/W2123784360","https://openalex.org/W2125916239","https://openalex.org/W2141694395","https://openalex.org/W2156431668","https://openalex.org/W2161950876","https://openalex.org/W2188945014","https://openalex.org/W2330022088","https://openalex.org/W2460560651","https://openalex.org/W2592489447","https://openalex.org/W2736102896","https://openalex.org/W2766349321","https://openalex.org/W2787900023","https://openalex.org/W2802569726","https://openalex.org/W2804394601","https://openalex.org/W2897388634","https://openalex.org/W2898328298","https://openalex.org/W2898975971","https://openalex.org/W2903389907","https://openalex.org/W2932532270","https://openalex.org/W2938846476","https://openalex.org/W2982103310","https://openalex.org/W2990452149","https://openalex.org/W2994464318","https://openalex.org/W3008423411","https://openalex.org/W4243529478"],"related_works":["https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2375280931","https://openalex.org/W3183360588","https://openalex.org/W2352589493","https://openalex.org/W2391048224","https://openalex.org/W2978166001","https://openalex.org/W2387829241","https://openalex.org/W2376231728","https://openalex.org/W2395868876"],"abstract_inverted_index":{"Based":[0],"on":[1],"the":[2,18,27,52,64,69,83,92,95,99,109,112,118,127,131,146,150,154,158,176],"acceptability":[3,65],"index":[4,66],"for":[5,20,102],"comparison":[6],"of":[7,29,94,98,111,149,157,165],"any":[8],"two":[9],"imprecise":[10],"values,":[11],"efficient":[12],"algorithms":[13],"have":[14],"been":[15],"proposed":[16,49,113,128,151,159],"in":[17,32,122,178],"literature":[19,123],"solving":[21,103],"shortest":[22],"path":[23],"(SP)":[24],"problem":[25,54,72],"when":[26],"weights":[28],"connected":[30],"arcs":[31],"a":[33,44,166,172],"transportation":[34],"network":[35,141],"are":[36,134],"represented":[37],"as":[38],"interval":[39,56,70,104],"numbers.":[40],"In":[41],"this":[42],"study,":[43],"generalized":[45],"Dijkstra":[46],"algorithm":[47,101,114,117,129,160],"is":[48,60,67,73,79,91,124,142,161],"to":[50,144],"handle":[51],"SP":[53,71,85,105],"with":[55],"weights.":[57],"Here":[58],"it":[59],"shown":[61],"that":[62],"once":[63],"chosen,":[68],"converted":[74],"into":[75],"crisp":[76],"one,":[77],"which":[78],"easily":[80],"solved":[81,125],"by":[82,163],"standard":[84],"algorithms.":[86],"The":[87],"main":[88],"contribution":[89],"here":[90],"reduction":[93],"computational":[96],"complexity":[97],"existing":[100,116],"problem.":[106],"To":[107],"show":[108],"advantages":[110],"over":[115],"numerical":[119],"example":[120],"presented":[121],"using":[126],"and":[130],"obtained":[132],"results":[133],"discussed.":[135],"Moreover,":[136],"an":[137],"small":[138],"sized":[139],"telecommunication":[140],"provided":[143],"illustrate":[145],"potential":[147],"application":[148],"method.":[152],"Finally,":[153],"practical":[155],"relevance":[156],"evaluated":[162],"means":[164],"large":[167],"scale":[168],"pilot":[169],"case":[170],"where":[171],"pharmaceutical":[173],"shipment":[174],"between":[175],"cities":[177],"Iran":[179],"should":[180],"be":[181],"transported.":[182]},"counts_by_year":[{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-07T06:14:10.401900","created_date":"2025-10-10T00:00:00"}