Nondominated Sorting Differential Evolution Algorithm to Solve the Biobjective Multi-AGV Routing Problem in Hazardous Chemicals Warehouse

For the multiple automated guided vehicle (multi-AGV) routing problems in warehousing link of logistics, where optimization objective is to minimize both number AGVs used and maximum pickup time simultaneously, a nondominant sorting differential evolution (NSDE) algorithm proposed. In encoding decoding stages, point area divided. are allocated each region according proposed rule based on avoiding duplicate paths. Meanwhile, points within can be adjusted optimize paths improve efficiency. The fast nondominated method elitist selection strategy genetic II (NSGA-II) introduced into algorithm, which sorts all regions obtain best Pareto solution set. Lastly, domination NSDE frontier evaluation indicators verified by some numerical experiments.