Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises

Algorithm 3

DU-GA.

	Step 1: determine the population size , the crossover probability , the mutation probability , and the termination condition of the algorithm, followed by initializing the population (i.e., randomly generating individuals).
	Step 2: for each individual, apply algorithm CA-D. Evaluate fitness values of the chromosome and select two individuals as parents.
	Step 3: perform crossover and mutation operators on the selected parents to obtain offspring individuals.
	Step 4: update the population by adding the newly generated individuals to the population. Step 2 and Step 3 are repeated until the termination condition is met, and the iteration is stopped.
	Step 5: select the best solution from the current population, and let it be the input of algorithm LGP. Run algorithm LGP, and output the resulted solution.