Cement Transport Vehicle Routing with a Hybrid Sine Cosine Optimization Algorithm
Vu Hong Son Pham, Nguyễn Văn Nam
Abstract
This study will solve the classical vehicle routing problem, the goal is to generate k trips with the shortest distance for h customers with predetermined locations and needs.. The proposed solution to the classical vehicle routing problem is a hybrid sine cosine algorithm. The sine cosine algorithm is hybridized with the grey wolf optimizer, which is used in combination with the methods of tournament selection, opposition learning, and the mutation and crossover method to build the optimal routing plan for the means of transporting cement. To demonstrate the advantages of the developed hybrid sine cosine algorithm, this algorithm is evaluated and compared with modern algorithms such as sine cosine algorithm, dragonfly algorithm, grey wolf optimizer, ant lion optimizer, particle swarm optimization, modified hybrid particle swarm optimization, genetic algorithm, and the double-population genetic algorithm in case studies. The hybrid sine cos algorithm gives optimal results in these cases because it balances mining and exploration. Thus, the results of this study indicate that managers can use the developed hybrid sine cosine algorithm to create optimal vehicle routing plans to reduce transportation distances.