Search:

I need a bit of help proceeding to the coding part. I am trying to do a problem of solid waste collection vehicle routing using Genetic algorithm in C++. So here raises the question why should I use...

...can you name some?? some algorithms that would travel through all the given points and also optimise the cost of travel ?

So which is better....to find the Hamiltonian path for the network or to use the branch and bound algorithms to find the path?? Which one guarantees of finding a proper path that visits every vertex...

Thanks for the reply... so when such situation arrives then how to proceed further again?? Will it be able to give a solution if we proceed in the way that you mentioned or is it going to be trapped...

i need to a coding in C++.I am trying to do problem in which i have numbers of points. Now i need to find the path that goes through all the points. This is not actually TSP because as per my...

Means i should call srand outside the for loop?? How do i avoid having the zeros in the random number?? I just need the number among 1 to 5.

My problem goes something like this. I have a variable of 5 arrays a[5] for storing the 5nodes of a network. The network is randomly formed by the random number generator. I have the time of travel...

for (int j=1;j<=5;j++)
{
for (int i=1;i<=5;i++)
{
srand (i);
printf ("First number: %d\n", rand() % 5);
}
printf ("\n");
}...

Please explain me a bit more about it...i am really getting so confused..i am just a beginner in C++ :) Its only been few months that i am trying to learn it.

I want to have the random numbers between 1 to 5 for a variable of 5arrays. for having the random numbers i am using the code as below.

for(int i=1;i<=5;i++)
{ int j=rand()%5;
...