int main(int argc,char ** argv){
int * visitado,otimo;
Tour pop[TAMPOP], * melhor;
struct tms before,after;
if(argc != 3){
printf("USO : %s 'instancia' 'otimo' \n\n",argv[0]);
return 1;
}
otimo = atoi(argv[2]);
times(&before);
read(argv[1],d,n);
visitado = new_int(n);
init_int(visitado,n);
pop[0] = rand_tour();
pop[1] = rand_tour();
createSet();
LinKernighan(pop[0]);
LinKernighan(pop[1]);
pop[2] = new_tour(); pop[2]->c = new_int(n); pop[2]->pos = new_int(n);
pop[3] = new_tour(); pop[3]->c = new_int(n); pop[3]->pos = new_int(n);
PMX(pop[2],pop[3],pop[0],pop[1]);
LinKernighan(pop[2]);
LinKernighan(pop[3]);
printf("PAI 1 : \n");
print_tour(pop[0]);
printf("PAI 2 : \n");
print_tour(pop[1]);
printf("FILHO 1 : \n");
print_tour(pop[2]);
printf("FILHO 2 : \n");
print_tour(pop[3]);
melhor = &pop[0];
//print_tour(melhor);
times(&after);
double tempo = (double)(after.tms_utime - before.tms_utime)/(double)100;
double gap = ((double)((*(melhor))->cost-otimo)/(double) otimo) * 100.0;
printf("%s\t%.2lfs\t%d\t%d\t%.3lf\n",argv[1],tempo,otimo,(*(melhor))->cost,gap);
//printf("System time: %ld seconds\n", after.tms_stime - before.tms_stime);
return 0;
}
GainType LKH::LKHAlg::FindTour()
{
GainType Cost;
Node *t;
int i;
double EntryTime = GetTime();
if(!OrdinalTourCost.get())
OrdinalTourCost.reset(new GainType(0));
t = FirstNode;
do
t->OldPred = t->OldSuc = t->NextBestSuc = t->BestSuc = 0;
while ((t = t->Suc) != FirstNode);
if (Run == 1 && Dimension == DimensionSaved) {
*OrdinalTourCost = 0;
for (i = 1; i < Dimension; i++)
*OrdinalTourCost += (this->*C)(&NodeSet[i], &NodeSet[i + 1])
- NodeSet[i].Pi - NodeSet[i + 1].Pi;
*OrdinalTourCost += (this->*C)(&NodeSet[Dimension], &NodeSet[1])
- NodeSet[Dimension].Pi - NodeSet[1].Pi;
*OrdinalTourCost /= Precision;
}
BetterCost = PLUS_INFINITY;
if (MaxTrials > 0)
HashInitialize(HTable);
else {
Trial = 1;
ChooseInitialTour();
}
for (Trial = 1; Trial <= MaxTrials; Trial++) {
if (GetTime() - EntryTime >= TimeLimit) {
if (TraceLevel >= 1)
printff("*** Time limit exceeded ***\n");
break;
}
/* Choose FirstNode at random */
if (Dimension == DimensionSaved)
FirstNode = &NodeSet[1 + Random() % Dimension];
else
for (i = Random() % Dimension; i > 0; i--)
FirstNode = FirstNode->Suc;
ChooseInitialTour();
Cost = LinKernighan();
if (FirstNode->BestSuc) {
/* Merge tour with current best tour */
t = FirstNode;
while ((t = t->Next = t->BestSuc) != FirstNode);
Cost = MergeWithTour();
}
if (Dimension == DimensionSaved && Cost >= *OrdinalTourCost &&
BetterCost > *OrdinalTourCost) {
/* Merge tour with ordinal tour */
for (i = 1; i < Dimension; i++)
NodeSet[i].Next = &NodeSet[i + 1];
NodeSet[Dimension].Next = &NodeSet[1];
Cost = MergeWithTour();
}
if (Cost < BetterCost) {
if (TraceLevel >= 1) {
/* printff("* %d: Cost = " GainFormat, Trial, Cost);
if (Optimum != MINUS_INFINITY && Optimum != 0)
printff(", Gap = %0.4f%%",
100.0 * (Cost - Optimum) / Optimum);
printff(", Time = %0.2f sec. %s\n",
fabs(GetTime() - EntryTime),
Cost < Optimum ? "<" : Cost == Optimum ? "=" : ""); */
}
BetterCost = Cost;
RecordBetterTour();
if (Dimension == DimensionSaved && BetterCost < BestCost)
WriteTour(OutputTourFileName, BetterTour, BetterCost);
if (StopAtOptimum && BetterCost == Optimum)
break;
AdjustCandidateSet();
HashInitialize(HTable);
HashInsert(HTable, Hash, Cost);
} else if (TraceLevel >= 2)
printff(" %d: Cost = " GainFormat ", Time = %0.2f sec.\n",
Trial, Cost, fabs(GetTime() - EntryTime));
/* Record backbones if wanted */
if (Trial <= BackboneTrials && BackboneTrials < MaxTrials) {
SwapCandidateSets(this);
AdjustCandidateSet();
if (Trial == BackboneTrials) {
if (TraceLevel >= 1) {
printff("# %d: Backbone candidates ->\n", Trial);
CandidateReport();
}
} else
SwapCandidateSets(this);
}
}
if (BackboneTrials > 0 && BackboneTrials < MaxTrials) {
if (Trial > BackboneTrials ||
(Trial == BackboneTrials &&
(!StopAtOptimum || BetterCost != Optimum)))
SwapCandidateSets(this);
t = FirstNode;
do {
free(t->BackboneCandidateSet);
t->BackboneCandidateSet = 0;
} while ((t = t->Suc) != FirstNode);
}
t = FirstNode;
if (Norm == 0) {
do
t = t->BestSuc = t->Suc;
while (t != FirstNode);
}
do
(t->Suc = t->BestSuc)->Pred = t;
while ((t = t->BestSuc) != FirstNode);
if (Trial > MaxTrials)
Trial = MaxTrials;
ResetCandidateSet();
return BetterCost;
}
