A k-parallel row
sorting problem solving method considering multiple channels relates to the technical field of disassembly line
layout, and mainly comprises the following steps: determining an objective function, calculating channel coordinate information in a region, generating a
population P1 and randomly generating a
population P2 by using a greedy strategy, combining the
population P1 and the population P2 into an initial population P, calculating the fitness of all solutions in the initial population, and obtaining a k-parallel row
sorting problem; screening an elite solution, selecting solutions except the elite solution in the initial
population based on the fitness by using a roulette mechanism to execute genetic circulation, sequentially carrying out
crossover and
mutation operation based on Q-learning, combining the population with the elite solution after
mutation with the population P1 and the population P2 to update the population, according to the maximum number of iterations, it is judged that iterative calculation continues or a result is output; according to the
variable domain genetic algorithm based on Q-learning, an optimal solution for solving kPROPP can be provided in a short time, the solving efficiency of the
variable domain genetic algorithm is greatly superior to that of a conventional accurate
solver, the solving effect of the
variable domain genetic algorithm is superior to that of other methods, and reliable support is provided for solving the problem of parallel
layout planning.