|
HI,
i m transportation engg. M.Tech student.
my project is application of genetic algorithm for bus route network design. as i m not software engineer, it is dificult for me t prepare the code for GA. my main work is to apply the GA for bus network design.
if anybody can help me for this, i will be very much thankful.
HAVE A NICE DAY
|
|
|
|
|
Hi man,
if u get a solution for this , please mail me at karamcbose@yahoo.com
|
|
|
|
|
Pls, formalize your task with more details: street net complexity, number of projected routs, population density and distribution over a city and so on. Though the GA is very simple for realization, the information you have supplied is too poor.
P.S. Your post sounds like you don't know what you want.
|
|
|
|
|
dead_link wrote: P.S. Your post sounds like you don't know what you want.
I have to disagree. It's quite clear to me that both of htem want the answer to the same homework problem.
--
Rules of thumb should not be taken for the whole hand.
|
|
|
|
|
hi,
thanx for reply.
actually i m at starting stage, firstly i want to develope the GA code and then to apply it for small test network for checking the results.
i think matlab will be better option to solve GA.
i have downloded GA toolbox for matlab. i m learning it.
HAVE A NICE DAY
|
|
|
|
|
hi,
i m trying for that but to start from, i m not understanding whether to use matlab or c language.
what u r doing in this area?
mail me in detail, so that we both can do something together.
have a nice day
|
|
|
|
|
I have a set of strings (seach terms) and a data string, and I'm loking for the first occurence of one of the search terms in the data string.
(Brute force: try each string at each char, until one match is found O(n^2))
Modification:
I have a map(string org, string new) with string replacements, and a data string. In data, replace all occurences of "org" by "new".
(Brute force: assuming that org and new strings don't overlap, do a string.replacealloccurences(org,new) for each replacement pair)
Are there any better approaches than the brute force?
Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers! We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP Linkify!|Fold With Us!
|
|
|
|
|
Which language are you using ?
Blog Have I http:\\www.frankkerrigan.com
|
|
|
|
|
C++, but I'm more interested in the underlying algorithms.
Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers! We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP Linkify!|Fold With Us!
|
|
|
|
|
How about sorting the search terms so that if you had 5 terms starting with the same letter and only two from other letters and one of the other two is first, then you search for the first character first and then the word.
If you're only interested in the first occurrence of any search term, then starting with the word that begins with the most common letter is probably faster. You can probably use statistics (ugh!) to determine which word has the most common letters.
"Oh, what a tangled web we weave, when first we practice to deceive." - Sir Walter Scott
Web - Blog - RSS - Math - LinkedIn - BM
|
|
|
|
|
peterchen wrote: I have a map(string org, string new) with string replacements, and a data string. In data, replace all occurences of "org" by "new".
(Brute force: assuming that org and new strings don't overlap, do a string.replacealloccurences(org,new) for each replacement pair)
A way would be to do the replacements in the right order. If you have two pairs, and the "new" of the first one is the same as the "old" of the second, then you need to do the second replacement first, so the "new" values from the first don't get replaced. For n pairs a solution would look like this (in pseudocode):
for 0 to number of pairs
foreach pair of replacements in alreadyadded
if new pair."old" is the same as currentpair."new"
insert pair before currentpair and break loop
end
if not inserted yet insert at the end
end for
|
|
|
|
|
|
|
Boyer-Moore looks very clever! The site has some other interesting algorithms as well
Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers! We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP Linkify!|Fold With Us!
|
|
|
|
|
You can also use the Alfred V. Aho & Margaret J. Corasick search algorithm wich as a O(1)
I can send you a .cpp implentation if you like
|
|
|
|
|
Please help!
Need any fingerprint recognition algorithm realisation.
Thanks for any information.
|
|
|
|
|
Try Home land security... or HP...
Brad
Australian
I assume Microsoft would not use doors, because using Windows is faster.
|
|
|
|
|
You may find many of these are under patent
Blog Have I http:\\www.frankkerrigan.com
|
|
|
|
|
Frank Kerrigan wrote: You may find many of these are under patent
Yep. Come up with your own algorithm and patent it
If you try to write that in English, I might be able to understand more than a fraction of it. - Guffa
|
|
|
|
|
These algorithms are very difficult to come by mainly because they are still being researched. Many such algorithms have been developed but their development is usually a result of a research project which has been funded by some organisation. These organisations don't release the algorithms because they see the algorithm as an investment and would help them against their competition.
Sorry, but I don't think you will find one easily. If you do find any open source algorithms then they are probably quite complex and use machine learning techniques such as Neural Networks or Hidden Markov Models.
These algorithms fall under Image Processing/Signal Processing try doing searches within these areas.
The best times in life are the ones that you can't remeber!!!
|
|
|
|
|
when we are making a code our teacher make as first the algorithm bec. she say that it becomes easy when we have the algorithm. can you give me some examples of algorithm??
;)
thank you very much..
|
|
|
|
|
|
It's always easier to formulate your design on paper first before going to the keyboard. Remember that a computer cannot do anything that you can't already do with pencil and paper.
"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15
"Judge not by the eye but by the heart." - Native American Proverb
|
|
|
|
|
Does anyone have some quick example code for computing the union of two n-point polygons (or alternatively, an n-point polygon and a rectangle). I want what the Region class in the .NET framework does, but i need the actual points afterwards, which Region doesn't provide.
|
|
|
|
|