?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=PENYELESAIAN+MASALAH+TRAVELLING+SALESMAN+PROBLEM+(TSP)%0D%0ADENGAN+MENGGUNAKAN+CHEAPEST+INSERTION+HEURISTIC%0D%0ADAN+MODIFIKASI+ALGORITMA+SOLLIN&rft.creator=SHELLA+TRI+%2C+ASTUTI&rft.subject=500+ilmu+pengetahuan+alam+dan+matematika&rft.subject=510+Matematika&rft.description=The+Traveling+Salesman+Problem+was+coined+in+1800+by+Irish+mathematician%0D%0AWilliam+Rowan+Hamilton+and+British+mathematician+Thomas+Penyngton+Krikman.%0D%0AThe+objectives+to+obtained+from+this+study+are+to+compare+the+results+obtained+to%0D%0Adetermine+the+Traveling+Salesman+Problem+from+one+gas+station+to+25+other+gas%0D%0Astations+in+Bandar+Lampung+City.+The+results+obtained+show+that+the+solution%0D%0Aobtained+using+the+Modified+Sollin+Algorithm+method+is+better+than+the+solution%0D%0Aobtained+using+the+Cheapest+Insertion+Heuristic+(CIH)+method.%0D%0AKeywords%3A+Traveling+Salesman+Problem%2C+Cheapset+Insertion+Heuristic%2C+Sollin's%0D%0AAlgorithm.%0D%0ATravelling+Salesman+Problem+dicetuskan+pada+tahun+1800+oleh+ilmuan+matematika%0D%0Ayang+bernama+Irlandia+William+Rowan+Hamilton+dan+ilmuan+matematika+Inggris%0D%0Ayang+bernama+Thomas+Penyngton+Krikman.+Adapun+tujuan+yang+ingin+didapatkan%0D%0Adari+penelitian+ini+membandingkan+hasil+yang+didapat+untuk+menentukan+Travelling%0D%0ASalesman+Problem+dari+satu+SPBU+ke+25+SPBU+lainnya+di+Kota+Bandar+Lampung.%0D%0AHasil+yang+didapat+menunjukkan+bahwa+solusi+yang+didapat+dengan+menggunakan%0D%0Ametode+Modifikasi+Algoritma+Sollin+lebih+baik+dari+solusi+yang+didapat+dengan%0D%0Amengunakan+metode+Cheapest+Insertion+Heuristic+(CIH).%0D%0AKata+kunci%3A+Travelling+Salesman+Problem%2C+Cheapest+Insertion+Heuristic%2C+Algoritma%0D%0ASollin.&rft.publisher=FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM&rft.date=2023-06-20&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F74312%2F1%2F1.%2520ABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F74312%2F2%2F2.%2520SKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F74312%2F3%2F3.%2520SKRIPSI%2520TANPA%2520BAB%2520PEMBAHASAN.pdf&rft.identifier=++SHELLA+TRI+%2C+ASTUTI++(2023)+PENYELESAIAN+MASALAH+TRAVELLING+SALESMAN+PROBLEM+(TSP)+DENGAN+MENGGUNAKAN+CHEAPEST+INSERTION+HEURISTIC+DAN+MODIFIKASI+ALGORITMA+SOLLIN.++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F74312%2F