After yesterday's discussions and gather information on D we have a deeper understanding of the question, consider some things yesterday is not reasonable, so we developed a program again. Before considering to use ant colony algorithm, here to tell you about the science ant colony algorithm:
ant colony algorithm that white is the shortest path problem, similar to a place you travel, you want in the shortest path, as much more than browsing design of the shortest path attractions.
"Save the Louvre" The problem is that different Louvre has multiple outlets, rather than a single export, so we need to improve on this single export problem, design a new algorithm for more than one outlet. This is something we tangled yesterday afternoon, also find a lot of code to simulate the ant colony algorithm, finally, we intend to give up, no way hey. Their limited ability, it can not handle this. Of course then, if there are relatively large Niubi oh god you can try this idea!
Today we intend to write the first question, the second question, which is the shortest path problem and tourists fled the problem. His teammates to find some solutions (hee hee hee), really fortunate to have thigh teammates.
When all the tourists have come to exports, this time we can be compared queuing problem, after all, when so many people to flee, we can not line up one after another out, so, this is an idealized model, on this issues, programming will be a small partner can engage in a practice Oh, knocked the code, perhaps the problem is solved.
Well, I say no more, the good do their own problems.
Special Note:
The above are personal thoughts, only for reference, I do not discuss participation! ! !
