|
That doesn't really sound like an ideal problem for a GA to me, unless what you're evolving is the metadata that seeds the algorithm that chooses which ships to take next. Too many of the mutations or crossovers will result in invalid parking configurations if you're trying to map genes directly to ships.
A GA is generally a tradeoff between variety and speed. You can make it go faster by having a smaller population, or by stronger selection pressure (more brutally killing off lower fitness solutions), but in either case you are reducing the gene pool and might therefore miss the variety you need to jump out of a local minimum.
|
|
|
|
|
Free Laptop for 4 months directly to your home. Just enter your postal code to see if you qualify and provide your shipping information here https://www.freeaaronslaptop.com/
|
|
|
|
|
Firo Atrum Ventus wrote: what should I named it with
While I can't help you with the GA question, sorry, I do have long experience creating names for technical products, designing logos, and designing and writing technical copy for oem's, vars, developers, and end-users, etc.
My suggestions for the name of your "docking optimizer" are:
DockRight
RightDock
DockRite
RiteDock
DockSnug
SnugDock
PentaDock
 => absurd category :
RockinDockin
DockSnuggler
SnuggleUpRight
In all of the above, consider omitting the letter "k" from "dock."
best, Bill
"I have always wished for my computer to be as easy to use as my telephone; my wish has come true because I can no longer figure out how to use my telephone." Bjarne Stroustrop circa 1990
|
|
|
|
|
I have a datatable like below
<pre lang="text">
Employee Salary
--------------------------
Emp A 1000
Emp B 500
Emp C 3000
Emp D 3000
Emp E 200
Emp F 100
Emp G 200
Emp H 500
Emp I 1450</pre>
I want minimum number of groups, Sum of Salary in one group should not exceed 5000. So my final output should be like this
<pre lang="text">
Employee Salary Group
-------------------------------------
Emp A 1000 Group 1
Emp B 500 Group 1
Emp C 3000 Group 1
Emp E 200 Group 1
Emp F 100 Group 1
Emp G 200 Group 1
Emp D 3000 Group 2
Emp H 500 Group 2
Emp I 1450 Group 2
</pre>
|
|
|
|
|
This question was already posted in Q&A[^]; please post in one location only.
0100000101101110011001000111001011101001
|
|
|
|
|
|
I want implement polygon in c# using visual studio.Its one task of Google map part of my project.plz guide me.I have already done in c programing language using graphics function,is this similar for C#???
|
|
|
|
|
|
WITH OUT STATIC IP REMOTE COMPUTER USING PROGRAM FOR VB.NET
|
|
|
|
|
1) Please don't shout
2) Submit a specific problem, expose what you have done, what you expect and what you actually get.
Again, this forum is not here to do your work ; it is here to help on specific subjects/problems.
If you don't take the time to analyze your requirements by yourself, how do you expect we will do it for you ?
modified 7-Oct-11 6:33am.
|
|
|
|
|
i have always thought VB programmers are slightly Dim 
|
|
|
|
|
Hello Everybody,
I have a network and I want to find diffrent and multiple paths in this network.
I have try dfs ,bfs, aco but still they are getting only one solution.
so pls help.
Thanks
If you can think then I Can.
|
|
|
|
|
Then there is only one solution, or an error in your algorithms. DFS and BFS, if run to completion, will find all the paths.
|
|
|
|
|
how to write codings for sram by using enhanced canary based system for power reduction
|
|
|
|
|
|
Possibly by reading some of the journals listed here[^].
|
|
|
|
|
Wibble hatstand?
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
|
how to write c codings for ant colony algorithm by using floorplanning
|
|
|
|
|
You could start by checking out Google.[^]
It's truly amazing what information can be found.
I wasn't, now I am, then I won't be anymore.
|
|
|
|
|
Hello Experts,
I have a road map where i have a starting point A and Destination Point Z. There are multiple ways From A to Z.
Then How can i Get How many Number of Possibilities to Move from A to Z.
Thanks
If you can think then I Can.
|
|
|
|
|
This is a well-explored problem in graph theory. Google for something like 'number of paths in graph'. That should get you lots of references ranging from trivial to PhD material.
Cheers,
Peter
Software rusts. Simon Stephenson, ca 1994.
|
|
|
|
|
|
Without your being more specific about your goals, and the problem, I don't think much can be said.
Most real-world examples of combinatorial optimization have constraints ... without which you have potentially infinite recursion.
For example ... assuming by "road map" you mean, literally, a map of highways, streets ... you would certainly not want to find combinations that are possible, but that involve doubling-back and repeating segments of the journey.
Are you trying to determine the shortest possible route ?
You may want to look at the infamous "travelling salesman" problem[^], where an attempt is made to find the shortest route which passes once through each city of a list of cities.
best, Bill
"Is it a fact - or have I dreamt it - that, by means of electricity, the world of matter has become a great nerve, vibrating thousands of miles in a breathless point of time? Rather, the round globe is a vast head, a brain, instinct with intelligence!" - Nathanial Hawthorne, House of the Seven Gables
|
|
|
|
|
Hi,
this is my first post on this forum.
First a Short intro to the Self Organizing Map
A Self Organizing Map (SOM) ,-sometimes called a Kohonen network-, maps multidimensional data onto a two dimensional map. A classic example is to classify colors by the Red, green and Blue (RGB) values. So if we have a large (10 000) set of randomly chosen colors, with different shades of, greens, reds, blues, pinks, etc. the SOM can map them on a 2-dimensional map where similar colors tend to end up on the same node on the map. If we chose a map with the dimensions 5 by 5 we get a map with 25 nodes. As an example the pink shades might end up in one corner of the map close to violet shades and the violets close to blue shades and so on. So similar colors tend to be close to each other. So if we wanted to classify those 10 000 colors in our dataset into 25 classes we could look at each colors node and use the information to se what class each of the colors belong to.
But how can we create clusters of several nodes based on their similarity to each other?
modified on Thursday, August 18, 2011 9:19 AM
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
