Well ants are hard and you made it a bit easier, thanks for letting us know about your book and for making it available to the community.
I scanned over a few of the chapters and is an excellent treatise. Ever since I read a long forgotten book on Programming and was hooked by the practical examples provided (and started coding!) I would love to see some real examples accompanying the algorithms.
For example this paper by
S. T. Mugford, E. B. Mallon, and N. R. Franks of the Centre for Mathematical Biology and Department of Biology and Biochemistry, University of Bath, published a paper http://beheco.oxfordjournals.org/cgi/reprint/12/6/655 [pdf] about how colonies of the ant <it>Leptothorax albipennis</it> naturally inhabit flat rock crevices. Scouts can determine, before initiating an emigration, if a nest has sufficient area to house their colony. They postulated that this was achieved using Buffon's needle's method! Would love to see how this would have fitted with metaheuristic algorithms!
I also loved the discussion on random generators (needs a little bit of expansion)!
I scanned over a few of the chapters and is an excellent treatise. Ever since I read a long forgotten book on Programming and was hooked by the practical examples provided (and started coding!) I would love to see some real examples accompanying the algorithms.
For example this paper by S. T. Mugford, E. B. Mallon, and N. R. Franks of the Centre for Mathematical Biology and Department of Biology and Biochemistry, University of Bath, published a paper http://beheco.oxfordjournals.org/cgi/reprint/12/6/655 [pdf] about how colonies of the ant <it>Leptothorax albipennis</it> naturally inhabit flat rock crevices. Scouts can determine, before initiating an emigration, if a nest has sufficient area to house their colony. They postulated that this was achieved using Buffon's needle's method! Would love to see how this would have fitted with metaheuristic algorithms!
I also loved the discussion on random generators (needs a little bit of expansion)!