You are not logged in.

Dear visitor, welcome to Jabaco - Community. If this is your first visit here, please read the Help. It explains in detail how this page works. To use all features of this page, you should consider registering. Please use the registration form, to register here or read more information about the registration process. If you are already registered, please login here.



  • "A1880" is male
  • "A1880" started this thread

Posts: 500

Date of registration: Jan 1st 2009

Location: Hanover, Germany

Occupation: Software Engineer

Hobbies: Hilbert Curves

  • Send private message


Thursday, June 2nd 2011, 11:56pm

Simulated Bee Colony

James D. McCaffrey published a fascinating article on "Natural Algorithms"
Use Bee Colony Algorithms to Solve Impossible Problems in the April 2011 edition of MSDN Magazine.

I've ported his VB.Net code to Jabaco:

During my experiments, I've made the following observations:
  • The Jabaco application finds the optimal solution most of the time while the published code doesn't
    (I have no clue, why this happens. This is left as an exercise to the reader ...)
  • The Jabaco app takes some 30s to execute from within the IDE but only 2s being executed as Exe file.
  • The VB.Net/C# code takes 30ms
  • Char arrays in Jabaco don't work. I replaced them by Integer arrays
    (this seems to be a bug or an omission in the Framework)

It would be nice to integrate this code into my Traveling Salesman Sample.
Any volunteers?


This post has been edited 1 times, last edit by "A1880" (Jun 3rd 2011, 1:04pm)

Rate this thread
WoltLab Burning Board