Article Per Year (5 Year)
p-Index From 2021 - 2026
2.096
P-Index
This Author published in this journals
All Journal LEMMA: Letters Of Mathematics Education JPPM (JURNAL PENELITIAN DAN PEMBELAJARAN MATEMATIKA) IJISTECH (International Journal Of Information System & Technology) JURIKOM (Jurnal Riset Komputer) Building of Informatics, Technology and Science Brahmana : Jurnal Penerapan Kecerdasan Buatan MEANS (Media Informasi Analisa dan Sistem) IJISTECH JagoMIPA: Jurnal Pendidikan Matematika dan IPA Jurnal Penelitian dan Pengkajian Ilmiah
Padma Mike Putri M
Universitas Negeri Padang
Humanities Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Environmental Science Mathematics Physics Public Health Social Sciences

Published : 13 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 13 Documents
Search

 1   2 
Optimasi Metode Travelling Salesman Problem (TSP) Dalam Menyelesaikan Kasus Rute Terpendek Pengiriman Barang M, Padma Mike Putri
MEANS (Media Informasi Analisa dan Sistem) Volume 8 Nomor 1
Publisher : LPPM UNIKA Santo Thomas Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54367/means.v8i1.2637

Abstract

The process of searching and tracking is very important in determining the success of the basic concepts of artificial intelligence. One science that is able to solve the shortest route concept is the Traveling Salesman Problem (TSP) Algorithm. The work form of this algorithm is in the form of determining the shortest route with the work process calculating all paths passed using predetermined concepts and rules. The form of the Traveling Salesman Problem (TSP) is in the form of a minimum weight on a connected graph, with the basic concept of visiting several cities and returning to the original city so that each city is visited exactly once with the shortest possible total distance traveled. The problem of this research is the lack of understanding Salesman in understanding algorithms that are able to provide instructions for the shortest path so that it is easy to find solutions in the form of information that can be used as a reference in saving time and costs on the way. The main objectives of this research are (1) to determine the route of delivery of goods, (2) to solve the Traveling Salesman Problem (TSP) algorithm, (3) to save time and money while traveling. The final results of this study found 24 paths that could be passed by salesmen. Each route has a different value. The value of the shortest route that can be used as a reference is the JLMK/KMLJ line. JLMK route value = 60 +40+40=160 and KMLJ route = =40 +40+60=140. The value of the shortest route found is a route point of 140.
Media Edukasi Game Puzzle dalam Meningkatkan Kemampuan Berhitung pada Anak Usia Dini M, Padma Mike Putri
MEANS (Media Informasi Analisa dan Sistem) Volume 8 Nomor 2
Publisher : LPPM UNIKA Santo Thomas Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54367/means.v8i2.3052

Abstract

Artificial Intelligence has a broad scope, such as learning media. Puzzles are included in the branch of AI science. Learning using puzzles has enormous benefits because this learning attracts interest and increases the cognitive thinking power of children who are new to numbers. This game is very fun for children so that this learning can be done until it's finished. Puzzle games can be in various forms of numbers, pictures, colors and others. The puzzle city consists of 0rdo 3x3 so the arrangement of numbers 1-8 and 1 is left blank for the shift position. In this study using serial numbers 1-8 which are specifically intended for young children who are new to seeing and knowing numbers. The way to play this game is to arrange a series of numbers from 1-8 in the correct order. The purpose of this research is to help improve mindsets, increase understanding of numbers. The algorithm used in this study is the Best First Search Algorithm, the working process of this algorithm is in the form of determining the root node to the queue. The advantage of this method is finding the best solution. The downside is that it requires a large amount of memory because the process is very long. The completion process requires 8 iterations because the puzzle position is in a position that has no truth value. After the process, the final result of the puzzle position is B=8, so the search is stopped.
Pendekatan Heuristik untuk Memetakan Langkah Berpikir Mahasiswa dalam Menyelesaikan Permasalahan Matematika pada Mata Kuliah Trigonometri Putri M, Padma Mike
JagoMIPA: Jurnal Pendidikan Matematika dan IPA Vol. 4 No. 4 (2024): JagoMIPA: Jurnal Pendidikan Matematika dan IPA
Publisher : Yayasan Pendidikan Bima Berilmu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53299/jagomipa.v4i4.877

Abstract

Masih banyak mahasiswa yang kesulitan menemukan pendekatan sistematis untuk menyelesaikan masalah matematis, terutama yang berkaitan dengan trigonometri. Terutama pada masalah konseptual dan prosedural. Tujuan dari penelitian ini adalah untuk mendapatkan pemahaman tentang strategi kognitif yang terlibat dalam setiap tahap pemecahan masalah, serta hubungan antara pola pikir mahasiswa saat menggunakan pendekatan heuristik untuk menyelesaikan masalah trigonometri. Penelitian ini menggunakan metode deskriptif kualitatif yang diterapkan pada mahasiswa Pendidikan Matematika semester satu1 di Universitas Negeri Padang (UNP) sebagai populasi. Satu kelas digunakan sebagai sampel dengan jumlah mahasiswa 31 orang. Data dianalisis dengan metode deskriptif kualitatif setelah dikumpulkan melalui tes pemecahan masalah yang bertujuan untuk mengidentifikasi langkah berpikir mahasiswa, kemudian wawancara untuk melengkapi data hasil tes serta observasi untuk mengamati langsung proses penyelesaian masalah yang dilakukan mahasiswa. Hasil penelitian menunjukkan bahwa mahasiswa cenderung mengikuti tahapan heuristik secara teratur, yaitu orientasi, eksplorasi solusi, implementasi dan refleksi. Tahapan ini membantu mahasiswa mengembangkan pola pikir yang lebih sistematis dan efisien. Berdasarkan hasil tersebut menunjukkan bahwa pendekatan heuristik meningkatkan keterampilan berpikir kritis mahasiswa dalam pemecahan masalah trigonometri. Hasil ini menunjukkan betapa pentingnya memasukkan pendekatan heuristik ke dalam proses pembelajaran matematika untuk memperkuat langkah berpikir dan kemampuan pemecahan masalah mahasiswa.
Co-Authors Mirawati Tatang Mulyana