New project, Travelling salesman problem[need help]
-
- Posts: 18
- Joined: July 10th, 2012, 6:55 pm
New project, Travelling salesman problem[need help]
There is a million pounds award to someone who can solve this problem. I want to solve it and I think I can do it by using Genetic Programming and studying Ants.
I need to do this:
1. Add weights to the random lines.
2. Add a player who can only move using the lines.
3. Make it so the player can't travel to a circle only once.
I need to make it so you can only move between lines. Plus I need to start thinking how I am going to code the AI. I suppose I should get reading the Modern Artificial Intelligence book.
Also, has anyone wrote a genetic algorithm in this framework. As I would like to look at one.
I need to do this:
1. Add weights to the random lines.
2. Add a player who can only move using the lines.
3. Make it so the player can't travel to a circle only once.
I need to make it so you can only move between lines. Plus I need to start thinking how I am going to code the AI. I suppose I should get reading the Modern Artificial Intelligence book.
Also, has anyone wrote a genetic algorithm in this framework. As I would like to look at one.
- Attachments
-
- TSP2.rar
- (34.53 KiB) Downloaded 241 times
Last edited by simplicity on August 1st, 2012, 12:11 pm, edited 4 times in total.
Re: New project, Travelling salesman problem[need help]
Offered by who? : -PThere is a million pounds award to someone who can solve this problem.
I doubt something will be that easy to do, if someone were really going to give out a million for such a thing.
ʕ •ᴥ•ʔ
-
- Posts: 18
- Joined: July 10th, 2012, 6:55 pm
Re: New project, Travelling salesman problem[need help]
Clay Math institute.LuX wrote:Offered by who? : -PThere is a million pounds award to someone who can solve this problem.
I doubt something will be that easy to do, if someone were really going to give out a million for such a thing.
This is assuming that P=NP.
Hey Lux you doing the next AI challenge?
Re: New project, Travelling salesman problem[need help]
hey there,
I know a bit about ants from my algorithms and datastructures class
at uni. i dont really see however how ants could get you anywhere close
to the dynammic programming order of complexity O( 2^n x n^2 ), havent
looked at the attached code yet so far. (the problem with genetic programming
being ofc that the occurance of a random solution ( optimal ) is obviously not
guaranteed.
but good luck anyway dude, ill be interested in seeing how far you get, as ive
been a huuuge fan of ants since i first learned about them
I know a bit about ants from my algorithms and datastructures class
at uni. i dont really see however how ants could get you anywhere close
to the dynammic programming order of complexity O( 2^n x n^2 ), havent
looked at the attached code yet so far. (the problem with genetic programming
being ofc that the occurance of a random solution ( optimal ) is obviously not
guaranteed.
but good luck anyway dude, ill be interested in seeing how far you get, as ive
been a huuuge fan of ants since i first learned about them
Re: New project, Travelling salesman problem[need help]
Hmmm, I would think that ACO and GA are generally mutually exclusive alternatives to each other. How do you propose to implement a system using both of them together?
Chili
Re: New project, Travelling salesman problem[need help]
Who else thought of a transistor when seeing P=NP ... LOLsimplicity wrote:Clay Math institute.LuX wrote:Offered by who? : -PThere is a million pounds award to someone who can solve this problem.
I doubt something will be that easy to do, if someone were really going to give out a million for such a thing.
This is assuming that P=NP.
Hey Lux you doing the next AI challenge?
- viruskiller
- Posts: 399
- Joined: June 14th, 2012, 5:07 pm
Re: New project, Travelling salesman problem[need help]
i wish i could get a better explanation of the problem to be solved:/ ,and what is ant's?
Re: New project, Travelling salesman problem[need help]
Hi viruskiller,
Ants are little six legged creatures with a sugar fixation.
There was a movie made about them a while ago.
Also I played the game Ants on the spectrum. Where you had to rescue the girl from the ants.
I am sure one of these answers will help you.
Asimov
Ants are little six legged creatures with a sugar fixation.
There was a movie made about them a while ago.
Also I played the game Ants on the spectrum. Where you had to rescue the girl from the ants.
I am sure one of these answers will help you.
Asimov
----> Asimov
"You know no matter how much I think I have learnt. I always end up hitting brick walls"
http://www.asimoventerprises.co.uk
"You know no matter how much I think I have learnt. I always end up hitting brick walls"
http://www.asimoventerprises.co.uk
Re: New project, Travelling salesman problem[need help]
Anyone here play SimAnt? I used to rent that game for the SNES from a local video rental store called LaserTek. Good times.
Chili
Re: New project, Travelling salesman problem[need help]
----> Asimov
"You know no matter how much I think I have learnt. I always end up hitting brick walls"
http://www.asimoventerprises.co.uk
"You know no matter how much I think I have learnt. I always end up hitting brick walls"
http://www.asimoventerprises.co.uk