Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)

Benchmarking Metaheuristic Algorithms Against Optimization Techniques for Transportation Problem in Supply Chain Management Xin Ying, Felicia Lim; Sufahani, Suliadi Firdaus
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 9 No 3 (2025): June 2025
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v9i3.6513

Abstract

The optimization of transportation problems plays a significant role in supply chain management (SCM), where minimizing costs and improving efficiency are mandatory. The transition from manual methods to advanced computational approaches, such as metaheuristic algorithms, enhances decision-making and consolidates operations within SCM. Malaysia's transportation system has been confronting crucial challenges, characterized by congested roadways, limited rail connectivity and inefficient port operations, which interfere with the fluidity of goods and supply chain efficiency. This highlights the critical need for optimization techniques to enhance competitiveness and efficiency in the evolving SCM landscape. The research aims to explore the application of metaheuristic algorithms, with the Modified Distribution (MODI) method as the benchmark while employing the NorthWest Corner Method (NWCM) to obtain an initial feasible solution, to evaluate their performance in optimizing transportation problems. Metaheuristic algorithms, specifically Simulated Annealing (SA) and Particle Swarm Optimization (PSO), are implemented to explore alternative near-optimal solutions and assess the performance in terms of cost accuracy and computational efficiency. The results indicate that SA achieves a deviation of 12.92% in cost accuracy compared to the optimal MODI method, making it suitable for scenarios where precision is critical, whereas PSO which is 296.92 seconds faster, is ideal for time-sensitive applications. Finally, this study encourages future studies to explore additional algorithms, external factors and broader applications for enhanced real-world relevance and scalability to accentuate the potential of metaheuristic algorithms.
Optimizing Menu Planning for Children with Autism Using Improved Multi-Goal Programming Model Mohd Rashid, Nur Rasyida; Sufahani, Suliadi Firdaus; Hamzaid, Nur Hana
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 9 No 4 (2025): August 2025
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v9i4.6649

Abstract

Menu planning for every individual is essential to obtain a balanced and healthy food intake for growth and development. Children with Autism Spectrum Disorders (ASD) face more feeding difficulties than their peers due to neurodevelopmental disorders such as social skills problems and repetitive behaviors. They also tended to refuse or be selective for certain food intakes. Proper menu planning for children with ASD is important to maintain their overall well-being and mitigate autism-related dietary issues. The manual menu planning for children with ASD does not consider proper nutritional intake, food variation, or total cost minimization. Currently, the application of mathematical modelling for menu planning in children with ASD is limited. Thus, this study aims to explore the extent to which the optimization approach can solve the menu planning problem with more than one objective. Finally, this research constructed daily menu planning for children with ASD, which indicates the feasibility of utilizing the Improved GP (IGP) model compared to the Goal Programming model (GP) in terms of the value for the deviational variables for the unachieved goals. The unachieved deviational variables by IGP model for Day-2 had decreased by 17.69% and by 34.43 % on Day-3. The total cost of the IGP model is also less than RM 0.50 of the GP model.
Optimization Techniques and Programming for Developing Cost-Effective and Balanced Diet Schedules for Preschoolers Mohd Lip, Norliana; Sufahani, Suliadi Firdaus; Mohd Fahmi Teng, Nur Islami
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 9 No 5 (2025): October 2025
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v9i5.6650

Abstract

Proper nutrition is important for the growth, motor and cognitive development of young children since the foods consumed determine how well-rounded a child's diet is. However, preschool menu planning is complex because it requires balancing multiple constraints such as cost, dietary guidelines, and food variety. This study introduces a computational approach to menu planning for preschools through Linear Programming (LP), Integer Programming (IP), and Binary Programming (BP). This study highlights algorithmic design, constraint modelling, and computational efficiency in solving optimization problems, rather than focusing primarily on dietary outcomes. The models were tested using Malaysian food database to evaluate both feasibility and efficiency. The findings indicate that all models successfully fulfilled the Recommended Nutrient Intakes (RNI 2017) for children aged 4 to 6, ensuring adequate levels of energy, protein, calcium, carbohydrates, and fat. In terms of cost, the LP model was the most economical at RM4.20 per day, but impractical due to fractional servings. The IP model produced a more realistic balance between cost and practicality at RM4.40 per day. The BP model generated the most diverse and implementable menus at RM5.00 per day, though at a higher cost. Overall, these optimization methods provide decision-support tools for enhancing the efficiency of preschool menu planning.