scholarly journals AN IMPROVED SIMULATED ANNEALING FOR THE CAPACITATED VEHICLE ROUTING PROBLEM (CVRP)

Kursor ◽  
2019 ◽  
Vol 9 (3) ◽  
pp. 117 ◽  
Author(s):  
Farhanna Mari ◽  
Wayan Firdaus Mahmudy ◽  
Purnomo Budi Santoso
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimization Problems ◽  
Product Distribution ◽  
Industrial Sector ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

In the industrial sector, in order to increase the company's competitive profit and ratio, must be able to suppress as much expenditure as possible. Product distribution is one of the logistics processes in the industry which consumes the most costs. Products must be distributed to customers in different locations and also with varying requests. The problem belongs to Capacitated Vehicle Routing Problem (CVRP) that is considered as one of the complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem that requires difficult computation and a lot of time along with the increasing size of the problem data. So, in this study improvisation will be carried out in the form of modifying the simulated annealing method to solve the combinatorial problem so that the optimal distance in the case of distribution will be obtained. In addition, in this study a comparison will be made between basic simulated annealing and also improved simulated annealing. Based on the results of the research it is proven that Improved Simulated Annealing can provide a better solution.

scholarly journals Simultaneous Multi-Start Simulated Annealing for Capacitated Vehicle Routing Problem

2020 ◽  
Vol 8 ◽  
Author(s):  
Arman Davtyan ◽  
Suren Khachatryan
Keyword(s):  
Simulated Annealing ◽  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Superior Performance ◽  
Metaheuristic Algorithm ◽  
Optimal Solutions ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

A new metaheuristic algorithm is proposed for Capacitated Vehicle Routing Problem. CVRP is one of the fundamental problems in combinatorial optimization that deals with transport route minimization. The algorithm combines Simulated Annealing, multi-start and simultaneous computing techniques. A series of computational tests are conducted on several CVRP benchmarks and near-optimal solutions are obtained. The results indicate superior performance compared with Simulated Annealing

scholarly journals Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem

2020 ◽  
Author(s):  
Fernando Francisco Sandoya Sánchez ◽  
Carmen Andrea Letamendi Lazo ◽  
Fanny Yamel Sanabria Quiñónez
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Impact Analysis ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Economic Impact Analysis ◽  
Transportation Sector ◽  
Capacitated Vehicle

This chapter presents the best-known heuristics and metaheuristics that are applied to solve the capacitated vehicle routing problem (CVRP), which is the generalization of the TSP, in which the nodes are visited by more than one route. To find out which algorithm obtains better results, there are 30 test instances used, which are grouped into 3 sets of problems according to the position of the nodes. The study begins with an economic impact analysis of the transportation sector in companies, which represents up to 20% of the final cost of the product. This case study focuses on the CVRP for its acronym capacitated vehicle routing problem, analyzing the best-known heuristics such as Clarke & Wright and sweep, and the algorithms GRASP and simulated annealing metaheuristics based.

Sign in / Sign up

Export Citation Format

Share Document