{"id":"https://openalex.org/W1561653904","doi":"https://doi.org/10.1007/3-540-45724-0_22","title":"Candidate Set Strategies for Ant Colony Optimisation","display_name":"Candidate Set Strategies for Ant Colony Optimisation","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1561653904","doi":"https://doi.org/10.1007/3-540-45724-0_22","mag":"1561653904"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45724-0_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45724-0_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.bond.edu.au/ws/files/30078279/AM_Candidate_set_strategies_for_ant_colony_optimisation.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073782726","display_name":"Marcus Randall","orcid":"https://orcid.org/0000-0003-2325-1032"},"institutions":[{"id":"https://openalex.org/I120125038","display_name":"Bond University","ror":"https://ror.org/006jxzx88","country_code":"AU","type":"education","lineage":["https://openalex.org/I120125038"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Marcus Randall","raw_affiliation_strings":["School of Information Technology, Bond University Gold Coast, 4229, Queensland, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology, Bond University Gold Coast, 4229, Queensland, Australia","institution_ids":["https://openalex.org/I120125038"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024921295","display_name":"James Montgomery","orcid":"https://orcid.org/0000-0002-5360-7514"},"institutions":[{"id":"https://openalex.org/I120125038","display_name":"Bond University","ror":"https://ror.org/006jxzx88","country_code":"AU","type":"education","lineage":["https://openalex.org/I120125038"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"James Montgomery","raw_affiliation_strings":["School of Information Technology, Bond University Gold Coast, 4229, Queensland, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology, Bond University Gold Coast, 4229, Queensland, Australia","institution_ids":["https://openalex.org/I120125038"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.2657,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.88739118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"243","last_page":"249"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9977999925613403,"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.9977999925613403,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9830999970436096,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.97079998254776,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8599440455436707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7888665199279785},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.724398136138916},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6593252420425415},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5539441108703613},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5402699112892151},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.460955411195755},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3392912447452545},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28960275650024414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11786511540412903}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8599440455436707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7888665199279785},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.724398136138916},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6593252420425415},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5539441108703613},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5402699112892151},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.460955411195755},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3392912447452545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28960275650024414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11786511540412903},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":7,"locations":[{"id":"doi:10.1007/3-540-45724-0_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45724-0_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:researchbank.swinburne.edu.au:203a2fdc-6204-4833-9541-7483196ee290/1","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.3/26105","pdf_url":null,"source":{"id":"https://openalex.org/S4306401157","display_name":"Swinburne Research Bank (Swinburne University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I57093077","host_organization_name":"Swinburne University of Technology","host_organization_lineage":["https://openalex.org/I57093077"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Ant Algorithms: 3rd International Workshop on Ant Algorithms (ANTS 2002), Brussels, Belgium, 12-14 September 2002, Vol. 2463, no. 1, pp. 243-249","raw_type":"acceptedVersion"},{"id":"pmh:oai:https://pure.bond.edu.au/:publications/3bfb55aa-a4f1-418e-bf4b-c58d8b3b7623","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84974707321&partnerID=8YFLogxK","pdf_url":"https://pure.bond.edu.au/ws/files/30078279/AM_Candidate_set_strategies_for_ant_colony_optimisation.pdf","source":{"id":"https://openalex.org/S4306402608","display_name":"Bond University Research Portal (Bond University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I120125038","host_organization_name":"Bond University","host_organization_lineage":["https://openalex.org/I120125038"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Randall, M & Montgomery, J 2002, Candidate set strategies for ant colony optimisation. in M Dorigo , G di Caro & M Sampels (eds), Ant Algorithms - 3rd International Workshop, ANTS 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2463, Springer-Verlag London Ltd., pp. 243-249, 3rd International Workshop on Ant Algorithms, ANTS 2002, Brussels, Belgium, 12/09/02. https://doi.org/10.1007/3-540-45724-0_22","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ecite.utas.edu.au:97259","is_oa":false,"landing_page_url":"http://ecite.utas.edu.au/97259","pdf_url":null,"source":{"id":"https://openalex.org/S4306401569","display_name":"eCite Digital Repository (University of Tasmania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129801699","host_organization_name":"University of Tasmania","host_organization_lineage":["https://openalex.org/I129801699"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Refereed Conference Paper"},{"id":"pmh:oai:https://pure.bond.edu.au/:openaire/3bfb55aa-a4f1-418e-bf4b-c58d8b3b7623","is_oa":true,"landing_page_url":"https://research.bond.edu.au/en/publications/3bfb55aa-a4f1-418e-bf4b-c58d8b3b7623","pdf_url":null,"source":{"id":"https://openalex.org/S4306402608","display_name":"Bond University Research Portal (Bond University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I120125038","host_organization_name":"Bond University","host_organization_lineage":["https://openalex.org/I120125038"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Randall, M & Montgomery, J 2002, Candidate set strategies for ant colony optimisation. in M Dorigo , G di Caro & M Sampels (eds), Ant Algorithms - 3rd International Workshop, ANTS 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2463, Springer-Verlag London Ltd., pp. 243-249, 3rd International Workshop on Ant Algorithms, ANTS 2002, Brussels, Belgium, 12/09/02. https://doi.org/10.1007/3-540-45724-0_22","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:epublications.bond.edu.au:infotech_pubs-1163","is_oa":false,"landing_page_url":"http://epublications.bond.edu.au/infotech_pubs/160","pdf_url":null,"source":{"id":"https://openalex.org/S4306401894","display_name":"e-publications@bond (Bond University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I120125038","host_organization_name":"Bond University","host_organization_lineage":["https://openalex.org/I120125038"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Information Technology papers","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/23093621","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Candidate_set_strategies_for_ant_colony_optimisation/23093621","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:https://pure.bond.edu.au/:publications/3bfb55aa-a4f1-418e-bf4b-c58d8b3b7623","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84974707321&partnerID=8YFLogxK","pdf_url":"https://pure.bond.edu.au/ws/files/30078279/AM_Candidate_set_strategies_for_ant_colony_optimisation.pdf","source":{"id":"https://openalex.org/S4306402608","display_name":"Bond University Research Portal (Bond University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I120125038","host_organization_name":"Bond University","host_organization_lineage":["https://openalex.org/I120125038"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Randall, M & Montgomery, J 2002, Candidate set strategies for ant colony optimisation. in M Dorigo , G di Caro & M Sampels (eds), Ant Algorithms - 3rd International Workshop, ANTS 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2463, Springer-Verlag London Ltd., pp. 243-249, 3rd International Workshop on Ant Algorithms, ANTS 2002, Brussels, Belgium, 12/09/02. https://doi.org/10.1007/3-540-45724-0_22","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1561653904.pdf","grobid_xml":"https://content.openalex.org/works/W1561653904.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W161004712","https://openalex.org/W1504935863","https://openalex.org/W1530715683","https://openalex.org/W1557288165","https://openalex.org/W1561653904","https://openalex.org/W1587263632","https://openalex.org/W1591519682","https://openalex.org/W1717440967","https://openalex.org/W2020602812","https://openalex.org/W2058569171","https://openalex.org/W2063769328","https://openalex.org/W2090275183","https://openalex.org/W2118051273","https://openalex.org/W2154929945","https://openalex.org/W2167920923","https://openalex.org/W2339500526","https://openalex.org/W2974328486","https://openalex.org/W2997776631","https://openalex.org/W4212899374"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2120093588","https://openalex.org/W2981400081","https://openalex.org/W2347951034","https://openalex.org/W2313077844","https://openalex.org/W2388326823","https://openalex.org/W1997193297"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}