Expiring Today—Celebrate National IT Professionals Day with 3 months of free Premium Membership. Use Code ITDAY17

x
?
Solved

Shortest Path Problem Application using Ant Colony Algorithm

Posted on 2011-03-23
4
Medium Priority
?
1,503 Views
Last Modified: 2012-08-14
Hello Expert :)

I would love to build an interface application in JAVA.

I have searched in internet for the ACO algorithms in JAVA but was not successful. Could you please help me out :)
I would like at least the simple algorithms in JAVA such as: Ant System (variant: Ant Cycle),
Ant Colony System, and a few others you feel like would be great for comparisons for a set of examples (which will be created via my application)

Here is Brief Description of MY undergraduate thesis:
I have to make an Interactive Application that includes a GUI.
My application is basically supposed to solve the Shortest Path Problem (SPP), using the algorithm: Ant Colony Optimization (ACO).

The animation for the ACO algorithm needs to be shown whilst its solving a given SPP test. This test can be randomly generated: x number of cities, with random coordinates, OR it could be user inputted by a setting the number or cities and manually putting in the coordinates (maybe via a drop down menu?). There should also be various graphs/charts created to show the effectiveness of the algorithm with other tests as well.
I have basic understanding in programming and learning how to implement Swing and event handling. I am lost as to where I should begin. I was wondering if you could list me out the things (classes, functions, imports) I should use (or which is more effective and hopefully easier :) I will be using Netbeans to design the application.

I will appreciate any suggestion/help

Thanks in advance,

Best Regards,
Subhash Chandra
0
Comment
Question by:subhashchy
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
  • 2
  • 2
4 Comments
 
LVL 47

Accepted Solution

by:
for_yan earned 2000 total points
ID: 35203487

This seems to be a relevant article with explanation and code in Java:
http://www.ugosweb.com/Documents/jacs.aspx
0
 
LVL 8

Author Comment

by:subhashchy
ID: 35228135
Thanks Yan...

Any other suggestion guys ?
0
 
LVL 47

Expert Comment

by:for_yan
ID: 35228152
I guess you need to click Request Attention - otherwise no one
but me receives notification that you posted reply/question
0
 
LVL 8

Author Closing Comment

by:subhashchy
ID: 35284921
Thanks For the assistence...
0

Featured Post

Enroll in September's Course of the Month

This month’s featured course covers 16 hours of training in installation, management, and deployment of VMware vSphere virtualization environments. It's free for Premium Members, Team Accounts, and Qualified Experts!

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Article by: Nadia
Linear search (searching each index in an array one by one) works almost everywhere but it is not optimal in many cases. Let's assume, we have a book which has 42949672960 pages. We also have a table of contents. Now we want to read the content on p…
Iteration: Iteration is repetition of a process. A student who goes to school repeats the process of going to school everyday until graduation. We go to grocery store at least once or twice a month to buy products. We repeat this process every mont…
This tutorial covers a practical example of lazy loading technique and early loading technique in a Singleton Design Pattern.
How to fix incompatible JVM issue while installing Eclipse While installing Eclipse in windows, got one error like above and unable to proceed with the installation. This video describes how to successfully install Eclipse. How to solve incompa…
Suggested Courses

719 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question