.png){kind=icon}
.png){kind=icon}
Return
Transgenetic algorithm for the Traveling Purchaser Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.10.027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper an evolutionary algorithm is presented for the Traveling Purchaser Problem, an important variation of the Traveling Salesman Problem. The evolutionary approach proposed in this paper is called transgenetic algorithm. It is inspired on two significant evolutionary driving forces: horizontal gene transfer and endosymbiosis. The performance of the algorithm proposed for the investigated problem is compared with other recent works presented in the literature. Computational experiments show that the proposed approach is very effective for the investigated problem with 17 and 9 new best solutions reported for capacitated and uncapacitated instances, respectively. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Combinatorial optimization
Traveling Purchaser Problem
Evolutionary algorithm
Transgenetic algorithm
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W