Melola Discovery

← Melola Discovery

Jurnal

MODEL VEHICLE ROUTING PROBLEM DALAM MENGOPTIMUMKAN RUTE PENGANGKUTAN SAMPAH DI KOTA BOGOR

Jurnal Matematika, Statistika dan Komputasi · Vol. 16 No. 2 (2019) · pp. 241–246

DOI
10.20956/jmsk.v16i2.7023
ISSN
2614-8811, 1858-1382
Published
2019-12-19
Publisher
Department of Mathematics, Hasanuddin University
Language
en

Abstract

Garbage is a common problem that often occurs in many cities, including in Bogor. Every day, the volume of garbage in Bogor reaches 600 tons and only 475 tons can be transported to the Galuga Landfill Site. However, the vehicle which is owned by the Environmental Agency of Bogor is limited and has certain capacity.In this study, we formulated garbage transportation in the form of a Vehicle Routing Problem model with Branch and Bound method and completed using LINGO 11.0. The optimal solution obtained is a garbage transport route with a minimum distance, and obtained a distance is 1583.24 km, with West Bogor is 172.6 km, Central Bogor is 344.99 km, East Bogor is 298.79 km, North Bogor is 267.4 km, South Bogor is 252.41 km and Tanah Sareal is 247.05 km. Of the six sub-districts, there was a decrease in the distance of garbage transportation from Temporary Disposal sites to the Galuga Landfill. Keywords: Garbage transportation, Optimization, Vehicle Routing Problem.

Keywords

Collaboration network of the authors

6 authors · 7 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Ani AndriyatiAffiliation unknown1
Embay RohaetiAffiliation unknown1
Mawar CahyanindriAffiliation unknown1
Rohaeti EmbayAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">MODEL VEHICLE ROUTING PROBLEM DALAM MENGOPTIMUMKAN RUTE PENGANGKUTAN SAMPAH  DI KOTA BOGOR</dc:title>
	<dc:creator xml:lang="en">Widyastiti, Maya</dc:creator>
	<dc:creator xml:lang="en">Kamila, Isti</dc:creator>
	<dc:subject xml:lang="en">Garbage transportation</dc:subject>
	<dc:subject xml:lang="en">Optimization</dc:subject>
	<dc:subject xml:lang="en">Vehicle Routing Problem.</dc:subject>
	<dc:description xml:lang="en">Garbage is a common problem that often occurs in many cities, including in Bogor. Every day, the volume of garbage in Bogor reaches 600 tons and only 475 tons can be transported to the Galuga Landfill Site. However, the vehicle which is owned by the Environmental Agency of Bogor  is limited and has certain capacity.In this study, we formulated garbage transportation in the form of a Vehicle Routing Problem model with Branch and Bound method and completed using LINGO 11.0. The optimal solution obtained is a garbage transport route with a minimum distance, and obtained a distance is 1583.24 km, with West Bogor is 172.6 km, Central Bogor is 344.99 km, East Bogor is 298.79 km, North Bogor is 267.4 km, South Bogor is 252.41 km and Tanah Sareal is 247.05 km. Of the six sub-districts, there was a decrease in the distance of garbage transportation from Temporary Disposal sites to the Galuga Landfill. Keywords:   Garbage transportation, Optimization, Vehicle Routing Problem.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2019-12-19</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/7023</dc:identifier>
	<dc:identifier>10.20956/jmsk.v16i2.7023</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 16 No. 2 (2020): JMSK, JANUARY, 2020; 241-246</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/7023/4551</dc:relation>
	<dc:relation>10.20956/j.v16i2.7023.g4551</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2019 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
</oai_dc:dc>