A Cooperative Algorithm to Tackle the Truck and Trailer Routing Problem

Resumen

In this paper, we proposed a cooperativealgorithm to resolve the truck and trailer routing problem.In this proposal, each member of the population doesnot represent a complete solution as in almost anyevolutionary algorithm. In addition, for each member,an aptitude is not possible to compute based onlyon its codification, because the member has onlypartial information of the solution. All the members ofthe population have partial information of the solution.Therefore, these members need to cooperate to obtainan aptitude for the entire population. Although diversemethods and strategies have been used to solve theTTRP, this paper contributes to the state of the artby the use of the idea of absence of recombination.We adopt the idea of no communication amongmembers of the population. This way of computingfitness is clearly a gap in the literature, and mustbe investigated.Enough experimental results areshown that the cooperative algorithm is competitiveagainst other current evolutionary algorithms. Thereno exist statistically significant difference between thecooperative algorithm and the others. It means that theCoopA is a new approach to continue developing.