Current research on multi-AGV task scheduling mainly focuses on minimizing the total running time of multiple AGVs, with less consideration for issues such as AGV wear and cost balancing. This paper proposes a multi-AGV task scheduling optimization method that considers not only the total running time, but also the maximum running time of individual AGVs. The method aims to ensure high overall operational efficiency while improving AGV wear and cost imbalance issues. The method is based on an improved double-chromosome genetic algorithm (IDCGA), adopting a double-layer encoding structure with task chromosomes and AGV chromosomes, and designing an optimized greedy search strategy and population destruction-reconstruction strategy to avoid being trapped in local optima. To improve the computation speed, parallel computing is also employed to accelerate the IDCGA algorithm. Simulation experiments show that when the weight coefficient w is set to 0.9, the method not only has good robustness, but also the fastest computation speed. The simulation experiments also verify that the IDCGA algorithm can obtain better results, with faster running speed and better robustness, compared to the traditional genetic algorithm (GA).
|