This study will solve the classical vehicle routing problem, goal is to generate k trips with shortest distance for h customers predetermined locations and needs.. The proposed solution problem a hybrid sine cosine algorithm. algorithm hybridized grey wolf optimizer, which used in combination methods of tournament selection, opposition learning, mutation crossover method build optimal plan mean...