Technical report: simulated annealing for vehicle routing problem / Amy Nasuha Johan and Nurul Shahira Jamaludin

This thesis will concentrate on a very interesting problem, which is Vehicle Routing Problem (VRP). The basic VRP is concerned with finding efficient routes for a fleet of vehicles which have to service a specified number of retail outlets from a central depot. On the other hand, in transportation network, the nodes represent origins and destinations as well as intersections. Travelers or users of the transportation networks seek, in the case of user-optimization, to determine their cost-minimizing routes of travel. Our objective is to design a set of least cost vehicle routes for a given set of customer requirements. In this paper, we present a Simulated Annealing algorithm (SA) to deal with this problem.