Route First-Cluster Second Method for Personal Service Routing Problem

relationships.isProjectOf

relationships.isJournalIssueOf

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.

Description

Keywords

Genetic Algorithm, Heuristic, Vehicle Routing Problem, Cluster Analysis, Computer Science, Technology, T, clustering methods, vehicle routing problem, service routing problem, TA1-2040, Engineering (General). Civil engineering (General)

Fields of Science

0211 other engineering and technologies, 02 engineering and technology

Citation

WoS Q

Scopus Q

OpenCitations Logo
OpenCitations Citation Count
8

Volume

25

Issue

2

Start Page

18

End Page

24
PlumX Metrics
Captures

Mendeley Readers : 8

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
0.19