The cooperative algorithm with auxiliary objectives for the truck and trailer routing problem

Abstrak

In this paper, a cooperative algorithm with auxiliary objectives is proposed to resolve the truck and trailer routing problem. In this proposal, each member of the population does not represent a complete solution as in almost any evolutionary algorithm. In addition, for each member, an aptitude is not possible to compute based only on its codification, because the member has only partial information of the solution. All the members of the population have partial information of the solution. Therefore, these members need to cooperate to obtain an aptitude for the entire population. This way of computing fitness is clearly a gap in the literature, and must be investigated. Moreover, the multi-objectivization approach incorporates an important feature to the proposed algorithm in order to improve its performance, i.e., the multi-objectivization approach permits to identify the best trips using the auxiliary objectives. Enough experimental results are shown that the cooperative algorithm is competitive against other current evolutionary algorithms. There no exist statistically significant difference between the cooperative algorithm and the others.