SOLUSI EKSAK SINGLE PRODUCT MULTI-PERIOD INVENTORY ROUTING MULTI-PROBLEM DENGAN MEMPERTIMBANGKAN KEPUTUSAN FINANSIAL
| ctrlnum |
20061 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><relation>http://repository.unsri.ac.id/20061/</relation><title>SOLUSI EKSAK SINGLE PRODUCT MULTI-PERIOD INVENTORY ROUTING MULTI-PROBLEM DENGAN MEMPERTIMBANGKAN KEPUTUSAN FINANSIAL</title><creator>YULANDA, AKBAR</creator><creator>Puspita, Fitri Maya</creator><creator>Eliyati, Ning</creator><subject>QA37.3.1.64 Applied Mathematics</subject><subject>QA9.64.A56 Computer science. Fuzzy mathematics.</subject><description>Inventory Routing Problem (IRP), problem in the distribution of which later developed into a broader multi-period inventory routing of multi-problem is a problem of distribution that deals with the problem of keeping inventories so as not to run out. The flow distributions are to get the shortest distance and distribution scheduling, to get the minimum time of the visit, and to reduce operating costs. PERTAMINA together with its filling stations (SPBU) is the company that does the distribution that complies with the multi-period inventory routing of multi-problem (IRP) model in which later on the distribution problem in PERTAMINA will be applied to this model. The model of this IRP is a Non-Linear Programming (NLP), which will be translated into the LINGO 13.0 application software and the data is applied to the model to get the exact solution. Data is grouped with the appropriate parameters and certain variables in the model. The results of running the program showed that minimum cost of Rp 1,497,531, while the visits are carried out every day with a minimum of operational tanker truck to the distribution of products from PERTAMINA to the stations. The arrangement of finding the optimal solutions are conducted by setting the stations into two groups to obtain the optimal distribution and minimal distribution costs.</description><date>2017-07</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/20061/1/RAMA_44201_08121001073.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/20061/2/RAMA_44201_08121001073_0006107501_0020115903_01_front_ref.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/20061/3/RAMA_44201_08121001073_0006107501_0020115903_02.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/20061/4/RAMA_44201_08121001073_0006107501_0020115903_03.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/20061/5/RAMA_44201_08121001073_0006107501_0020115903_04.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/20061/6/RAMA_44201_08121001073_0006107501_0020115903_05.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/20061/7/RAMA_44201_08121001073_0006107501_0020115903_06_ref.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/20061/8/RAMA_44201_08121001073_0006107501_0020115903_07_lamp.pdf</identifier><identifier> YULANDA, AKBAR and Puspita, Fitri Maya and Eliyati, Ning (2017) SOLUSI EKSAK SINGLE PRODUCT MULTI-PERIOD INVENTORY ROUTING MULTI-PROBLEM DENGAN MEMPERTIMBANGKAN KEPUTUSAN FINANSIAL. Undergraduate thesis, Sriwijaya University. </identifier><recordID>20061</recordID></dc>
|
| language |
ind |
| format |
Thesis:Thesis Thesis PeerReview:NonPeerReviewed PeerReview Book:Book Book |
| author |
YULANDA, AKBAR Puspita, Fitri Maya Eliyati, Ning |
| title |
SOLUSI EKSAK SINGLE PRODUCT MULTI-PERIOD INVENTORY ROUTING MULTI-PROBLEM DENGAN MEMPERTIMBANGKAN KEPUTUSAN FINANSIAL |
| publishDate |
2017 |
| isbn |
08121001073 |
| topic |
QA37.3.1.64 Applied Mathematics QA9.64.A56 Computer science. Fuzzy mathematics |
| url |
http://repository.unsri.ac.id/20061/1/RAMA_44201_08121001073.pdf http://repository.unsri.ac.id/20061/2/RAMA_44201_08121001073_0006107501_0020115903_01_front_ref.pdf http://repository.unsri.ac.id/20061/3/RAMA_44201_08121001073_0006107501_0020115903_02.pdf http://repository.unsri.ac.id/20061/4/RAMA_44201_08121001073_0006107501_0020115903_03.pdf http://repository.unsri.ac.id/20061/5/RAMA_44201_08121001073_0006107501_0020115903_04.pdf http://repository.unsri.ac.id/20061/6/RAMA_44201_08121001073_0006107501_0020115903_05.pdf http://repository.unsri.ac.id/20061/7/RAMA_44201_08121001073_0006107501_0020115903_06_ref.pdf http://repository.unsri.ac.id/20061/8/RAMA_44201_08121001073_0006107501_0020115903_07_lamp.pdf http://repository.unsri.ac.id/20061/ |
| contents |
Inventory Routing Problem (IRP), problem in the distribution of which later developed into a broader multi-period inventory routing of multi-problem is a problem of distribution that deals with the problem of keeping inventories so as not to run out. The flow distributions are to get the shortest distance and distribution scheduling, to get the minimum time of the visit, and to reduce operating costs. PERTAMINA together with its filling stations (SPBU) is the company that does the distribution that complies with the multi-period inventory routing of multi-problem (IRP) model in which later on the distribution problem in PERTAMINA will be applied to this model. The model of this IRP is a Non-Linear Programming (NLP), which will be translated into the LINGO 13.0 application software and the data is applied to the model to get the exact solution. Data is grouped with the appropriate parameters and certain variables in the model. The results of running the program showed that minimum cost of Rp 1,497,531, while the visits are carried out every day with a minimum of operational tanker truck to the distribution of products from PERTAMINA to the stations. The arrangement of finding the optimal solutions are conducted by setting the stations into two groups to obtain the optimal distribution and minimal distribution costs. |
| id |
IOS8119.20061 |
| institution |
Universitas Sriwijaya |
| institution_id |
177 |
| institution_type |
library:university library |
| library |
UPT Perpustakaan Universitas Sriwijaya |
| library_id |
1098 |
| collection |
Sriwijaya University Institutional Repository |
| repository_id |
8119 |
| city |
OGAN ILIR |
| province |
SUMATERA SELATAN |
| shared_to_ipusnas_str |
1 |
| repoId |
IOS8119 |
| first_indexed |
2020-03-23T08:00:14Z |
| last_indexed |
2020-03-23T08:00:14Z |
| recordtype |
dc |
| _version_ |
1684010464339558401 |
| score |
17.538404 |