{"id":"https://openalex.org/W3008423411","doi":"https://doi.org/10.3233/jifs-191413","title":"The fuzzy inference approach to solve multi-objective constrained shortest path problem","display_name":"The fuzzy inference approach to solve multi-objective constrained shortest path problem","publication_year":2020,"publication_date":"2020-02-28","ids":{"openalex":"https://openalex.org/W3008423411","doi":"https://doi.org/10.3233/jifs-191413","mag":"3008423411"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-191413","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-191413","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-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/A5049238184","display_name":"Ali Abbaszadeh Sori","orcid":"https://orcid.org/0000-0001-7070-4722"},"institutions":[{"id":"https://openalex.org/I4400573191","display_name":"Islamic Azad University, Babol","ror":"https://ror.org/00pwbq328","country_code":null,"type":"education","lineage":["https://openalex.org/I4400573191"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ali Abbaszadeh Sori","raw_affiliation_strings":["Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran","institution_ids":["https://openalex.org/I4400573191"]}]},{"author_position":"middle","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":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran","institution_ids":["https://openalex.org/I4210138903"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103062523","display_name":"Homayun Motameni","orcid":"https://orcid.org/0000-0003-1309-6569"},"institutions":[{"id":"https://openalex.org/I4210086811","display_name":"Islamic Azad University Sari Branch","ror":"https://ror.org/0032wgp28","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210086811"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Homayun Motameni","raw_affiliation_strings":["Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran","institution_ids":["https://openalex.org/I4210086811"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089713497"],"corresponding_institution_ids":["https://openalex.org/I4210138903"],"apc_list":null,"apc_paid":null,"fwci":4.7429,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.95036225,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"38","issue":"4","first_page":"4711","last_page":"4720"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.989300012588501,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.989300012588501,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9646000266075134,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.961899995803833,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8277357220649719},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7402600049972534},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6362709999084473},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6357470750808716},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6346266865730286},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.605193555355072},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5617175102233887},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.510971188545227},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4617602527141571},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.445229172706604},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.42946746945381165},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.406879723072052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2683223783969879},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10413461923599243},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06910151243209839}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8277357220649719},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7402600049972534},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6362709999084473},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6357470750808716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6346266865730286},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.605193555355072},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5617175102233887},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.510971188545227},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4617602527141571},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.445229172706604},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42946746945381165},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.406879723072052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2683223783969879},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10413461923599243},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06910151243209839},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs-191413","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-191413","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1694068690","https://openalex.org/W1969743129","https://openalex.org/W1994937951","https://openalex.org/W2019150015","https://openalex.org/W2027448650","https://openalex.org/W2044209627","https://openalex.org/W2069667928","https://openalex.org/W2073914408","https://openalex.org/W2093094460","https://openalex.org/W2148970446","https://openalex.org/W2301247617","https://openalex.org/W2460560651","https://openalex.org/W2594963174","https://openalex.org/W2750067401","https://openalex.org/W2760903378","https://openalex.org/W2786028510","https://openalex.org/W2799656406","https://openalex.org/W2801412643","https://openalex.org/W2804394601","https://openalex.org/W2876559649","https://openalex.org/W2890964912","https://openalex.org/W2902851216","https://openalex.org/W2903305877","https://openalex.org/W2936556251","https://openalex.org/W2968254493"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W2156431668","https://openalex.org/W2030169809","https://openalex.org/W2360981904","https://openalex.org/W2767202586","https://openalex.org/W2353519994","https://openalex.org/W1987046149","https://openalex.org/W4352982540"],"abstract_inverted_index":{"The":[0,70,106,137,151],"multi-objective":[1],"constrained":[2,48],"shortest":[3,49],"path":[4,50,68,78,99],"problem":[5,51,112],"is":[6,60,65,72,115,140,161],"one":[7],"of":[8,18,37,46,55,90,98,145,154,163],"the":[9,16,35,43,47,63,67,75,96,111,155,165],"most":[10,76],"significant":[11],"and":[12,58,93,130,148],"well-known":[13],"problems":[14],"in":[15,27,125,134],"field":[17],"network":[19,144],"optimization":[20],"which":[21,95,121],"due":[22],"to":[23,73,79,84,116,127],"its":[24],"many":[25,38],"applications":[26],"routing,":[28],"telecommunication,":[29],"transportation,":[30],"scheduling,":[31],"etc.,":[32],"has":[33],"attracted":[34],"attention":[36],"researchers.":[39],"In":[40],"this":[41],"paper,":[42],"mathematical":[44],"model":[45],"with":[52],"three":[53,88],"objectives":[54],"cost,":[56,91],"time":[57],"risk":[59,94],"formulated,":[61],"where":[62],"constraint":[64],"on":[66,87,142],"length.":[69],"aim":[71],"find":[74],"desirable":[77],"move":[80],"commodities":[81],"from":[82],"origin":[83],"destination":[85],"based":[86],"factors":[89],"time,":[92],"length":[97],"does":[100],"not":[101],"exceed":[102],"a":[103,143],"predetermined":[104],"value.":[105],"approach":[107],"proposed":[108,138,156],"for":[109],"solving":[110],"under":[113],"investigation":[114],"use":[117],"fuzzy":[118],"inference":[119],"system":[120],"finds":[122],"optimal":[123,166],"solution":[124],"comparison":[126],"linear":[128],"programming":[129],"genetic":[131],"algorithm":[132,139,157],"approaches":[133],"less":[135],"time.":[136],"implemented":[141],"27":[146],"nodes":[147],"52":[149],"arcs.":[150],"implementation":[152],"results":[153],"show":[158],"that":[159],"it":[160],"capable":[162],"finding":[164],"solution.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}