The Greedy Permuting Method (GPM) is a method introduced for initial population generation in the Genetic Algorithm (GA). For a test problem with 280 cities, the generated initial population can reach ...

This algorithm use a greedy algorithm (similar to Prim's algorithm) to find the Minimum Spanning Tree (MST) of the input gragh and then Performs a depth-first traversal of the MST to generate a ...