Lập kế hoạch định tuyến cho các xe vận chuyển xi măng sử dụng thuật toán tối ưu sine cosine

Abstract

In the classical Vehicle Routing Prolem (VRP), which is an extended version of the Traveling Salesman Prolem (TSP), the objective is to generate a set of k trips for h customers whose locations and demands are predetermined in the shortest distance or at minimum cost. Each vehicle starts and stops at the same location and satisfies some associated constraints. There are many ways to solve this VRP problem such as using Linear Programming, Genetic Algorithm (GA), Double Population Genetic Algorithm (DPGA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Modified Hybrid Particle Swarm Optimization ( MHPSO), Dragon Fly (DA), etc. This paper proposes an optimal cement transport vehicle routing plan by using the Sine Cosine algorithm (SCA)  the search time is shortened and more Optimum results are given. A reasonable travel plan for the vehicles is made based on the needs of each store, the vehicle capacity and the distance to the stores. In order to prove the advantages of the  Sine Cosine (SCA) algorithm, the paper uses a specific model of case studies and compares them with other algorithms (SGA, DPSGA, PSO, DA, MHPSO, ALO, etc.). The results show that the solution of using the  Sine Cosine algorithm is more optimal thanks to its balancing exploitation and exploration. On this basis, managers are suggested to make the right decisions in choosing the path and expanding their investments.