Hybrid Particle Swarm Optimization and Simulated Annealing for Capacitated Vehicle Routing Problem

摘要

Distribution is one of the supply management activity that requires special attention in order to delivering the company's products appropriately to consumers with a optimal route to minimalize cost and increase profit of the company. To minimalize distribution costs, companies must plan the right route pattern so that the distance traveled by the vehicle in the distribution process is minimal. In this study, we will use meta-heuristic method to find optimal solution for finding optimal solution to solving one of vehicle routing problem with capacity constrain, namely Capacitated Vehicle Routing Problem (CVRP) which are one of complex combinatorial optimization problems. This study proposes Hybridization of Particle Swarm Optimization and Simulated Annealing to find route pattern in order to get best minimal distance. Hybridization is carried out because PSO and SA had and advantages and weakness in exploration and exploitation capability for finding optimal solution. In this study, a comparison between PSO and SA without hybridization and hybridization will be presented, so that it can be compared to the method that has the best solution an based on the result, Hybrid of PSO and SA can provide the best optimal solution.