{"id":"https://openalex.org/W3028732239","doi":"https://doi.org/10.1145/3396474.3396490","title":"Extension of the Time Dependent Travelling Salesman Problem with Interval Valued Intuitionistic Fuzzy Model Applying Memetic Optimization Algorithm","display_name":"Extension of the Time Dependent Travelling Salesman Problem with Interval Valued Intuitionistic Fuzzy Model Applying Memetic Optimization Algorithm","publication_year":2020,"publication_date":"2020-03-21","ids":{"openalex":"https://openalex.org/W3028732239","doi":"https://doi.org/10.1145/3396474.3396490","mag":"3028732239"},"language":"en","primary_location":{"id":"doi:10.1145/3396474.3396490","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3396474.3396490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","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/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 Informatics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics Informatics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"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":"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 Technology, Sz\u00e9chenyi, Istv\u00e1n University, Gyor, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Logistics Technology, Sz\u00e9chenyi, Istv\u00e1n University, Gyor, Hungary","institution_ids":["https://openalex.org/I83579964"]}]},{"author_position":"last","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"]},{"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":"Laszlo T. Koczy","raw_affiliation_strings":["Department of Information Technology, Sz\u00e9chenyi Istv\u00e1n University, Gyor, Hungary Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Sz\u00e9chenyi Istv\u00e1n University, Gyor, Hungary Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179","https://openalex.org/I83579964"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.115,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.33176864,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"218","issue":null,"first_page":"111","last_page":"118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9911999702453613,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9911999702453613,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9853000044822693,"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/T10820","display_name":"Fuzzy Logic and Control Systems","score":0.9832000136375427,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8957201242446899},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.7632191181182861},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6945432424545288},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.633867621421814},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.603481650352478},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5694088935852051},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5541368722915649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49005019664764404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46183228492736816},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4596215784549713},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4581969380378723},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.45374757051467896},{"id":"https://openalex.org/keywords/fuzzy-set","display_name":"Fuzzy set","score":0.41576820611953735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3420047163963318},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.32795557379722595},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2385338842868805},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14697256684303284}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8957201242446899},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.7632191181182861},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6945432424545288},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.633867621421814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.603481650352478},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5694088935852051},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5541368722915649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49005019664764404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46183228492736816},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4596215784549713},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4581969380378723},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.45374757051467896},{"id":"https://openalex.org/C42011625","wikidata":"https://www.wikidata.org/wiki/Q1055058","display_name":"Fuzzy set","level":3,"score":0.41576820611953735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3420047163963318},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.32795557379722595},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2385338842868805},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14697256684303284},{"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.1145/3396474.3396490","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3396474.3396490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","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.8100000023841858}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1980564456","https://openalex.org/W1990212111","https://openalex.org/W2017708378","https://openalex.org/W2018660239","https://openalex.org/W2039536988","https://openalex.org/W2084987997","https://openalex.org/W2132885717","https://openalex.org/W2141178894","https://openalex.org/W2293737317","https://openalex.org/W2346953349","https://openalex.org/W2588100979","https://openalex.org/W2612769101","https://openalex.org/W2954570322","https://openalex.org/W2979700958","https://openalex.org/W4211007335","https://openalex.org/W4253487531","https://openalex.org/W6604633863"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W4391264787","https://openalex.org/W2766468404","https://openalex.org/W4214682618","https://openalex.org/W4246557197","https://openalex.org/W2946024655","https://openalex.org/W2758988501","https://openalex.org/W2244079844","https://openalex.org/W3013791021"],"abstract_inverted_index":{"The":[0,124,207],"Time":[1,94],"Dependent":[2,95],"Traveling":[3,14,96],"Salesman":[4,15,97],"Problem":[5,16,98],"(TD":[6],"TSP)":[7],"is":[8,22,102,214,219,257],"an":[9,195],"extension":[10,105],"of":[11,24,106,115,149,202,209,252,262],"the":[12,25,36,49,90,107,112,135,140,150,170,183,187,203,225,234,260,263],"classic":[13,108],"towards":[17],"more":[18,87,198],"realistic":[19,88],"conditions.":[20],"TSP":[21],"one":[23],"most":[26],"extensively":[27],"studied":[28],"NP-complete":[29],"graph":[30],"search":[31],"problems.":[32],"In":[33,65,78],"TD":[34,109],"TSP,":[35,110],"edges":[37,68],"are":[38,46,69,146,155],"assigned":[39,70],"different":[40],"weights,":[41],"depending":[42],"on":[43],"whether":[44],"they":[45],"traveled":[47],"in":[48,158,176,250],"traffic":[50,136],"jam":[51,137],"regions":[52],"(such":[53,163],"as":[54,164,194],"busy":[55],"city":[56],"centers)":[57],"and":[58,85,139,247],"during":[59],"rush":[60,141],"hour":[61,142],"periods,":[62],"or":[63],"not.":[64],"such":[66,210],"circumstances,":[67],"higher":[71,180],"costs,":[72],"expressed":[73],"by":[74,233],"a":[75,83,103,211,220],"multiplying":[76],"factor.":[77],"this":[79],"paper,":[80],"we":[81],"introduce":[82],"novel":[84],"even":[86],"approach,":[89],"Interval":[91],"Intuitionistic":[92],"Fuzzy":[93],"(IVIFTD":[99],"TSP);":[100],"which":[101,154],"further":[104],"with":[111,179],"additional":[113,147],"notion":[114],"deploying":[116],"interval":[117,128],"valued":[118,129],"intuitionistic":[119,130],"fuzzy":[120,131,167,185],"for":[121,133,243,259],"describing":[122],"uncertainties.":[123],"core":[125],"concept":[126],"employs":[127],"sets":[132,168],"quantifying":[134],"regions,":[138],"periods":[143],"loss":[144],"(those":[145],"costs":[148],"travel":[151],"between":[152],"nodes),":[153],"always":[156],"uncertain":[157],"real":[159],"life.":[160],"Since":[161],"type-2":[162],"inter":[165],"valued)":[166],"have":[169],"potential":[171],"to":[172],"provide":[173],"better":[174],"performance":[175],"modeling":[177],"problems":[178,246],"uncertainties":[181],"than":[182],"traditional":[184],"set,":[186],"new":[188],"approach":[189],"it":[190,218,256],"may":[191],"be":[192],"considered":[193],"extended,":[196],"practically":[197],"applicable,":[199],"extended":[200],"version":[201],"original":[204],"abstract":[205],"problem.":[206,223],"optimization":[208,261],"complex":[212],"model":[213],"obviously":[215],"very":[216],"difficult;":[217],"mathematically":[221],"intractable":[222],"However,":[224],"Discrete":[226],"Bacterial":[227],"Memetic":[228],"Evolutionary":[229],"Algorithm":[230],"proposed":[231],"earlier":[232],"authors'":[235],"team":[236],"has":[237],"shown":[238],"sufficient":[239],"efficiency,":[240],"general":[241],"applicability":[242],"similar":[244],"type":[245],"good":[248],"predictability":[249],"terms":[251],"problem":[253],"size,":[254],"thus":[255],"applied":[258],"concrete":[264],"instances.":[265]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}