Eduvest - Journal of Universal Studies
Vol. 1 No. 8 (2021): Journal Eduvest - Journal of Universal Studies

Travelling Salesman Problem Analysis with Complete Enumeration Method, Branch & Bound and Greedy Heuristic

Ifham Azizi Surya Syafiin (Universitas Widyatama Bandung)
Sarah Nur Fatimah (Universitas Widyatama Bandung)
Muchammad Fauzi (Universitas Widyatama Bandung)

Article Info

Publish Date
20 Aug 2021

Abstract

PT XYZ as the best and largest Bed Sheet Set company in Indonesia with products such as Bed Covers, Bed Sheets, Pillowcases, Bolsters and Blankets. The Traveling Salesman Problem (TSP) is a problem faced in finding the best route to visit shops that sell products from PT BIG. A visit to the shop is carried out on the condition that each city can only be visited once except the city of origin. The algorithms applied in this TSP problem include the Complete Enumeration, Branch & Bound and Greedy Heuristic methods.

Copyrights © 2021




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
206.051 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Eduvest - Journal of Universal Studies
Website

Abbrev

edv

Publisher

Green Publisher Indonesia

Subject

Aerospace Engineering Computer Science & IT Health Professions Neuroscience Social Sciences

Description

Eduvest - Journal of Universal Studies is a double blind peer-reviewed academic journal and open access to multidiciplinary fields. The journal is published monthly by Green Publisher Indonesia. Eduvest - Journal of Universal Studies provides a means for sustained discussion of relevant issues that ...