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 MODEL SET COVERING PROBLEM DAN ALGORITMA GREEDY HEURISTIC PADA PENENTUAN TITIK PEMBERHENTIAN FEEDER LRT MUSI EMAS RUTE STASIUN LRT POLRESTA-PERUMAHAN OPI

Skripsi

MODEL SET COVERING PROBLEM DAN ALGORITMA GREEDY HEURISTIC PADA PENENTUAN TITIK PEMBERHENTIAN FEEDER LRT MUSI EMAS RUTE STASIUN LRT POLRESTA-PERUMAHAN OPI

Purba, Stevy Tiofani - Personal Name;

Penilaian

0,0

dari 5
Penilaian anda saat ini :  

This study aims to optimize the location of the stop point of the Feeder LRT Musi Emas on the LRT Polresta-Residential OPI Station Route using the Covering Based Problem (CBP) model formulation, namely the Set Sovering Location Problem (SCLP) and Maximal Covering Location Problem (MCLP) and the Greedy Heuristic algorithm with the LINGO 13.0 software tool. The Greedy Heuristic algorithm can solve optimization problems such as determining the location of the optimal location point. The LRT Polresta-Residential OPI Station route is a route that has 30 stopping points. The CBP model produces the optimal stopping point location according to the demand point. While the Greedy Heuristic algorithm produces 15 additional new stop point LRT that can maximize the stop demand point on the Feeder LRT Musi Emas LRT Polresta-Residential OPI Station Route. Therefore, this research recommends the Greedy Heuristic algorithm solution, because the Greedy Heuristic algorithm solution can fulfill the demand on the Feeder LRT Musi Emas Corridor IV LRT Polresta-Residential OPI Station Route. Keyword : Covering Based Problem, Set Covering Location Problem, Maximal Covering Location Problem, Greedy Heuristic Algorithm, Feeder LRT Musi Emas


Availability
Inventory Code Barcode Call Number Location Status
2507005857T184280T1842802025Central Library (Reference)Available but not for loan - Not for Loan
Detail Information
Series Title
-
Call Number
T1842802025
Publisher
Indralaya : Prodi Ilmu Matematika, Fakultas Matematika Dan Ilmu Pengetahuan Alam Universitas Sriwijaya., 2025
Collation
xii, 128 hlm.; ilus.; tab.; 29 cm.
Language
Indonesia
ISBN/ISSN
-
Classification
518.107
Content Type
Text
Media Type
unmediated
Carrier Type
other (computer)
Edition
-
Subject(s)
Teori Algoritma--Feeder LRT
Specific Detail Info
-
Statement of Responsibility
MI
Other version/related
TitleEditionLanguage
ANALISIS KEPUASAN PENGGUNA ANGKUTAN KOTA FEEDER LRT MUSI EMAS TRAYEK TALANG BURUK - TALANG KELAPA DI KOTA PALEMBANGid
ANALISIS PERILAKU KESELAMATAN OPERASIONAL ANGKOT FEEDER LRT PADA KAWASAN SEKITAR PUSAT KOTA PALEMBANG.id
MODEL IMPROVED SET COVERING LOCATION PROBLEM PADA PENENTUAN TITIK PEMBERHENTIAN FEEDER LRT MUSI EMAS RUTE STASIUN LRT DJKA - TERMINAL PLAJUid
File Attachment
  • MODEL SET COVERING PROBLEM DAN ALGORITMA GREEDY HEURISTIC PADA PENENTUAN TITIK PEMBERHENTIAN FEEDER LRT MUSI EMAS RUTE STASIUN LRT POLRESTA-PERUMAHAN OPI
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