ROUTE FIRST-CLUSTER SECOND METHOD FOR PERSONAL SERVICE ROUTING PROBLEM

  • MELİKE KÜBRA EKİZ
    Departman of Industrial Engineering, University of Kocaeli, Kocaeli, 41001, Turkey
  • MUHAMMET BOZDEMİR
    Department of Industrial Engineering, Konya Technical University, Konya, 42250, Turkey
  • BURCU OZCAN TÜRKKAN
    Departman of Industrial Engineering, University of Kocaeli, Kocaeli, 41001, Turkey

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.

Cuvinte cheie

vehicle routing problem clustering methods service routing problem