Vehicle routing problem with simulated annealing using python programming

Abstract

Vehicle Routing Problems (VRP) are a type of linear programming problem. This paper tries to explain the completion of VRP using Python Programming with the Simulated Annealing algorithm. Python Programming is used as a tool by utilizing the wealth of packages in python. Python is a popular programming language. Python is easy to learn for beginners. However, there is still no example and guide for solving VRP using simulated annealing in python programming with a process paradigm. This design can be a reference and guide for beginners in dealing with similar problems or the development of existing problems.