Article Per Year (5 Year)
p-Index From 2021 - 2026
0.61
P-Index
This Author published in this journals
All Journal Beta: Jurnal Tadris Matematika Prosiding Konferensi Nasional PKM-CSR Jurnal Pariwisata Nusantara
Mamika Ujianita Romdhini
Universitas Mataram
Humanities Control & Systems Engineering Economics, Econometrics & Finance Education Environmental Science Nursing Public Health Social Sciences

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

Found 9 Documents
Search

 1 
Analisis Persepsi Mahasiswa Terhadap Kualitas Merek Sepeda Motor dengan Metode Multidimensional Scaling (MDS) Qomaria Sinta Sari; Mustika Hadijati; Mamika Ujianita Romdhini
Beta: Jurnal Tadris Matematika Vol. 6 No. 1 (2013): Beta Mei
Publisher : Universitas Islam Negeri (UIN) Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Kebutuhan masyarakat akan alat transportasi yang dapat mendukung segala aktifitas dan mobilitas mereka, khususnya sepeda motor, disambut baik oleh kalangan produsen sepeda motor dengan semakin banyaknya merek-merek sepeda motor yang ada dengan keunggulan yang ditawarkan oleh masing-masing merek sepeda motor. Karena itu dirasa perlu untuk mengetahui persepsi konsumen terhadap kualitas sepeda motor, khususnya mahasiswa yang dalam hal ini adalah mahasiswa Universitas Mataram. Penelitian ini bertujuan untuk mengetahui peta persepsi mahasiswa Universitas Mataram terhadap kualitas merek sepeda motor dengan metode MDS. MDS merupakan salah satu prosedur yang digunakan untuk memetakan peta persepsi atau preferensi konsumen yang menggunakan kualitas merek sepeda motor, yang diperoleh dengan survei langsung menggunakan kusioner. Responden diminta menilai preferensi merek sepeda motor, penilaian menggunakan skala numerik yang memiliki dua kutub ekstrem ( 1 = kriteria yang sangat diinginkan sampai 5 = kriteria yang sangat tidak diinginkan). Hasil penelitian menunjukan model yang terpilih adalah model dengan 2 dimensi dengan kemampuan menjeaskan keragaman responden sebesar 95% . Nilai STRESS model diperoleh sebesar 2,38 %, artinya model MDS terpilih sempurna untuk memodelkan pemasaran sepeda motor, untuk dimensi 1 adalah harga beli dan dimensi 2 adalah Model, diperoleh sepeda motor yang paling bersaing adalah merek Vario, peringkat ke-2 adalah merek Beat, peringkat ke -3 adalah sepeda motor dengan merek-merek Mio dan Soul, dan peringkat terakhir adalah merek-merek Scoopy, Spin, Xeon, Skydrive dan Nex.
Algoritma Dijkstra dan Algoritma Semut dalam Menyelesaikan Masalah Lintasan Terpendek (Studi Kasus Jaringan Transportasi Pariwisata di Pulau Lombok) Borisman Bertinegara; Mamika Ujianita Romdhini; I Gede Adhitya Wisnu Wardhana
Beta: Jurnal Tadris Matematika Vol. 5 No. 1 (2012): Beta Mei
Publisher : Universitas Islam Negeri (UIN) Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

On daily life, we often travel from one place to another place another by considering the efficiency, time and cost of having the accuracy required in determining the shortest path. The determination of the shortest path will be a consideration in the decision to show the path that will be pursued. The results obtained also require speed and accuracy with the help of computers. On testing, except performed the shortest route search, the search process is also carried out comparisons between Dijkstra’s Algorithm and Ant Algorithm. Refers to a previous study by Izzat Pratama on 2011 is more focused on the development of tourism transport models with 2-dimensional , Pascal-based visualization technology and use Dijkstra's algorithm in the process of finding a route. The study that researcher developed more emphasis on comparison of the algorithms that is the Dijkstra Algorithm and Ant Algorithm. The results of this study form the shortest path between two specified nodes along the tracks and speed (running time) of both the algorithm that used. The Dijkstra’s Algorithm in solving the shortest path between a specific pair of nodes has a speed 0 second and Ant Algorithm takes much longer, which is an average 37 seconds. However of the Ant Algorithm, the resulting trajectory is more varied. Of the results obtained, it can be said Dijkstra Algorithm is more efficient in the problem of finding the shortest path in the case of transportation networks on tourism of Lombok Island.
Pengoptiman Pendapatan Lahan Parkir Kendaraan Bandar Udara Internasional Lombok Menggunakan Metode Branch & Bound Siti Rahmatullah; Mamika Ujianita Romdhini; Marwan Marwan; Lailia Awalushaumi
Beta: Jurnal Tadris Matematika Vol. 5 No. 2 (2012): Beta Nopember
Publisher : Universitas Islam Negeri (UIN) Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In this research, integer linear programming of vehicle’s setting in Lombok International Airport is solved by Branch and Bound Method. Branch and Bound is the method that can deliver integer solution of the linear programming. The optimum result is parking area’s income of Lombok International Airport can be achieved until Rp1.218.690.000/month with lade of 384 unit’s of motorcycle, 990 units of class I of the car, and 21 units of the bus or truck with the length < 9 m. If we make a comparison between the maximum income with the number of tax in number Rp90.074.550, then the number of the tax is only 7,31% of the maximum income. So that, in the other words we can say that the number of tax which accepted by Central Lombok’s Government is not representative with parking area’s income which can be acquired.
Analisis Penyelesaian Rubik 2×2 Menggunakan Grup Permutasi Abdurahim Abdurahim; Mamika Ujianita Romdhini; I Gede Adhitya Wisnu Wardhana
Beta: Jurnal Tadris Matematika Vol. 4 No. 2 (2011): Beta Nopember
Publisher : Universitas Islam Negeri (UIN) Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Penelitian ini bertujuan menyelesaikan Rubik 2x2, dipandang dari sudut matematika, yaitu bidang aljabar, khususnya grup permutasi. Seperti diketahui, Rubik ini memiliki enam warna berbeda dan dalam keadaan akhir, setiap sisinya memiliki warna yang sama. Dalam penyelesaianya, rubik ini pertama diacak dengan menggunakan koleksi permutasi yang mengakibatkan terjadi pemetaan untuk setiap kubus-kubus kecil. Selanjutnya dianalisis kondisi dan kasusnya dan diselesaikan Rubik 2x2 ini menggunakan grup permutasi
Pengoptimuman Penjadwalan Perawat pada Instalasi Ruang Inap RSU Propinsi NTB Berdasarkan Preferensi Libur Menggunakan Pemrograman Linear Integer Nol-Satu Koko Hermanto; Marwan Marwan; Mamika Ujianita Romdhini
Beta: Jurnal Tadris Matematika Vol. 4 No. 1 (2011): Beta Mei
Publisher : Universitas Islam Negeri (UIN) Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Zero-one integer programming is a mathematical method to solve the scheduling problems, such as nurse scheduling (cyclic scheduling) using Branch and Bound method. In cyclic scheduling method every nurse will work over a period of time (n days) and will take place periodically. The aim of this research is to give an alternative nurses scheduling which optimize the preference of each nurse that maximize the nurses performance and maximize hospital service. This research divided into three steps. First observations for actual hospital schedule, the second stage, formulation the actual schedule into linear programming model and solving the problem. Last, the solution from second step, transformed into the real problems, that is job schedule for each hospital room. Based on the analysis results the optimal schedule are obtained which maximize the quality of assignment for each shift, regard the job load and job constrain. Furthermore, there are significant different of both scheduling in quality and fairness aspect, examine scheduling is more dominant. Meanwhile, in three other aspect of coverage, stability and stability, both of schedule has the same characteristics.
Menjawab Tantangan Dunia Kerja Melalui Penerapan Matematika Dan Sains Bagi Siswa SMAN 5 Mataram Mamika Ujianita Romdhini; Surya Hadi; Siti Raudhatul Kamali; I Gede Adhitya Wisnu Wardhana; Laila Hayati
Prosiding Konferensi Nasional Pengabdian Kepada Masyarakat dan Corporate Social Responsibility (PKM-CSR) Vol 1 (2018): Prosiding PKM-CSR Konferensi Nasional Pengabdian kepada Masyarakat dan Corporate Socia
Publisher : Asosiasi Sinergi Pengabdi dan Pemberdaya Indonesia (ASPPI)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (210.239 KB)

Abstract

Siswa SMA atau sederajat yang ingin melanjutkan studinya ke perguruan tinggi kerap kebingungan dalam memilih bidang minatnya. Sebagian ingin mengambil ilmu-ilmu terapan (rekayasa/engineering), sebagian lainnya ingin mengambil ilmu-ilmu dasar (MIPA). Sifat utama dari ilmu rekayasa adalah instan efeknya dirasakan masyarakat, sementara ilmu dasar pada umumnya tidak bisa instan dirasakan oleh masyarakat. Akibat sifat instan ini maka minat siswa untuk melanjutkan studinya ke ilmu dasar jauh lebih sedikit daripada yang ingin melanjutkan studinya ke ilmu terapan. Salah satu cara untuk menghindari ketimpangan dari peminat ilmu-ilmu dasar di lingkungan Universitas Mataram secara khusus, dan Indonesia secara umum adalah dengan memberikan gambaran tentang Fakultas MIPA dan memberikan motivasi siswa SMA untuk menjadi saintis. Oleh karena itu, Kegiatan Pengabdian Kepada Masyarakat ini bertujuan untuk memotivasi siswa SMAN 5 Mataram untuk menjadi saintis. Hasilnya adalah meningkatnya pengetahuan siswa SMAN 5 Mataram dalam bidang penerapan Matematika dan Sains untuk menghadapi dunia kerja.
Application of Dijkstra Algorithm in Determining Transportation Costs for Tourist Attractions in Lombok Island Based on the Shortest Path M. Afdhaluzzikri; Lalu Djatmika Santriawan; Ermawati Sapni; M. Setyo Nugroho; Mamika Ujianita Romdhini
Jurnal Pariwisata Nusantara (JUWITA) Vol. 3 No. 2 (2024): Jurnal Pariwisata Nusantara (JUWITA)
Publisher : PROGRAM STUDI PARIWISATA SYARAH, FAKULTAS EKONOMI DAN BISNIS ISLAM, UNIVERSITAS ISLAM NEGERI MATARAM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20414/juwita.v3i2.11017

Abstract

Purpose: Lombok Island is known as an attractive tourist destination with natural beauty and unique culture. The growth of the tourism sector is very important for regional economic development. Lombok Island often faces challenges in its transportation system, including complex routes, varying road conditions, and traffic problems. Method: In this research, the data used were 30 tourist attractions on the island of Lombok sourced from the Tourism Office. Tourist attractions in Lombok are represented by vertices in the graph. Then the edges represent roads connecting tourist attractions and the weights represent the cost of getting to each tourist attraction from a starting vertex. Then, to determine the minimum transportation cost for each tourist attraction based on this graph, we use Dijkstra algorithm based on the shortest path for each tourist attraction. Result: The minimum transportation costs for each tourist attraction are obtained based on the shortest route for each tourist attraction on Lombok Island. Contribution: The application of Dijkstra algorithm can be a solution to overcome some of these challenges by determining the shortest path and optimizing transportation costs.
Comparative Analysis of Bellman-Ford and Dijkstra Algorithms to Determine the Shortest Tourist Path in Central Lombok Krissinta Bulan Wardhani; Gusti Yoga Nanda Karang; Septi Fajria; Muhammad Imam Al Paqih; Rida Akausar Hardi; M. Setyo Nugroho; Mamika ujianita Romdhini
Jurnal Pariwisata Nusantara (JUWITA) Vol. 4 No. 1 (2025): Jurnal Pariwisata Nusantara (JUWITA)
Publisher : PROGRAM STUDI PARIWISATA SYARAH, FAKULTAS EKONOMI DAN BISNIS ISLAM, UNIVERSITAS ISLAM NEGERI MATARAM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20414/juwita.v4i1.13155

Abstract

Purpose: Central Lombok Regency has many tourist attractions spread out, which often makes it difficult for tourists to determine the best travel route to visit several locations at once. Choosing the shortest route is an important factor because it can save time, energy, and fuel costs, especially in tourist trips with unstructured schedules. Therefore, an effective method is needed to determine the shortest route to improve the efficiency of tourist trips. This study analyzes the shortest route to tourist attractions in Central Lombok Regency using two popular graph algorithms, including Dijkstra Algorithm and Bellman-Ford Algorithms Method: In this study, the data used are 6 tourist attractions in Central Lombok Regency. Tourist attractions are represented by points on the graph. Then the edge represents the road connecting the tourist attractions and the weight represents the distance to each tourist attraction from a starting point. Then to determine the minimum shortest distance of each tourist attraction based on the graph, Dijkstra and Bellman-Ford algorithms are used. Result: The shortest path to tourist attractions in Central Lombok Regency is obtained based on the Dijkstra and Bellman-Ford Algorithms. Contribution: Through this analysis, the advantages and disadvantages of the two algorithms in the context of determining tourist routes in Central Lombok can be identified.
Optimizing Shuttle Bus Paths at Mandalika Circuit with Dijkstra Algorithm to Support MotoGP Sport Tourism Krissinta Bulan Wardhani; Rabbelia Tri Qudrani; Nafika Fatanaya; Ririn Maulidia; Sarwa Hita; M. Setyo Nugroho; Mamika Ujianita Romdhini
Jurnal Pariwisata Nusantara (JUWITA) Vol. 4 No. 3 (2025): Jurnal Pariwisata Nusantara
Publisher : PROGRAM STUDI PARIWISATA SYARAH, FAKULTAS EKONOMI DAN BISNIS ISLAM, UNIVERSITAS ISLAM NEGERI MATARAM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20414/juwita.v4i3.14699

Abstract

Purpose: MotoGP is one of the most popular motorcycle racing events in terms of sport and recreation around the world. To get to the MotoGP venue we have to go through several routes. This route problem can disrupt visitor mobility, make them uncomfortable, and even damage the reputation of the international event. This study aims to develop a system for determining the shortest route for shuttle buses at the Mandalika Circuit by utilizing the Dijkstra algorithm. Method: To determine the shortest route we use an algorithm, one of which is the Dijkstra algorithm. The Dijkstra algorithm is one of the most well-known algorithms for finding the shortest route on a graph network. It can efficiently find the path with the minimum weight from one vertex to another. Result: The results of this study using the manual method with the contribution of the Dijkstra algorithm both produced 5 shortest routes with 2 routes in the green zone, 2 routes in the blue zone and 1 route in the red zone. Contribution: Through this analysis, a solution can be formulated for the shuttle bus route at the Mandalika Circuit in order to support sustainable MotoGP motorcycle racing tourism.
Co-Authors Abdurahim, Abdurahim Borisman Bertinegara Ermawati Sapni Gusti Yoga Nanda Karang Hermanto, Koko I Gede Adhitya Wisnu Wardhana Krissinta Bulan Wardhani Laila Hayati Lailia Awalushaumi Lalu Djatmika Santriawan M. Afdhaluzzikri M. Setyo Nugroho Marwan Marwan Muhammad Imam Al Paqih Mustika Hadijati Nafika Fatanaya Qomaria Sinta Sari Rabbelia Tri Qudrani Rida Akausar Hardi Ririn Maulidia Sarwa Hita Septi Fajria Siti Rahmatullah Siti Raudhatul Kamali Surya Hadi