{"id":"https://openalex.org/W1855838724","doi":"https://doi.org/10.1109/cec.2004.1331130","title":"Heuristics for ant colony optimisation using the generalised assignment problem","display_name":"Heuristics for ant colony optimisation using the generalised assignment problem","publication_year":2005,"publication_date":"2005-01-17","ids":{"openalex":"https://openalex.org/W1855838724","doi":"https://doi.org/10.1109/cec.2004.1331130","mag":"1855838724"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2004.1331130","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1331130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","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/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":true,"raw_author_name":"M. Randall","raw_affiliation_strings":["Bond University, QLD, Australia","Meta-heuristic Search Group, Bond Univ., Gold Coast, Qld., Australia"],"affiliations":[{"raw_affiliation_string":"Bond University, QLD, Australia","institution_ids":["https://openalex.org/I120125038"]},{"raw_affiliation_string":"Meta-heuristic Search Group, Bond Univ., Gold Coast, Qld., Australia","institution_ids":["https://openalex.org/I120125038"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073782726"],"corresponding_institution_ids":["https://openalex.org/I120125038"],"apc_list":null,"apc_paid":null,"fwci":2.7402,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.90619925,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2358","issue":null,"first_page":"1916","last_page":"1923"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/heuristics","display_name":"Heuristics","score":0.8853583335876465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6213937401771545},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6091386675834656},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5851032137870789},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.565066933631897},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5462815165519714},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5367039442062378},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4821619391441345},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.43314674496650696},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33100971579551697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20952513813972473},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.08210331201553345}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8853583335876465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6213937401771545},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6091386675834656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5851032137870789},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.565066933631897},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5462815165519714},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5367039442062378},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4821619391441345},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.43314674496650696},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33100971579551697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20952513813972473},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.08210331201553345},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2004.1331130","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1331130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","raw_type":"proceedings-article"},{"id":"pmh:oai:https://pure.bond.edu.au/:publications/0336b0ad-381d-4b16-a5a6-de6da45e362d","is_oa":false,"landing_page_url":"https://research.bond.edu.au/en/publications/0336b0ad-381d-4b16-a5a6-de6da45e362d","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Randall , M 2004 , Heuristics for ant colony optimisation using the generalised assignment problem . in Congress on Evolutionary Computation : CEC2004 . vol. 2 , pp. 1916-1923 , IEEE Congress on Evolutionary Computation , Portland, OR , United States , 19/06/04 . https://doi.org/10.1109/CEC.2004.1331130","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W215309248","https://openalex.org/W608096882","https://openalex.org/W1507159998","https://openalex.org/W1511186767","https://openalex.org/W1529539254","https://openalex.org/W1570210286","https://openalex.org/W1674834782","https://openalex.org/W1748133846","https://openalex.org/W1930648503","https://openalex.org/W1993062444","https://openalex.org/W2025704344","https://openalex.org/W2058233069","https://openalex.org/W2109469182","https://openalex.org/W2115322778","https://openalex.org/W2126554879","https://openalex.org/W2154929945","https://openalex.org/W2171211995","https://openalex.org/W2171964388","https://openalex.org/W6608647132","https://openalex.org/W6630410477","https://openalex.org/W6631764740","https://openalex.org/W6637980374","https://openalex.org/W7063824378"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1975009952","https://openalex.org/W1588949866","https://openalex.org/W46882622","https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2462483068"],"abstract_inverted_index":{"The":[0],"use":[1],"of":[2,17,22,31],"embedded":[3],"heuristics":[4,44],"within":[5],"meta-heuristic":[6],"search":[7,43,63],"algorithms":[8],"has":[9],"a":[10],"large":[11,74],"effect":[12],"on":[13],"their":[14],"performance.":[15],"One":[16],"the":[18,33,41],"more":[19],"recent":[20],"classes":[21],"meta-heuristics,":[23],"ant":[24],"colony":[25],"optimisation,":[26],"is":[27],"examined":[28],"in":[29],"terms":[30],"both":[32],"heuristic":[34,52],"used":[35,45],"to":[36,46,69,73],"select":[37],"solution":[38],"components":[39],"and":[40,50,75],"local":[42,62],"improve":[47],"solutions.":[48],"Static":[49],"adaptive":[51],"control":[53],"strategies":[54],"are":[55,67],"developed,":[56],"as":[57,59],"well":[58],"neighbourhood":[60],"oriented":[61],"transition":[64],"operators,":[65],"that":[66],"able":[68],"obtain":[70],"good":[71],"solutions":[72],"tightly":[76],"constrained":[77],"generalised":[78],"assignment":[79],"problem":[80],"instances.":[81]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}