Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Direct Representation and Variation Operators for the Fixed Charge Transportation Problem
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
On a property analysis of representations for spanning tree problems
EA'05 Proceedings of the 7th international conference on Artificial Evolution
A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem
Computers and Operations Research
| Hi-index | 0.00 |
In the past years several evolutionary algorithms have been applied to the fixed charge transportation problem (FCTP). Although suffering from a lack of locality, the Prüfer number representation has recently been suggested for the FCTP, and - to our surprise - it has been reported to yield good results. Since this disagrees with the common intuition that locality is an important prerequisite of successful evolutionary search, we analyse the Prüfer number representation in greater detail. The results show that the Prüfer number representation is superior to random search but clearly inferior to the permutation representation with respect to solution quality, which is explained by our locality analysis.