Article Per Year (5 Year)
p-Index From 2021 - 2026
2.438
P-Index
This Author published in this journals
All Journal Epsilon: Jurnal Matematika Murni dan Terapan Jurnal Fisika FLUX Jambura Journal of Mathematics Mathematics and Applications (MAp) Journal Prosiding Konferensi Nasional Penelitian Matematika dan Pembelajarannya Jurnal Pengabdian Masyarakat Equiva
Pardi Affandi
Program Studi Matematika Fakultas MIPA Universitas Lambung Mangkurat, Indonesia
Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Education Environmental Science Materials Science & Nanotechnology Mathematics Physics Social Sciences Transportation Other

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

Found 8 Documents
Search
Journal : Equiva

 1 
PENERAPAN ALGORITMA ANT COLONY OPTIMIZATION (ACO) RUTE TERPENDEK STUDI KASUS DISTRIBUSI MINYAK GORENG TOKO CAHAYA BERKAH Putri Haidi, Melani; Affandi, Pardi
Equiva Journal Vol 3 No 1 (2025)
Publisher : Jurusan Matematika dan Teknologi Informasi

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

Abstract

Cooking oil distribution is one of the important logistics services that requires an optimal delivery route to improve time efficiency and reduce operational costs. This study uses the Ant Colony Optimization (ACO) Algorithm to optimize the cooking oil distribution route from Toko Cahaya Berkah to several destination locations. Distance data between locations was obtained through Google Maps and analyzed using a quantitative approach based on ACO. The Ant Colony Optimization (ACO) algorithm imitates the behavior of an ant colony in finding the shortest path through the pheromone mechanism. The results show that this algorithm is able to find the best distribution route with a route length of 52.14 km, which is the shortest route among the routes evaluated. Pheromone evaporation helps explore wider solutions, thus avoiding convergence on less than optimal local solutions. This study proves that ACO is an effective method for optimizing distribution routes. Assuming normal road conditions and no external obstacles, this algorithm has succeeded in saving travel time and costs significantly. These results are relevant in the context of logistics, especially to improve the efficiency of cooking oil delivery.
PENERAPAN PEWARNAAN GRAF UNTUK OPTIMALISASI PENJADWALAN KULIAH DI PROGRAM STUDI MATEMATIKA: Algoritma Welch-Powell Amalia, Rizka Nanda; Affandi, Pardi
Equiva Journal Vol 3 No 1 (2025)
Publisher : Jurusan Matematika dan Teknologi Informasi

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

Abstract

Lecture scheduling is a critical challenge in higher education that requires efficient management of time and resources. This study applies graph theory, specifically the Welch-Powell graph coloring algorithm, to create a lecture schedule in the Mathematics Study Program, Lambung Mangkurat University. This method aims to avoid schedule conflicts between lecturers and students by utilizing graph representation. Each course is represented as a node, and conflicts between courses are represented as edges in the graph. The results show that the Welch-Powell algorithm is effective in producing an orderly and optimal lecture schedule. This approach allows for maximum use of space and time. In addition, this study also provides practical guidance for other institutions in applying graph theory to academic schedule management. With the results achieved, it is expected that lecture scheduling can be done faster and more accurately. This will support the improvement of better education quality. This research contributes to more efficient and planned academic management.
Analisis Komparatif Vogel’s Approximation Method dan Modified Vogel’s Approximation Method Dalam Optimalisasi Transportasi Aulia, Rena; Affandi, Pardi
Equiva Journal Vol 3 No 1 (2025)
Publisher : Jurusan Matematika dan Teknologi Informasi

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

Abstract

Distribusi barang merupakan bagian penting dalam rantai pasokan yang berperan besar dalam menentukan efisiensi dan biaya operasional suatu perusahaan. Penelitian ini berfokus pada perbandingan antara Vogel's Approximation Method (VAM) dan Improved Vogel's Approximation Method (IVAM) untuk menemukan solusi awal dalam optimalisasi biaya distribusi. Data penelitian diperoleh dari studi kasus UD Yosarita, mencakup kapasitas gudang, permintaan konsumen, dan matriks biaya pengiriman. Hasil analisis menunjukkan bahwa IVAM mampu menghasilkan biaya distribusi sebesar Rp 4.595.000,00, lebih rendah dibandingkan VAM dengan biaya Rp 4.615.000,00. Kedua metode tersebut memerlukan jumlah iterasi yang sama, yakni sebanyak 9 langkah. Penelitian ini diharapkan dapat memberikan referensi bagi perusahaan dalam memilih metode distribusi yang lebih efisien dan ekonomis.
Solusi Optimal Transportasi Dengan Least-Looping Stepping-Stone-based ASM (LS-ASM): Optimal Transportation Solution with Least-Looping Stepping-Stone-based ASM (LS-ASM) Meylan; Affandi, Pardi
Equiva Journal Vol 3 No 2 (2025)
Publisher : Jurusan Matematika dan Teknologi Informasi

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

Abstract

The Least-Looping Stepping-Stone-based ASM (LS-ASM) method is a transportation problem-solving approach aimed at achieving an optimal solution more efficiently than the classical method. It begins with row and column reductions to simplify the cost matrix, followed by stepwise allocation based on selecting the most advantageous cells, and then uses the formation of closed loops to evaluate cost changes and identify potential improvements to the current solution. Through this systematic process, LS-ASM is able to minimize the number of iterations required, using cost change values for optimality checks to ensure that the final allocation structure consistently meets source capacities and destination demands, ultimately resulting in a stable, directed, and optimal solution for minimizing distribution costs.
Penyelesaian Masalah Transportasi menggunakan Transportation Optimality Complementary Method (Tocm) Dengan Zero Point Minimum Method (Zpmm) Dan Uji Optimalitas Midofied Distribution (Modi): Transportation Problem Solving Using the Transportation Optimality Complementary Method (TOCM) with the Zero Point Minimum Method (ZPMM) and Modified Distribution Optimality Test (MODI) Hikmawati, Lia; Affandi, Pardi
Equiva Journal Vol 3 No 2 (2025)
Publisher : Jurusan Matematika dan Teknologi Informasi

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

Abstract

The transportation problem is a special type of linear programming that aims to minimize the total distribution cost from several sources to multiple destinations while satisfying supply and demand constraints. This study applies a combination of the Transportation Optimality Complementary Method (TOCM) and the Zero Point Minimum Method (ZPMM) to obtain an efficient initial solution, followed by an optimality test using the Modified Distribution Method (MODI). Three types of cases were analyzed: balanced transportation, excess supply (supply > demand), and excess demand (demand > supply). The results indicate that the TOCM–ZPMM method can produce an initial solution that is very close to the optimal result, making the optimization phase with the MODI method require fewer iterations. Therefore, this combination improves computational efficiency and provides accurate solutions, making it an effective alternative for solving transportation problems in logistics and distribution systems.
Penyelesaian Model Masalah Transportasi menggunakan Maximum Range Method (MRM) dan AH Method (AHM) Faturrahman, Muhammad; Affandi, Pardi
Equiva Journal Vol 3 No 2 (2025)
Publisher : Jurusan Matematika dan Teknologi Informasi

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

Abstract

Transportation models are a specific type of linear programming used to determine optimal distribution patterns by considering the balance between total supply and total demand. Through mathematical formulations involving transportation costs C_{ij}, distribution allocations X_{ij}, supply a_i, and demand b_j, these models provide an effective analytical framework for evaluating the efficiency of a distribution system. This study applies two solution methods, namely the Maximum Range Method (MRM) and the AH Method (AHM), to a balanced transportation model without linking it to a specific industrial context. The MRM calculation process is carried out by identifying the largest cost difference in each row and column to determine the allocation location that has the potential to provide the highest savings. On the other hand, AHM works as a direct optimization method by selecting the smallest global cost at each stage of calculation. The results of the study show that MRM produces a total cost of 2070, which is lower than AHM, which produces a total cost of 2100. This difference indicates that MRM is more efficient for the transportation data model in this study. These two methods provide different computational perspectives but can complement each other in the analysis of transportation problem solving based on cost optimization.
Penerapan Metode SS (Sheethalakshmy–Srinivasan) dalam Optimasi Masalah Transportasi untuk Meminimalkan Biaya Distribusi Yazid Halim, Ahmad; Affandi, Pardi
Equiva Journal Vol 3 No 2 (2025)
Publisher : Jurusan Matematika dan Teknologi Informasi

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

Abstract

The transportation problem is one of the important problems in operations research related to the distribution of goods from several sources to several destinations at minimum cost. This problem aims to determine the number of goods that must be shipped from each source to each destination so that all demand is met with the lowest possible total distribution cost. This study applies the SS Method (Sheethalakshmy–Srinivasan) as a direct approach to solving transportation problems without the need to determine a feasible initial solution. The SS Method offers systematic steps through row and column reduction processes and cost reduction calculation to obtain optimal solutions for both balanced and unbalanced transportation cases. The results of the application of this method show that the SS Method is able to provide optimal solutions efficiently with a shorter calculation time compared to conventional methods such as North West Corner, Least Cost, and Vogel's Approximation. Thus, the SS Method can be used as an effective alternative in optimizing distribution costs in modern logistics systems.
Masalah Transportasi menggunakan Kombinasi Distribusi Normal dengan Root Mean Square (RMS) untuk Solusi Layak Awal dan Sirisha-Viola Method (SVM) untuk Solusi Optimal Saadah, Miftahus; Affandi, Pardi
Equiva Journal Vol 3 No 2 (2025)
Publisher : Jurusan Matematika dan Teknologi Informasi

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

Abstract

The objective of this research is to find the best logistics solution for various purposes at minimal cost. The development of a new initial feasible solution (IBFS) algorithm is the first step toward finding the optimal solution. This new method for initial feasible solutions reduces the number of iterations and produces the best solution for transportation problems at an early stage. The literature review covers various IBFS methods. The new IBFS was discovered using statistical techniques such as normal distribution and root mean square techniques. A transportation problem is converted into a normal distribution, and the penalty is determined using the root mean square method. The normal distribution value can be calculated using Excel Solver. In the second step, a step-by-step method is used to find the optimal solution. Numerical calculations are used to calculate the research results and compared with the Sirisha-Viola method in determining a feasible optimal solution.
Co-Authors Affandi, Aisyah Akhmad Basuki, Akhmad Yusuf Alkatiri, Gina Amalia, Rizka Nanda Andry Nor Indrawan Anjel Agustina Arifin Arifin Aulia, Rena Balya, Afief Balya, Muhammad Afief Cahya, Nila DEWI ANGGRAINI Faisal Faisal Faisal Faisal Faisal Faisal Faisal, F Faturrahman, Muhammad Fuad Muhajirin Farid Gita Sari Adriani Hikmawati, Lia Idris, Mochammad Juhriyansyah Dalle Karim, Ahsar Kasim Alfarisi Lestari, Anisha Ayu Lestia, Aprida Siska Maulida, Asna Meylan Miftahus Saadah, Miftahus Muhammad Ahsar Karim Muhammad Mahfuzh Shiddiq Nur Salam Nur Salam Nurul Dasima Astuti Nurul Huda Nurul Iftitah Oni Soesanto Putri Haidi, Melani Radityo, Radityo Rizqina, Sila Soesanto, Oni Sofyan Efendi Syahida, Nurul Tarapang, Angelina Novryance Thresye Thresye Widya Anggraini Yazid Halim, Ahmad Yuni Yulida Zahrotun Mu’alifah