Melola Discovery

← Melola Discovery

Jurnal

PERBANDINGAN ALGORITMA BRANCH AND BOUND DAN ALGORITMA GENETIKA UNTUK MENGATASI TRAVELLING SALESMAN PROBLEM (TSP) (Studi Kasus PT. JNE Semarang)

Unnes Journal of Mathematics · Vol. 5 No. 2 (2017) · hlm. 135–143

DOI
10.15294/ujm.v5i2.13123
ISSN
2460-5859, 2252-6943
Terbit
2017-02-27
Penerbit
Universitas Negeri Semarang
Bahasa
eng

Abstrak

This study examines an optimum solution to the search of Travelling Salesman Problem (TSP). The purpose of this paper is finding the shortest route at PT. Jalur Nugraha Ekakurir (JNE) Semarang on condition that every town is just visited once, except for the beginning address. Branch and bound algorithm dan genetic algorithm, is proposed to solve optimization problems with using Matlab software. Measurement of the effectiveness of the work system is done by comparing the calculation results between the branch and bound algorithm and genetic algorithm which is the best modification. Population size, pc, pm, and the number of generations are used as modifications. The results showed that the length of the resulting circuit using genetic algorithm is smaller than the length of using circuit branch and bound algorithm. This shows that genetic algorithm is more effective in determining the shortest circuit for delivery of goods in PT. Jalur Nugraha Ekakurir (JNE) Semarang

Jaringan kolaborasi para penulis

40 penulis · 125 tautan kepenulisan bersama · 11 lintas organisasi · menampilkan 40 yang paling banyak terhubung

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • State University of Semarang
  • International Islamic University Malaysia
  • Universitas PGRI Palembang
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Emi PujiastutiState University of Semarang7
Endang SugihartiState University of Semarang7
Mulyono MulyonoAfiliasi tidak diketahui6
Sugiman SugimanAfiliasi tidak diketahui6
Florentina Yuni AriniState University of Semarang5
Mashuri MashuriState University of Semarang4
Rochmad RochmadInternational Islamic University Malaysia3
Masrukan MasrukanState University of Semarang3
Alamsyah AlamsyahState University of Semarang2
Novanka Agnes SekartajiState University of Semarang2
Irfan Fajar MuttaqinState University of Semarang2
Ramadhan Ridho ArrohmanState University of Semarang2
Dwijanto DwijantoState University of Semarang2
Putriaji HendikawatiState University of Semarang2
Hanif Ilmi MardlootillahAfiliasi tidak diketahui2
Amin SuyitnoState University of Semarang2
Isti HidayahState University of Semarang2
Mohammad AsikinState University of Semarang2
Budi PrasetiyoState University of Semarang1
Much Aziz MuslimState University of Semarang1
Jumanto JumantoState University of Semarang1
Rofik RofikState University of Semarang1
Arif WidiyatmokoState University of Semarang1
Stephani Diah PamelasariState University of Semarang1
Arka YanitamaState University of Semarang1
Melissa Salma DarmawanState University of Semarang1
Aji SaputraUniversitas PGRI Palembang1
Desy Fitria AstutianingtyasAfiliasi tidak diketahui1
Syafa Nabilah SyahputraState University of Semarang1
Anggyi Trisnawan PutraState University of Semarang1
Athoillah AthoillahState University of Semarang1
Kholiq BudimanAfiliasi tidak diketahui1
Anggyi Trisnawan PutraAfiliasi tidak diketahui1
zaenal abidinAfiliasi tidak diketahui1
Anggoro Sakti AnindhitoState University of Semarang1
Fajar SujitoAfiliasi tidak diketahui1
Anita Wahyu MelindaAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/sju/index.php/ujm/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 6 Nov 2026.
Metadata asli (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-US">PERBANDINGAN ALGORITMA BRANCH AND BOUND DAN ALGORITMA GENETIKA UNTUK MENGATASI TRAVELLING SALESMAN PROBLEM (TSP) (Studi Kasus PT. JNE Semarang)</dc:title>
	<dc:creator>Nugroho, Ari Yulianto</dc:creator>
	<dc:creator>Suyitno, Amin</dc:creator>
	<dc:creator>Arifudin, Riza</dc:creator>
	<dc:description xml:lang="en-US">This study examines an optimum solution to the search of Travelling Salesman Problem (TSP). The purpose of this paper is finding the shortest route at PT. Jalur Nugraha Ekakurir (JNE) Semarang on condition that every town is just visited once, except for the beginning address. Branch and bound algorithm dan genetic algorithm, is proposed to solve optimization problems with using Matlab software. Measurement of the effectiveness of the work system is done by comparing the calculation results between the branch and bound algorithm and genetic algorithm which is the best modification. Population size, pc, pm, and the number of generations are used as modifications. The results showed that the length of the resulting circuit using genetic algorithm is smaller than the length of using circuit branch and bound algorithm. This shows that genetic algorithm is more effective in determining the shortest circuit for delivery of goods in PT. Jalur Nugraha Ekakurir (JNE) Semarang</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Negeri Semarang</dc:publisher>
	<dc:date>2017-02-27</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/sju/ujm/article/view/13123</dc:identifier>
	<dc:identifier>10.15294/ujm.v5i2.13123</dc:identifier>
	<dc:source xml:lang="en-US">Unnes Journal of Mathematics; Vol 5 No 2 (2016); 135-143</dc:source>
	<dc:source>2460-5859</dc:source>
	<dc:source>2252-6943</dc:source>
	<dc:source>10.15294/ujm.v5i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/sju/ujm/article/view/13123/7203</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Unnes Journal of Mathematics</dc:rights>
</oai_dc:dc>