PROPOSED EFFICIENCY OF PACKAGE DISTRIBUTION ROUTES USING CLARKE & WRIGHT SAVINGS AND NEAREST NEIGHBOR ALGORITHM (CASE STUDY OF OUTGOING MAIL TO SECONDARY AREA AT PT. POS INDONESIA MAIL PROCESSING CENTER BANDUNG)
PT. Pos Indonesia (Persero) is a delivery service provider company that has a central distribution unit in the region of West Java, that is Mail Processing Center Bandung. MPC Bandung has a function to regulate the distribution of packages according to the coverage of the destination area, which...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/62331 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:62331 |
---|---|
spelling |
id-itb.:623312021-12-27T11:30:46ZPROPOSED EFFICIENCY OF PACKAGE DISTRIBUTION ROUTES USING CLARKE & WRIGHT SAVINGS AND NEAREST NEIGHBOR ALGORITHM (CASE STUDY OF OUTGOING MAIL TO SECONDARY AREA AT PT. POS INDONESIA MAIL PROCESSING CENTER BANDUNG) Murti Martikasari, Arida Indonesia Theses Vehicle Routing Problem, Clarke and Wright Savings Algorithm, Nearest Neighbor Algorithm INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/62331 PT. Pos Indonesia (Persero) is a delivery service provider company that has a central distribution unit in the region of West Java, that is Mail Processing Center Bandung. MPC Bandung has a function to regulate the distribution of packages according to the coverage of the destination area, which are delivery to primary area (provincial capital), secondary area (West Java) and tertiary area (Bandung). The company has a target to minimize transportation costs on shipping goods. The delivery process carried out by MPC Bandung can be modeled into the Vehicle Routing Problem (VRP), this research focuses on distribution routes efficiency of documents and packages to 12 destination post offices in the secondary region (West Java). Analysis was conducted using two classical heuristic methods, Clarke and Wright Savings (CAWSA) and Nearest Neighbor Algorithm (NNA) with the aim of obtaining a more optimal route proposal in order to minimize transportation costs. Data processing begins with calculating the distance and transportation costs of the existing route, then make a proposed route using the CAWSA and NNA methods with delivery time limits and vehicle capacity also calculate the travel distance, after that stage, the best proposed alternative route is selected and transportation costs are calculated and output comparisons are made : transportation costs for the selected proposed route and the existing route. The CAWSA and NNA methods each produce 4 alternative proposed routes where each alternative consists of 3 routes and has a different order of visits. Alternative 2 which is designed using the CAWSA heuristic method was chosen to be the best alternative that produces the shortest mileage output of 894.2 km per day with a savings of 54.11% on the existing route which has a total mileage of 1,948.7 km, this alternative was chosen as a proposed route improvement for the company. The transportation cost efficiency was obtained by 50.94% from Rp.115.546.200 for the existing route to Rp. 56,686,500 for the selected proposed route. text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
PT. Pos Indonesia (Persero) is a delivery service provider company that has a
central distribution unit in the region of West Java, that is Mail Processing Center
Bandung. MPC Bandung has a function to regulate the distribution of packages
according to the coverage of the destination area, which are delivery to primary
area (provincial capital), secondary area (West Java) and tertiary area (Bandung).
The company has a target to minimize transportation costs on shipping goods. The
delivery process carried out by MPC Bandung can be modeled into the Vehicle
Routing Problem (VRP), this research focuses on distribution routes efficiency of
documents and packages to 12 destination post offices in the secondary region
(West Java). Analysis was conducted using two classical heuristic methods, Clarke
and Wright Savings (CAWSA) and Nearest Neighbor Algorithm (NNA) with the aim
of obtaining a more optimal route proposal in order to minimize transportation
costs.
Data processing begins with calculating the distance and transportation costs of
the existing route, then make a proposed route using the CAWSA and NNA methods
with delivery time limits and vehicle capacity also calculate the travel distance,
after that stage, the best proposed alternative route is selected and transportation
costs are calculated and output comparisons are made : transportation costs for
the selected proposed route and the existing route. The CAWSA and NNA methods
each produce 4 alternative proposed routes where each alternative consists of 3
routes and has a different order of visits. Alternative 2 which is designed using the
CAWSA heuristic method was chosen to be the best alternative that produces the
shortest mileage output of 894.2 km per day with a savings of 54.11% on the
existing route which has a total mileage of 1,948.7 km, this alternative was chosen
as a proposed route improvement for the company. The transportation cost
efficiency was obtained by 50.94% from Rp.115.546.200 for the existing route to
Rp. 56,686,500 for the selected proposed route. |
format |
Theses |
author |
Murti Martikasari, Arida |
spellingShingle |
Murti Martikasari, Arida PROPOSED EFFICIENCY OF PACKAGE DISTRIBUTION ROUTES USING CLARKE & WRIGHT SAVINGS AND NEAREST NEIGHBOR ALGORITHM (CASE STUDY OF OUTGOING MAIL TO SECONDARY AREA AT PT. POS INDONESIA MAIL PROCESSING CENTER BANDUNG) |
author_facet |
Murti Martikasari, Arida |
author_sort |
Murti Martikasari, Arida |
title |
PROPOSED EFFICIENCY OF PACKAGE DISTRIBUTION ROUTES USING CLARKE & WRIGHT SAVINGS AND NEAREST NEIGHBOR ALGORITHM (CASE STUDY OF OUTGOING MAIL TO SECONDARY AREA AT PT. POS INDONESIA MAIL PROCESSING CENTER BANDUNG) |
title_short |
PROPOSED EFFICIENCY OF PACKAGE DISTRIBUTION ROUTES USING CLARKE & WRIGHT SAVINGS AND NEAREST NEIGHBOR ALGORITHM (CASE STUDY OF OUTGOING MAIL TO SECONDARY AREA AT PT. POS INDONESIA MAIL PROCESSING CENTER BANDUNG) |
title_full |
PROPOSED EFFICIENCY OF PACKAGE DISTRIBUTION ROUTES USING CLARKE & WRIGHT SAVINGS AND NEAREST NEIGHBOR ALGORITHM (CASE STUDY OF OUTGOING MAIL TO SECONDARY AREA AT PT. POS INDONESIA MAIL PROCESSING CENTER BANDUNG) |
title_fullStr |
PROPOSED EFFICIENCY OF PACKAGE DISTRIBUTION ROUTES USING CLARKE & WRIGHT SAVINGS AND NEAREST NEIGHBOR ALGORITHM (CASE STUDY OF OUTGOING MAIL TO SECONDARY AREA AT PT. POS INDONESIA MAIL PROCESSING CENTER BANDUNG) |
title_full_unstemmed |
PROPOSED EFFICIENCY OF PACKAGE DISTRIBUTION ROUTES USING CLARKE & WRIGHT SAVINGS AND NEAREST NEIGHBOR ALGORITHM (CASE STUDY OF OUTGOING MAIL TO SECONDARY AREA AT PT. POS INDONESIA MAIL PROCESSING CENTER BANDUNG) |
title_sort |
proposed efficiency of package distribution routes using clarke & wright savings and nearest neighbor algorithm (case study of outgoing mail to secondary area at pt. pos indonesia mail processing center bandung) |
url |
https://digilib.itb.ac.id/gdl/view/62331 |
_version_ |
1822004071891992576 |