3:𝑝←∅4:%构建th具有独特任务5的部分路线5:for𝑘= 1:𝑁= do 6:𝑁𝑁练习6:𝑟𝑟←{0}%使用任务0 7:while 7:while𝐸𝐸𝐸≠do 8:从𝐸9:插入任务𝑖𝑘𝑘𝑘𝑖𝑖𝑖9: end while 12: 𝑝←𝑝∪{𝑟 𝑘 } 13: end for 14: % Dispatch the common tasks 𝐶\{0} among 𝑁 𝐹 partial routes 15 𝐶 ′ ←𝐶\{0} 16: while 𝐶 ′ ≠∅ do 17: Randomly select task 𝑗 from 𝐶 ′ 18: Insert task 𝑗 into route 𝑝 with total minimal distance increase 19: Remove task 𝑗 from 𝐶 '20:结束时21:返回𝑝329