Solution biases and pheromone representation selection in ant colony optimisation Montgomery, James

User activity

Send to:
View the summary of this work
Author
Montgomery, James
Subjects
Combinatorial optimisation problems ; Metaheuristic algorithms ; ACO
Summary
Combinatorial optimisation problems (COPs) pervade human society: scheduling, design, layout, distribution, timetabling, resource allocation and project management all feature problems where the solution is some combination of elements, the overall value of which needs to be either maximised or minimised (i.e., optimised), typically subject to a number of constraints. This thesis investigates a number of aspects of the application of the relatively new Ant Colony Optimisation (ACO) metaheuristic to different COPs.
Bookmark
http://trove.nla.gov.au/work/3861470
Work ID
3861470

1 (out of 2) editions of this work

Find a specific edition

Limited to : Thesis, Online, English . Remove limits to show all 2 editions

Thumbnail [View as table] [View as grid] Title, Author, Edition Date Language Format Libraries

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this work

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this work

Add a comment


Show comments and reviews from Amazon users