The Sriwijaya University Library

  • Home
  • Information
  • News
  • Help
  • Librarian
  • Login
  • Member Area
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of APLIKASI ALGORITMA CHEAPEST INSERTION HEURISTIC DAN ALGORITMA SIMULATED ANNEALING PADA MODEL ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM DALAM PENENTUAN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KECAMATAN ILIR TIMUR 3

Skripsi

APLIKASI ALGORITMA CHEAPEST INSERTION HEURISTIC DAN ALGORITMA SIMULATED ANNEALING PADA MODEL ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM DALAM PENENTUAN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KECAMATAN ILIR TIMUR 3

Rani, Nadia - Personal Name;

Penilaian

0,0

dari 5
Penilaian anda saat ini :  

The waste transportation route problem can be modeled as an Asymmetric Capacitated Vehicle Routing Problem (ACVRP) with the condition that the journey from place i to place j is not the same as the trip from place j to i. This study aims to optimize the garbage transport route in the ACVRP model in Ilir Timur 3 District using the Cheapest Insertion Heuristic (CIH) algorithm and the Simulated Annealing (SA) algorithm. Then an analysis and comparison of the results obtained by the two algorithms are carried out. The final result of the optimal route for Working Area (WA) 1 using the CIH algorithm is to obtain a route with a distance of 21.2 km, while using the SA algorithm, a route with a distance of 19.05 km is obtained. For WA 2 using the CIH algorithm and the SA algorithm, the route is obtained with a distance of 18.9 km. For WA 3 using the CIH algorithm, a route with a distance of 21.45 km was obtained and the SA algorithm obtained a route with a distance of 20.6 km. For WA 4 using the CIH algorithm and the SA algorithm, a route with a distance of 13.5 km is obtained. It can be concluded that the SA algorithm is better than the CIH algorithm in determining the optimal route for transporting waste in Ilir Timur 3 District.


Availability
Inventory Code Barcode Call Number Location Status
2307003357T93596T935962023Central Library (Referens)Available
Detail Information
Series Title
-
Call Number
T935962023
Publisher
Indralaya : Jurusan Matematika, Fakultas Matematika Dan Ilmu Pengetahuan Alam, Universitas Sriwijaya., 2023
Collation
xi, 81 hlm.; Ilus.; 29 cm
Language
Indonesia
ISBN/ISSN
-
Classification
518.107
Content Type
-
Media Type
-
Carrier Type
-
Edition
-
Subject(s)
Algoritma
Jurusan Matematika
Specific Detail Info
-
Statement of Responsibility
PITRIA
Other version/related

No other version available

File Attachment
  • APLIKASI ALGORITMA CHEAPEST INSERTION HEURISTIC DAN ALGORITMA SIMULATED ANNEALING PADA MODEL ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM DALAM PENENTUAN RUTE OPTIMAL PENGANGKUTAN SAMPAH DI KECAMATAN ILIR TIMUR 3
Comments

You must be logged in to post a comment

The Sriwijaya University Library
  • Information
  • Services
  • Librarian
  • Member Area

About Us

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Search

start it by typing one or more keywords for title, author or subject

Keep SLiMS Alive Want to Contribute?

© 2025 — Senayan Developer Community

Powered by SLiMS
Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search