{"id":"https://openalex.org/W2771141389","doi":"https://doi.org/10.1109/icat.2017.8171607","title":"Alternative pheromone laying strategy \u2014 An improvement for the ACO algorithm","display_name":"Alternative pheromone laying strategy \u2014 An improvement for the ACO algorithm","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2771141389","doi":"https://doi.org/10.1109/icat.2017.8171607","mag":"2771141389"},"language":"en","primary_location":{"id":"doi:10.1109/icat.2017.8171607","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icat.2017.8171607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 XXVI International Conference on Information, Communication and Automation Technologies (ICAT)","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/A5047222556","display_name":"Kemal Lutvica","orcid":null},"institutions":[{"id":"https://openalex.org/I104817121","display_name":"University of Sarajevo","ror":"https://ror.org/02hhwgd43","country_code":"BA","type":"education","lineage":["https://openalex.org/I104817121"]}],"countries":["BA"],"is_corresponding":true,"raw_author_name":"Kemal Lutvica","raw_affiliation_strings":["Faculty of Electrical Engineering, Sarajevo"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Sarajevo","institution_ids":["https://openalex.org/I104817121"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015574630","display_name":"Samim Konjicija","orcid":"https://orcid.org/0000-0003-4895-6223"},"institutions":[{"id":"https://openalex.org/I104817121","display_name":"University of Sarajevo","ror":"https://ror.org/02hhwgd43","country_code":"BA","type":"education","lineage":["https://openalex.org/I104817121"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Samim Konjicija","raw_affiliation_strings":["Faculty of Electrical Engineering, Sarajevo"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Sarajevo","institution_ids":["https://openalex.org/I104817121"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047222556"],"corresponding_institution_ids":["https://openalex.org/I104817121"],"apc_list":null,"apc_paid":null,"fwci":0.39,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71741289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":null,"first_page":"1","last_page":"6"},"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.9972000122070312,"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.9908999800682068,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7422763109207153},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.605568528175354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5873859524726868},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5534793734550476},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5321791768074036},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5087988972663879},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4993784427642822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46957632899284363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2698003053665161},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13880467414855957},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.0676310658454895}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7422763109207153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.605568528175354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5873859524726868},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5534793734550476},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5321791768074036},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5087988972663879},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4993784427642822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46957632899284363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2698003053665161},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13880467414855957},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0676310658454895},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/icat.2017.8171607","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icat.2017.8171607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 XXVI International Conference on Information, Communication and Automation Technologies (ICAT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W114492606","https://openalex.org/W1021161709","https://openalex.org/W1492640216","https://openalex.org/W1497425225","https://openalex.org/W1502839085","https://openalex.org/W1533992992","https://openalex.org/W1547709303","https://openalex.org/W1573676079","https://openalex.org/W1769929792","https://openalex.org/W1801849579","https://openalex.org/W1966355747","https://openalex.org/W2004631337","https://openalex.org/W2014426727","https://openalex.org/W2036737894","https://openalex.org/W2037567262","https://openalex.org/W2058569171","https://openalex.org/W2075270510","https://openalex.org/W2078297643","https://openalex.org/W2082878954","https://openalex.org/W2095899692","https://openalex.org/W2124253297","https://openalex.org/W2126554879","https://openalex.org/W2142978187","https://openalex.org/W2150897955","https://openalex.org/W2151758915","https://openalex.org/W2154599594","https://openalex.org/W2154929945","https://openalex.org/W2165613966","https://openalex.org/W2171211995","https://openalex.org/W2184220638","https://openalex.org/W2274648691","https://openalex.org/W2397790788","https://openalex.org/W2405775132","https://openalex.org/W2424499208","https://openalex.org/W2624091785","https://openalex.org/W3200986539","https://openalex.org/W4285719527","https://openalex.org/W4292083457","https://openalex.org/W6626616014","https://openalex.org/W6631638067","https://openalex.org/W6717797075","https://openalex.org/W6802030725"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W4255576661","https://openalex.org/W1516574938","https://openalex.org/W2132921321","https://openalex.org/W4285338599"],"abstract_inverted_index":{"This":[0],"paper":[1],"gives":[2],"a":[3,42,94],"brief":[4],"overview":[5],"of":[6,17,103],"the":[7,11,28,32,34,48,72,79,83,101,105,121,124,131,137,150,154,162],"current":[8,80],"state":[9],"in":[10,141,165],"ant":[12],"colony":[13],"optimization":[14,98],"(ACO)":[15],"field":[16],"study.":[18],"Furthermore,":[19],"it":[20],"introduces":[21],"an":[22,108,113,159],"alternative":[23],"pheromone":[24,133],"laying":[25,134],"strategy":[26,37],"for":[27,161],"ACO":[29,122,163],"algorithm.":[30],"In":[31,91],"paper,":[33],"newly":[35],"introduced":[36,140,151],"is":[38],"implemented,":[39],"tested":[40],"on":[41,71,82],"model":[43],"problem":[44,53,99],"and":[45,136],"compared":[46],"with":[47,88,100,130],"classical":[49,132],"approach.":[50],"A":[51],"parameterized":[52],"space":[54],"generator":[55,60],"has":[56,117,153],"been":[57,118],"introduced.":[58],"The":[59,144],"generates":[61],"graphs":[62],"along":[63],"which":[64],"ants":[65],"are":[66,127],"allowed":[67],"to":[68,77,112,156],"move":[69],"freely":[70],"Y":[73],"axis,":[74],"but":[75],"constrained":[76],"increment":[78],"value":[81],"X":[84],"axis":[85],"by":[86],"one":[87],"each":[89],"move.":[90],"this":[92,142],"way,":[93],"dynamic":[95],"decision":[96],"making":[97],"goal":[102],"minimizing":[104],"path":[106],"from":[107],"arbitrary":[109,114],"starting":[110],"node":[111,116],"finish":[115],"simulated.":[119],"Using":[120],"algorithm,":[123],"generated":[125],"problems":[126],"being":[128],"solved":[129],"approach":[135],"modified":[138],"approach,":[139],"paper.":[143],"obtained":[145],"results":[146],"unequivocally":[147],"indicate":[148],"that":[149],"modification":[152],"potential":[155],"serve":[157],"as":[158],"improvement":[160],"algorithm":[164],"general.":[166]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}