PENYELESAIAN CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) DENGAN MENGGUNAKAN ALGORITMA TABU SEARCH
| Main Author: | MAHMUDAH, ASIYAH NUR |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2013
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/15743/ |
| ctrlnum |
15743 |
|---|---|
| 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://eprints.umm.ac.id/15743/</relation><title>PENYELESAIAN CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) DENGAN MENGGUNAKAN ALGORITMA TABU SEARCH</title><creator>MAHMUDAH, ASIYAH NUR</creator><subject>T Technology (General)</subject><description>Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem. One variant of the VRP is the Capacitated Vehicle Routing Problem (CVRP). CVRP aims to minimize the cost, which is closely related to the determination of the cost of the distance traveled. Problems CVRP considers the limitations on the capacity of the vehicles used. In this CVRP the research will be focused to develop a Tabu Search algorithm as a method of settlement. This algorithm is then used as a follow-up study of the results of research on the same issues that the solution uses the algorithm Saving Matrix (Yuvita, 2011). This algorithm is then poured in a computer program with the help of MATLAB applications. The name of the computer program is CVRP solver, there are a program that helps provide easy and speed of completion CVRP solutions. As a result, the proposed algorithm was able to provide the amount of the total route mileage, and transportation costs are low.</description><date>2013</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><identifier> MAHMUDAH, ASIYAH NUR (2013) PENYELESAIAN CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) DENGAN MENGGUNAKAN ALGORITMA TABU SEARCH. Other thesis, University of Muhammadiyah Malang. </identifier><recordID>15743</recordID></dc>
|
| format |
Thesis:Thesis Thesis PeerReview:NonPeerReviewed PeerReview |
| author |
MAHMUDAH, ASIYAH NUR |
| title |
PENYELESAIAN CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) DENGAN MENGGUNAKAN ALGORITMA TABU SEARCH |
| publishDate |
2013 |
| topic |
T Technology (General) |
| url |
http://eprints.umm.ac.id/15743/ |
| contents |
Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem. One variant of the VRP is the Capacitated Vehicle Routing Problem (CVRP). CVRP aims to minimize the cost, which is closely related to the determination of the cost of the distance traveled. Problems CVRP considers the limitations on the capacity of the vehicles used. In this CVRP the research will be focused to develop a Tabu Search algorithm as a method of settlement. This algorithm is then used as a follow-up study of the results of research on the same issues that the solution uses the algorithm Saving Matrix (Yuvita, 2011). This algorithm is then poured in a computer program with the help of MATLAB applications. The name of the computer program is CVRP solver, there are a program that helps provide easy and speed of completion CVRP solutions. As a result, the proposed algorithm was able to provide the amount of the total route mileage, and transportation costs are low. |
| id |
IOS4109.15743 |
| institution |
Universitas Muhammadiyah Malang |
| institution_id |
136 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas Muhammadiyah Malang |
| library_id |
546 |
| collection |
UMM Institutional Repository |
| repository_id |
4109 |
| city |
MALANG |
| province |
JAWA TIMUR |
| repoId |
IOS4109 |
| first_indexed |
2017-03-21T02:43:26Z |
| last_indexed |
2017-03-21T02:43:26Z |
| recordtype |
dc |
| _version_ |
1675924220693970944 |
| score |
17.538404 |