Syahril Efendi
Universitas Sumatera Utara, North Sumatera, Indonesia

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

Found 3 Documents
Search

Hybrid MINLP-FNS Framework for Solving Large-Scale LIRP in E-Retail Logistics Kristian Telaumbanua; Syahril Efendi; Poltak Sihombing; Maya Silvi Lydia
Journal of Applied Data Sciences Vol 7, No 3: September 2026
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v7i3.1114

Abstract

This research proposes a hybrid optimization framework to address the large-scale, multi-echelon Location-Inventory-Routing Problem (LIRP) in e-retail logistics. The proposed method combines a Mixed-Integer Nonlinear Programming (MINLP) model with a tailored Feasible Neighborhood Search (FNS) algorithm to solve complex decision-making problems involving facility location, inventory control, and vehicle routing simultaneously. Distinct from conventional models, the framework is integrated with a Business Intelligence (BI) environment to enable real-time decision support and dynamic data processing. Experimental evaluations were conducted using realistic logistics scenarios involving four distribution echelons. The results show that the hybrid MINLP-FNS approach achieves a total logistics cost reduction of 13.6% and a runtime improvement of 48% compared to the baseline MINLP-only model. It also significantly outperforms traditional GRG-based methods in scalability and computational stability across large datasets. These findings demonstrate that the proposed hybrid framework offers a more effective and scalable solution for complex logistics optimization, while its BI integration ensures practical applicability in real-world operations. This study contributes a novel data-driven framework that advances current research in intelligent supply chain and optimization systems.
Hybrid MINLP-FNS Framework for Solving Large-Scale LIRP in E-Retail Logistics Kristian Telaumbanua; Syahril Efendi; Poltak Sihombing; Maya Silvi Lydia
Journal of Applied Data Sciences Vol 7, No 3: September 2026
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v7i3.1114

Abstract

This research proposes a hybrid optimization framework to address the large-scale, multi-echelon Location-Inventory-Routing Problem (LIRP) in e-retail logistics. The proposed method combines a Mixed-Integer Nonlinear Programming (MINLP) model with a tailored Feasible Neighborhood Search (FNS) algorithm to solve complex decision-making problems involving facility location, inventory control, and vehicle routing simultaneously. Distinct from conventional models, the framework is integrated with a Business Intelligence (BI) environment to enable real-time decision support and dynamic data processing. Experimental evaluations were conducted using realistic logistics scenarios involving four distribution echelons. The results show that the hybrid MINLP-FNS approach achieves a total logistics cost reduction of 13.6% and a runtime improvement of 48% compared to the baseline MINLP-only model. It also significantly outperforms traditional GRG-based methods in scalability and computational stability across large datasets. These findings demonstrate that the proposed hybrid framework offers a more effective and scalable solution for complex logistics optimization, while its BI integration ensures practical applicability in real-world operations. This study contributes a novel data-driven framework that advances current research in intelligent supply chain and optimization systems.
SAGOMECON: An Adaptive ε-Constraint-Based Optimization Method for Multi-Criteria Decision-Making in Collaborative Industrial Networks M Mesran; Poltak Sihombing; Syahril Efendi; Muhammad Zarlis
Journal of Applied Data Sciences Vol 6, No 4: December 2025
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v6i4.941

Abstract

In collaborative industrial networks, decision-making processes often involve conflicting objectives such as minimizing operational costs and risks, while simultaneously maximizing efficiency and inter-organizational collaboration. Existing multi-objective optimization methods, including the ε-constraint and its variants, face significant challenges in handling dynamic constraints and achieving computational efficiency in real-world scenarios. To address these limitations, this study introduces SAGOMECON (Simplified Adaptive Optimization with Modified ε-Constraint), an enhanced optimization approach designed to support adaptive and efficient multi-criteria decision-making in dynamic environments. SAGOMECON extends the conventional SAUGMECON framework by incorporating real-time constraint updates, adaptive slack handling, and iterative refinement mechanisms, enabling it to maintain solution feasibility under shifting priorities and evolving operational conditions. The proposed method was evaluated using simulated datasets representing partner selection scenarios in collaborative networked organizations (CNOs). Comparative analysis against the traditional ε-constraint and SAUGMECON methods demonstrates that SAGOMECON consistently delivers Pareto-optimal solutions with reduced computational time and superior adaptability to dynamic changes. The findings suggest that SAGOMECON offers a practical and scalable solution for decision-makers in collaborative industrial settings, particularly where trade-offs between competing objectives must be navigated under uncertainty. This contribution is significant for industries seeking intelligent optimization strategies that align with agile and data-driven decision-making frameworks.