{"id":"https://openalex.org/W2765843121","doi":"https://doi.org/10.1109/ssci.2017.8285229","title":"Pheromone modification strategy for the dynamic travelling salesman problem with weight changes","display_name":"Pheromone modification strategy for the dynamic travelling salesman problem with weight changes","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2765843121","doi":"https://doi.org/10.1109/ssci.2017.8285229","mag":"2765843121"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2017.8285229","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5078937916","display_name":"Michalis Mavrovouniotis","orcid":"https://orcid.org/0000-0002-5281-4175"},"institutions":[{"id":"https://openalex.org/I52590639","display_name":"Nottingham Trent University","ror":"https://ror.org/04xyxjd90","country_code":"GB","type":"education","lineage":["https://openalex.org/I52590639"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Michalis Mavrovouniotis","raw_affiliation_strings":["School of Science and Technology, Nottingham Trent University, Nottingham, U.K"],"affiliations":[{"raw_affiliation_string":"School of Science and Technology, Nottingham Trent University, Nottingham, U.K","institution_ids":["https://openalex.org/I52590639"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062828983","display_name":"Mien Van","orcid":"https://orcid.org/0000-0001-9616-6061"},"institutions":[{"id":"https://openalex.org/I52590639","display_name":"Nottingham Trent University","ror":"https://ror.org/04xyxjd90","country_code":"GB","type":"education","lineage":["https://openalex.org/I52590639"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mien Van","raw_affiliation_strings":["School of Science and Technology, Nottingham Trent University, Nottingham, U.K"],"affiliations":[{"raw_affiliation_string":"School of Science and Technology, Nottingham Trent University, Nottingham, U.K","institution_ids":["https://openalex.org/I52590639"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040583251","display_name":"Shengxiang Yang","orcid":"https://orcid.org/0000-0001-7222-4917"},"institutions":[{"id":"https://openalex.org/I66943878","display_name":"De Montfort University","ror":"https://ror.org/0312pnr83","country_code":"GB","type":"education","lineage":["https://openalex.org/I66943878"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shengxiang Yang","raw_affiliation_strings":["School of Computer Science and Informatics, De Montfort University, Leicester, U.K"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Informatics, De Montfort University, Leicester, U.K","institution_ids":["https://openalex.org/I66943878"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078937916"],"corresponding_institution_ids":["https://openalex.org/I52590639"],"apc_list":null,"apc_paid":null,"fwci":0.6231,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77780611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9976999759674072,"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.9945999979972839,"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.8618291020393372},{"id":"https://openalex.org/keywords/pheromone","display_name":"Pheromone","score":0.7846881151199341},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7074889540672302},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6392279267311096},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6093119382858276},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.56745845079422},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5490440130233765},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4195137023925781},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3214157223701477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27470579743385315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2354922592639923},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.08199810981750488},{"id":"https://openalex.org/keywords/ecology","display_name":"Ecology","score":0.06548067927360535}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8618291020393372},{"id":"https://openalex.org/C2777328355","wikidata":"https://www.wikidata.org/wiki/Q167377","display_name":"Pheromone","level":2,"score":0.7846881151199341},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7074889540672302},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6392279267311096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6093119382858276},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.56745845079422},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5490440130233765},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4195137023925781},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3214157223701477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27470579743385315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2354922592639923},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.08199810981750488},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.06548067927360535},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ssci.2017.8285229","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8285229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:www.dora.dmu.ac.uk:2086/14663","is_oa":false,"landing_page_url":"http://hdl.handle.net/2086/14663","pdf_url":null,"source":{"id":"https://openalex.org/S4306400394","display_name":"DMU Open Research Archive (De Montfort University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66943878","host_organization_name":"De Montfort University","host_organization_lineage":["https://openalex.org/I66943878"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/0dfb1603-16d0-40b3-8236-4fb3c0c5b02c","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/0dfb1603-16d0-40b3-8236-4fb3c0c5b02c","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mavrovouniotis, M, Van, M & Yang, S 2017, Pheromone Modifications strategy for the dynamic travelling salesman problem with weight changes. in 2017 IEEE Symposium Series on Computational Intelligence (SSCI). https://doi.org/10.1109/SSCI.2017.8285229","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.5,"id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G5662168501","display_name":null,"funder_award_id":"EP/K001310/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W38666132","https://openalex.org/W143911440","https://openalex.org/W1519085183","https://openalex.org/W1791215375","https://openalex.org/W1796403065","https://openalex.org/W1810046508","https://openalex.org/W1910719349","https://openalex.org/W1970526056","https://openalex.org/W1981472769","https://openalex.org/W2015606203","https://openalex.org/W2031784930","https://openalex.org/W2107941094","https://openalex.org/W2156106639","https://openalex.org/W2421912678","https://openalex.org/W2573212983","https://openalex.org/W4299796063","https://openalex.org/W6605859759"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W1997193297","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2406404685","https://openalex.org/W2981400081","https://openalex.org/W4297427155","https://openalex.org/W2975368677"],"abstract_inverted_index":{"Ant":[0],"colony":[1],"optimization":[2,48],"(ACO)":[3],"algorithms":[4],"have":[5],"proved":[6],"to":[7,10,63],"be":[8,40,51],"able":[9],"adapt":[11],"in":[12,34,82,122],"problems":[13],"that":[14,29,94],"change":[15,26],"dynamically.":[16],"One":[17],"of":[18,57,86,104],"the":[19,30,35,43,47,54,58,66,76,84,87,101,105,111,114],"key":[20],"issues":[21],"for":[22,65],"ACO":[23,130],"when":[24],"a":[25],"occurs":[27],"is":[28,108],"pheromone":[31,55,92,102,116],"trails":[32,56,103],"generated":[33,68],"previous":[36,59],"environment":[37,60],"will":[38],"not":[39],"compatible":[41],"with":[42],"new":[44],"environment.":[45],"Therefore,":[46],"process":[49],"may":[50],"biased":[52],"from":[53],"and":[61,98],"fail":[62],"search":[64],"newly":[67],"global":[69],"optimum.":[70],"In":[71],"this":[72],"paper,":[73],"we":[74],"consider":[75],"dynamic":[77],"travelling":[78],"salesman":[79],"problem":[80],"(DTSP)":[81],"which":[83],"weights":[85],"arcs":[88,107],"are":[89],"modified.":[90],"A":[91],"strategy":[93,117],"utilizes":[95],"change-related":[96],"information":[97],"regulates":[99],"heuristically":[100],"affected":[106],"proposed.":[109],"From":[110],"experimental":[112],"results":[113],"heuristic-based":[115],"performs":[118],"statistically":[119],"significant":[120],"better":[121],"most":[123],"DTSP":[124],"test":[125],"cases":[126],"than":[127],"other":[128],"peer":[129],"algorithms.":[131]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}