Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Graph coloring for determining courier frequency

View through CrossRef
The exponential growth of online transactions in Indonesia has intensified the competition among courier service providers to ensure efficient goods delivery, prompting the need for exceptional performance. However, this surge has also brought forth various challenges, including imbalanced courier allocation, intricate delivery routes, and sprawling coverage areas, resulting in delays and extended working hours for couriers. This research, conducted in Jakarta, centers on a logistics and courier service company grappling with a critical courier shortage, leading to overburdened personnel and extended work hours. To address this issue, we employed graph coloring, rooted in graph theory, as a novel approach to determine the ideal number of couriers based on the route and delivery area. Through graph coloring, delivery routes, and areas can be optimized so that each courier has the same average route length and area and does not exceed the threshold limit set by the company. The number of delivery routes and areas generated from graph coloring shows the number of couriers required for the company. The results of this research obtained 27 routes that show the need for the ideal courier frequency so that the delivery of goods can be on time without extending the courier's working hours.
Title: Graph coloring for determining courier frequency
Description:
The exponential growth of online transactions in Indonesia has intensified the competition among courier service providers to ensure efficient goods delivery, prompting the need for exceptional performance.
However, this surge has also brought forth various challenges, including imbalanced courier allocation, intricate delivery routes, and sprawling coverage areas, resulting in delays and extended working hours for couriers.
This research, conducted in Jakarta, centers on a logistics and courier service company grappling with a critical courier shortage, leading to overburdened personnel and extended work hours.
To address this issue, we employed graph coloring, rooted in graph theory, as a novel approach to determine the ideal number of couriers based on the route and delivery area.
Through graph coloring, delivery routes, and areas can be optimized so that each courier has the same average route length and area and does not exceed the threshold limit set by the company.
The number of delivery routes and areas generated from graph coloring shows the number of couriers required for the company.
The results of this research obtained 27 routes that show the need for the ideal courier frequency so that the delivery of goods can be on time without extending the courier's working hours.

Related Results

Efficiency of Courier Service Companies in Malaysia Using Data Envelopment Analysis (DEA) Models
Efficiency of Courier Service Companies in Malaysia Using Data Envelopment Analysis (DEA) Models
  Many organisations in the service industry encounter the issue of unequal efficiency results. Many large corporations, such as banks, hotels and courier companies, are concerned...
Determinants of Courier Service Quality in e-Commerce from Customers’ Perspective
Determinants of Courier Service Quality in e-Commerce from Customers’ Perspective
Purpose: In recent years, the increasing popularity of e-commerce has become a driving force behind the development of courier service both in Poland and worldwide. In order to fac...
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Objective: To determine the frequency of common chromosomal aberrations in local population idiopathic determine the frequency of common chromosomal aberrations in local population...
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from the set of vertices in G to the set of colors such that every two adjacent vertices have d...
Development of android-based apps for courier service management
Development of android-based apps for courier service management
E-commerce has grown exponentially over the years. The growth has been characterized by strong consumer demands and the increasing number of various products available online. This...
Graph Coloring
Graph Coloring
In this chapter a particular type of graph labeling, called graph coloring, is introduced and discussed. In the first part, the simple type of coloring, vertex coloring, is focused...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...

Back to Top