{"id":"https://openalex.org/W2979700958","doi":"https://doi.org/10.1109/fuzz-ieee.2019.8858853","title":"Modeling of Fuzzy Rule-base Algorithm for the Time Dependent Traveling Salesman Problem","display_name":"Modeling of Fuzzy Rule-base Algorithm for the Time Dependent Traveling Salesman Problem","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2979700958","doi":"https://doi.org/10.1109/fuzz-ieee.2019.8858853","mag":"2979700958"},"language":"en","primary_location":{"id":"doi:10.1109/fuzz-ieee.2019.8858853","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz-ieee.2019.8858853","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/A5020781131","display_name":"L\u00e1szl\u00f3 T. K\u00f3czy","orcid":"https://orcid.org/0000-0003-1316-4832"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Laszlo T. Koczy","raw_affiliation_strings":["Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043012924","display_name":"P\u00e9ter F\u00f6ldesi","orcid":"https://orcid.org/0000-0003-3701-2913"},"institutions":[{"id":"https://openalex.org/I83579964","display_name":"Sz\u00e9chenyi Istv\u00e1n University","ror":"https://ror.org/04091f946","country_code":"HU","type":"education","lineage":["https://openalex.org/I83579964"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Peter Foldesi","raw_affiliation_strings":["Department of Logistics, Sz\u00e9chenyi Istv\u00e1n University, Gyor, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Logistics, Sz\u00e9chenyi Istv\u00e1n University, Gyor, Hungary","institution_ids":["https://openalex.org/I83579964"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064382273","display_name":"Boldizs\u00e1r T\u00fc\u0171-Szab\u00f3","orcid":"https://orcid.org/0000-0003-3217-9204"},"institutions":[{"id":"https://openalex.org/I83579964","display_name":"Sz\u00e9chenyi Istv\u00e1n University","ror":"https://ror.org/04091f946","country_code":"HU","type":"education","lineage":["https://openalex.org/I83579964"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Boldizsar Tuu-Szabo","raw_affiliation_strings":["Department of Information Technology, Sz\u00e9chenyi Istv\u00e1n University, Gyor, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Sz\u00e9chenyi Istv\u00e1n University, Gyor, Hungary","institution_ids":["https://openalex.org/I83579964"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072535289","display_name":"Ruba Almahasneh","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Ruba Almahasneh","raw_affiliation_strings":["Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0832,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.94890597,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"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.9986000061035156,"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.9986000061035156,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.994700014591217,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9684000015258789,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9663978219032288},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.7271139621734619},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.6845097541809082},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6728688478469849},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6075338125228882},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5941175818443298},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.5765519738197327},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5051029324531555},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.4507026672363281},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.4447479844093323},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.425639271736145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41332846879959106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3476065397262573},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.3097022473812103},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13971632719039917}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9663978219032288},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.7271139621734619},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.6845097541809082},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6728688478469849},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6075338125228882},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5941175818443298},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.5765519738197327},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5051029324531555},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.4507026672363281},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.4447479844093323},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.425639271736145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41332846879959106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3476065397262573},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3097022473812103},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13971632719039917},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fuzz-ieee.2019.8858853","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz-ieee.2019.8858853","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W18216792","https://openalex.org/W626292722","https://openalex.org/W1970104171","https://openalex.org/W1990212111","https://openalex.org/W2084987997","https://openalex.org/W2112077260","https://openalex.org/W2227719026","https://openalex.org/W2558362747","https://openalex.org/W2588100979","https://openalex.org/W2760544841","https://openalex.org/W2804769572","https://openalex.org/W2963876348","https://openalex.org/W4211007335","https://openalex.org/W6600754543","https://openalex.org/W6730720062"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W8433631","https://openalex.org/W4391264787","https://openalex.org/W1984036937","https://openalex.org/W2033053473","https://openalex.org/W2093665022","https://openalex.org/W2766468404"],"abstract_inverted_index":{"The":[0,119,155,216],"Traveling":[1,42,108],"Salesman":[2,43,109],"Problem":[3,44],"(TSP)":[4],"is":[5,47,157],"one":[6,48],"of":[7,49,56,66,114,125,144,166,203,225,228],"the":[8,17,32,50,57,64,77,87,101,115,126,133,141,145,151,167,176,180,207,211,219,223,226,232],"most":[9,51],"extensively":[10],"studied":[11],"NP-hard":[12,204],"graph":[13],"search":[14],"problems.":[15],"In":[16,61,91,172],"literature,":[18],"there":[19],"have":[20],"been":[21,191],"numerous":[22],"published":[23],"attempts,":[24],"applying":[25],"various":[26],"approaches":[27],"in":[28,76,132,199],"order":[29,173],"to":[30,158,174,193],"find":[31],"optimum":[33,38,178],"(least":[34],"cost)":[35],"or":[36,85],"semi":[37],"solution.":[39],"Time":[40,106],"Dependent":[41,107],"(TD":[45],"TSP)":[46],"sufficient":[52],"extensions":[53,224],"and":[54,149,163,210,242],"modifications":[55],"original":[58,116,208,233],"TSP":[59,63,103,121,128,170,209,213,235],"problem.":[60,171],"TD":[62,117,127,169,212,234],"costs":[65],"edges":[67],"between":[68,135],"nodes":[69,137],"varies,":[70],"they":[71],"are":[72],"assigned":[73],"higher":[74],"cost":[75,134],"traffic":[78,146],"jam":[79,147],"region,":[80,148],"such":[81],"as":[82,214],"city":[83],"center":[84],"during":[86],"rush":[88,152],"hour":[89,153],"periods.":[90],"this":[92],"paper,":[93],"we":[94],"introduce":[95],"an":[96],"even":[97],"more":[98],"realistic":[99,164],"approach,":[100],"3FTD":[102,120],"(Triple":[104],"Fuzzy":[105],"Problem);":[110],"a":[111,123,160,200],"fuzzified":[112],"model":[113],"TSP.":[118],"presents":[122],"variation":[124],"utilizing":[129],"fuzzy":[130],"values":[131],"two":[136],"(shops,":[138],"cities,":[139],"etc.),":[140],"geographical":[142],"areas":[143],"also":[150],"period.":[154],"goal":[156],"give":[159],"practically":[161],"useful":[162],"alternative":[165],"basic":[168],"calculate":[175],"(quasi-)":[177],"solution,":[179],"Discrete":[181],"Bacterial":[182],"Memetic":[183],"Evolutionary":[184],"Algorithm":[185],"was":[186],"used,":[187],"since":[188],"it":[189],"has":[190],"proven":[192],"be":[194],"rather":[195,240],"efficient":[196],"(and":[197],"predictably)":[198],"wide":[201],"range":[202],"problems,":[205],"including":[206],"well.":[215],"results":[217],"from":[218,231],"runs":[220],"based":[221],"on":[222],"family":[227],"benchmarks":[229],"generated":[230],"benchmark":[236],"data":[237],"set":[238],"showed":[239],"good":[241],"credible":[243],"initial":[244],"results.":[245]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}