{"id":"https://openalex.org/W2979847361","doi":"https://doi.org/10.1109/fuzz-ieee.2019.8858965","title":"Evaluating Path Costs in Multi-Attributed Fuzzy Weighted Graphs","display_name":"Evaluating Path Costs in Multi-Attributed Fuzzy Weighted Graphs","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2979847361","doi":"https://doi.org/10.1109/fuzz-ieee.2019.8858965","mag":"2979847361"},"language":"en","primary_location":{"id":"doi:10.1109/fuzz-ieee.2019.8858965","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz-ieee.2019.8858965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5016008074","display_name":"Andrew R. Buck","orcid":"https://orcid.org/0000-0002-8892-3269"},"institutions":[{"id":"https://openalex.org/I76835614","display_name":"University of Missouri","ror":"https://ror.org/02ymw8z06","country_code":"US","type":"education","lineage":["https://openalex.org/I76835614"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew R. Buck","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Missouri, Columbia, MO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Missouri, Columbia, MO, USA","institution_ids":["https://openalex.org/I76835614"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018303984","display_name":"James M. Keller","orcid":"https://orcid.org/0000-0002-0306-7142"},"institutions":[{"id":"https://openalex.org/I76835614","display_name":"University of Missouri","ror":"https://ror.org/02ymw8z06","country_code":"US","type":"education","lineage":["https://openalex.org/I76835614"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James M. Keller","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Missouri, Columbia, MO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Missouri, Columbia, MO, USA","institution_ids":["https://openalex.org/I76835614"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I76835614"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9926000237464905,"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.9926000237464905,"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.9879999756813049,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9757999777793884,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6901750564575195},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6881363391876221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5517263412475586},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.5412911772727966},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.47511133551597595},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.47230175137519836},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4699038863182068},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4136635661125183},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3422294855117798},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3379907011985779},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.25299492478370667},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24465882778167725},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1526983082294464}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6901750564575195},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6881363391876221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5517263412475586},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5412911772727966},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.47511133551597595},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.47230175137519836},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4699038863182068},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4136635661125183},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3422294855117798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3379907011985779},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.25299492478370667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24465882778167725},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1526983082294464},{"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.1109/fuzz-ieee.2019.8858965","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz-ieee.2019.8858965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.75}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W117739548","https://openalex.org/W2008499862","https://openalex.org/W2052895059","https://openalex.org/W2060907774","https://openalex.org/W2088907949","https://openalex.org/W2148962857","https://openalex.org/W2330022088","https://openalex.org/W2557390227","https://openalex.org/W2898989085","https://openalex.org/W4292864963"],"related_works":["https://openalex.org/W1963790170","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W4293167680","https://openalex.org/W2586328217","https://openalex.org/W2049264236","https://openalex.org/W4387185483","https://openalex.org/W2018146256"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"consider":[4],"the":[5,38,47,50,66],"problem":[6],"of":[7,24,43,49],"choosing":[8],"a":[9,13,25,54,79,91],"least-cost":[10],"path":[11,26,73],"from":[12],"graph":[14],"that":[15,33],"is":[16,27,88],"attributed":[17],"with":[18,59],"multiple":[19,30],"fuzzy":[20],"weights.":[21],"The":[22],"cost":[23],"determined":[28],"by":[29],"conflicting":[31],"objectives":[32],"seek":[34],"to":[35,68,82],"minimize":[36],"either":[37],"total":[39],"or":[40],"maximum":[41],"values":[42],"each":[44],"feature":[45],"over":[46],"length":[48],"path.":[51],"We":[52],"present":[53],"framework":[55,81],"for":[56],"evaluating":[57],"paths":[58],"various":[60],"agent":[61,67],"preferences.":[62],"Our":[63,86],"method":[64],"allows":[65],"pick":[69],"any":[70],"Pareto":[71],"optimal":[72],"and":[74],"can":[75],"be":[76],"used":[77],"within":[78],"larger":[80],"model":[83],"decision-making":[84],"behavior.":[85],"approach":[87],"demonstrated":[89],"on":[90],"hand-crafted":[92],"example":[93],"problem.":[94]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}