Abstract

The Vehicle Routing Problem (VRP), which has many sub-branches, is a difficult problem that cannot be solved using classical methods. This study includes a case study for Service Routing Problem, which is one of the sub-branches of VRP. The case study is a problem of determining service routes for staffs of a company. In this context, we first assigned the employees to the stations, and then we reached a solution using the route first-cluster second heuristic method. We used the Genetic Algorithm (GA) to improve the route and compared the results by creating different scenarios in clustering methods.

Authors and Affiliations