{"id":"https://openalex.org/W3031145066","doi":"https://doi.org/10.1145/3396474.3396485","title":"Ant Colony Optimization for Time-Dependent Travelling Salesman Problem","display_name":"Ant Colony Optimization for Time-Dependent Travelling Salesman Problem","publication_year":2020,"publication_date":"2020-03-21","ids":{"openalex":"https://openalex.org/W3031145066","doi":"https://doi.org/10.1145/3396474.3396485","mag":"3031145066"},"language":"en","primary_location":{"id":"doi:10.1145/3396474.3396485","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3396474.3396485","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":"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/A5029382584","display_name":"Petra Tomanov\u00e1","orcid":"https://orcid.org/0000-0001-8072-3193"},"institutions":[{"id":"https://openalex.org/I35913352","display_name":"Prague University of Economics and Business","ror":"https://ror.org/029ecwj92","country_code":"CZ","type":"education","lineage":["https://openalex.org/I35913352"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petra Tomanov\u00e1","raw_affiliation_strings":["University of Economics, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"University of Economics, Prague, Czech Republic","institution_ids":["https://openalex.org/I35913352"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083355816","display_name":"Vladim\u00edr Hol\u00fd","orcid":"https://orcid.org/0000-0003-0416-0434"},"institutions":[{"id":"https://openalex.org/I35913352","display_name":"Prague University of Economics and Business","ror":"https://ror.org/029ecwj92","country_code":"CZ","type":"education","lineage":["https://openalex.org/I35913352"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vladim\u00edr Hol\u00fd","raw_affiliation_strings":["University of Economics, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"University of Economics, Prague, Czech Republic","institution_ids":["https://openalex.org/I35913352"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029382584"],"corresponding_institution_ids":["https://openalex.org/I35913352"],"apc_list":null,"apc_paid":null,"fwci":0.824,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77996691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"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.9988999962806702,"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.998199999332428,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9733999967575073,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9266811609268188},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8253204226493835},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.77482008934021},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.716522216796875},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.7136237621307373},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6853350400924683},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6122140884399414},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5603861212730408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5528587102890015},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5480319857597351},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5375634431838989},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4836238920688629},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.47631439566612244},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4587017297744751},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4147152900695801},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3271252512931824},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21026942133903503},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.17150208353996277}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9266811609268188},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8253204226493835},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.77482008934021},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.716522216796875},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.7136237621307373},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6853350400924683},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6122140884399414},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5603861212730408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5528587102890015},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5480319857597351},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5375634431838989},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4836238920688629},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.47631439566612244},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4587017297744751},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4147152900695801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3271252512931824},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21026942133903503},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.17150208353996277},{"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.3396485","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3396474.3396485","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":[{"score":0.4699999988079071,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1968429519","https://openalex.org/W1981245140","https://openalex.org/W1987671593","https://openalex.org/W1990021722","https://openalex.org/W2049287714","https://openalex.org/W2059305197","https://openalex.org/W2059762964","https://openalex.org/W2064816527","https://openalex.org/W2072136110","https://openalex.org/W2080484716","https://openalex.org/W2084987997","https://openalex.org/W2107612355","https://openalex.org/W2167920923","https://openalex.org/W2936542636","https://openalex.org/W4238432342","https://openalex.org/W4255108251"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W4246557197","https://openalex.org/W2191054341","https://openalex.org/W2106103215","https://openalex.org/W3013791021","https://openalex.org/W2469984263","https://openalex.org/W2653294936"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,12,21,31,38,43,47,59,77,85,97,104],"time-dependent":[4],"travelling":[5,33],"salesman":[6,34],"problem":[7,35,61],"(TDTSP)":[8],"is":[9,23,27,53],"reviewed":[10],"and":[11,62,95],"heuristic":[13,65,98],"based":[14],"on":[15,42],"ant":[16,86],"colony":[17,87],"optimization":[18,88],"for":[19,80],"solving":[20],"TDTSP":[22,26],"proposed.":[24],"The":[25],"an":[28],"extension":[29,52],"of":[30,103],"classical":[32],"in":[36,45,69],"which":[37,46],"edge":[39],"costs":[40],"depend":[41],"order":[44,70],"edges":[48],"are":[49],"visited.":[50],"This":[51],"even":[54],"more":[55],"computationally":[56],"complex":[57],"than":[58],"original":[60],"therefore":[63],"a":[64,73,91,100],"must":[66],"be":[67],"used":[68],"to":[71,76,99],"get":[72],"solution":[74],"close":[75],"optimal":[78],"one":[79],"larger-scale":[81],"problems.":[82],"We":[83],"combine":[84],"algorithm":[89],"with":[90],"modified":[92],"local":[93],"search":[94],"apply":[96],"simplified":[101],"version":[102],"flying":[105],"tourist":[106],"problem.":[107]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}