I have a question that several cars set out from a center point and then each goes through some points, at last they must come back to the original center point. At this case the subgroups should have a common point (the center point). The optimization goal is also balanced load, that is the cars have as the same running distance as possible. I want to know how to refine the algorithm to adapt to this condition?
I have a question that several cars set out from a center point and then each goes through some points, at last they must come back to the original center point. At this case the subgroups should have a common point (the center point). The optimization goal is also balanced load, that is the cars have as the same running distance as possible. I want to know how to refine the algorithm to adapt to this condition?