cover
Contact Name
Rusliadi
Contact Email
garuda@apji.org
Phone
+6285642100292
Journal Mail Official
fatqurizki@apji.org
Editorial Address
Jln. Perum Cluster G11 Nomor 17 Jl. Plamongan Indah, Pedurungan, Semarang, Provinsi Jawa Tengah, 50195
Location
Kota semarang,
Jawa tengah
INDONESIA
International Journal of Applied Mathematics and Computing.
ISSN : 30481988     EISSN : 3047146X     DOI : 10.62951
Core Subject : Science, Education,
This Journal accepts manuscripts based on empirical research, both quantitative and qualitative. This journal is a peer-reviewed and open access journal of Mathematics and Computing
Articles 4 Documents
Search results for , issue "Vol. 2 No. 3 (2025): July : International Journal of Applied Mathematics and Computing" : 4 Documents clear
Application of Conjoint Analysis with Attributes Determined Against the Selection of Expedition Services Putu Rama Hari Bagaskara P.; Ni Luh Putu Suciptawati; Made Susilawati
International Journal of Applied Mathematics and Computing Vol. 2 No. 3 (2025): July : International Journal of Applied Mathematics and Computing
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/ijamc.v2i3.201

Abstract

This study aims to determine the level, attribute, and stimulus most considered by respondents in choosing expedition services. The method used is conjoint analysis by applying the conjoint analysis full-profile method to design the stimulus. The attributes and levels used are delivery type (ECO, REG, express, and same day), payment methods (cash and online transfers), service promotions (cost discounts and goods pick-up), and service responsiveness (responses to damage or loss of goods and responses to late delivery). The results of research conducted on 150 respondents showed that delivery type is the most preferred attribute with a value of 0,324. The levels with the largest part-worth of each attribute are REG (0.335), online transfers (0.210), cost discounts (0.270), and response to damage or loss of goods (0.250). The most popular stimulus is expedition services with standard shipping (REG), online transfers, cost discounts, and responses to damage or loss of goods.
Identification of Risk Factors for Chronic Kidney Disease Using Binary Logistic Regression Kosasih, Eva; Asmara Santhi, Ni Kadek Wulanda; Febriyanti, Ni Wayan Atik; Br Barus, Eka Valencia; Susilawati, Made
International Journal of Applied Mathematics and Computing Vol. 2 No. 3 (2025): July : International Journal of Applied Mathematics and Computing
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/ijamc.v2i3.222

Abstract

Chronic Kidney Disease (CKD) is a major global health issue that can lead to serious complications and long-term medical care. This study aims to identify key clinical factors associated with CKD status using binary logistic regression analysis. The dataset, obtained from Kaggle, contains 400 patient records with various clinical and demographic attributes. The dependent variable is CKD status (positive or negative), while the independent variables include age, blood pressure, hemoglobin level, urine albumin level, and serum creatinine. Initial analysis involved descriptive statistics and multicollinearity checks, followed by model estimation and evaluation using likelihood ratio and Wald tests. The final model identified four significant predictors: blood pressure, hemoglobin, urine albumin, and serum creatinine. The model achieved a high classification accuracy of 95.50% and an Area Under the ROC Curve (AUC) of 98.78%, indicating excellent predictive performance. These results highlight the importance of these clinical indicators in early CKD detection and support their use in risk assessment models for kidney disease screening Keywords: Chronic Kidney Disease, Binary Logistic Regression, Likelihood Ratio Test, Wald Test, Classification Accuracy
Using Mathematical Programming to Analyze and Improve Robust Queue Management in Healthcare Systems Hasanain Hamed Ahmed
International Journal of Applied Mathematics and Computing Vol. 2 No. 3 (2025): July : International Journal of Applied Mathematics and Computing
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/ijamc.v2i3.229

Abstract

Efficient management of patient queues is essential in healthcare systems to ensure timely care, optimize resource utilization, and enhance patient satisfaction. Mathematical programming, particularly when applied in conjunction with queuing theory and optimization models, provides a rigorous framework for analyzing and improving healthcare service delivery. This approach involves modeling arrivals and service processes, applying queuing models (such as single-server, multi-server, and priority queues), and formulating optimization objectives—often to minimize total costs, patient waiting times, or resource idling. Recent research demonstrates that combining queuing theory with mixed-integer programming and simulation techniques enables healthcare managers to allocate resources dynamically, set staffing levels, and assign priorities among different patient categories. For example, the use of mixed-integer programming can determine the optimal number of servers, beds, and service rates based on patient flow and priority needs, striking a balance between reducing waiting times for critical cases and controlling operational costs. These mathematical models also account for practical constraints and stochastic variability inherent in clinical settings. Applications span emergency departments, outpatient clinics, and even pharmacy and blood service centers—showing significant improvements in system efficiency, reduced patient wait times, and enhanced overall care quality. Thus, mathematical programming is a powerful decision-support tool for queue management, offering evidence-based strategies to address congestion and resource allocation challenges in complex healthcare environments.
Algorithmic Simulation for Optimization in Combinatorial Mathematics Using Heuristic Techniques Ahmad Budi Trisnawan; Syed Asif Ali; Erlita Sulistiati
International Journal of Applied Mathematics and Computing Vol. 2 No. 3 (2025): July : International Journal of Applied Mathematics and Computing
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/ijamc.v2i3.274

Abstract

This research explores the effectiveness of heuristic techniques for solving combinatorial optimization problems, with a particular focus on the Traveling Salesman Problem (TSP). Combinatorial optimization is a critical area of study, especially in fields like computer science, engineering, and economics, where finding optimal solutions from a finite set of possibilities is crucial. However, the NP-hard nature of many combinatorial problems, such as the TSP, makes traditional exact methods like Branch-and-Bound and Dynamic Programming computationally expensive and inefficient for larger problem sizes. The primary objective of this research is to evaluate the performance of heuristic methods, including Simulated Annealing (SA), Genetic Algorithms (GA), and Iterative Computation techniques, such as Tabu Search (TS) and Particle Swarm Optimization (PSO). These methods are tested for their ability to provide approximate solutions efficiently. The findings reveal that while ACO provided the best solution quality, it had the longest runtime. TS was the fastest, though with slightly lower solution quality. SA and GA demonstrated a balance between solution quality and computational efficiency, but their performance heavily depended on parameter tuning. The hybridization of SA and GA showed potential for improving solution quality but introduced additional complexity. The research concludes that heuristic methods, especially when combined, offer viable solutions for large-scale combinatorial optimization problems, though the trade-off between solution quality and computational time must be considered when selecting an algorithm.

Page 1 of 1 | Total Record : 4