Md. Riad Hossen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Md. Riad Hossen has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Mohammed Forhad Uddin
Department of Mathematics , Bangladesh University of Engineering and Technology , Dhaka , Bangladesh , buet.ac.bd
3 shared publications - Hami Jafar Koushik
Department of Mathematics Bangladesh University of Engineering and Technology (BUET) Dhaka Bangladesh buet.ac.bd
2 shared publications - Abdul Hye
Department of Mathematics and Statistics, Bangladesh University of Business and Technology (BUBT), Dhaka, Bangladesh
1 shared publication - Atiqur Rahman
Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, United States of America; Department of Mathematics, Comilla University, Cumilla, Bangladesh
1 shared publication - Sumon Saha
Bangladesh University of Engineering and Technology
1 shared publication
Latest Publications
- Open Access
- 26 July 2026
- Published by Elsevier in Applications in Engineering Science
- Vol. 27
Thermal-hydraulic, irreversibility, and power spectrum analysis in MHD conjugate cooling around a heat-generating oscillating circular rod
- 26 July 2026
- Published by Elsevier in Applications in Engineering Science
- Vol. 27
Open AccessThermal-hydraulic, irreversibility, and power spectrum analysis in MHD conjugate cooling around a heat-generating oscillating circular rod
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2026 (1) , 4143352
A Four‐Compartment Dynamic Inventory Model for the Ready‐Made Garment Industry With an Inventory Reproduction Number
The ready‐made garment industry suffers from persistent inventory imbalance across its multistage production line: Some stages run short of materials, whereas others accumulate excess stock. Existing dynamic inventory models for this sector rarely address both problems together. In particular, none combines a compartmental representation of production stages with a single, dimensionless indicator that captures the overall balance between replenishment and consumption along the line. This paper develops such a framework. We formulate a four‐compartment dynamic model covering the cutting, sewing, finishing, and disposal sections as a system of four nonlinear ordinary differential equations within the mixing‐problem (MP) framework, with a susceptible–infected–recovered (SIR) inspired rework loop from finishing back to sewing. We prove that the model is well posed and solutions remain nonnegative for nonnegative initial data. In addition, the dynamics evolve inside a positively invariant region and the equilibrium is locally asymptotically stable. We define an inventory reproduction number R in via a next‐generation matrix; values below, equal to, and above unity correspond to depletion‐prone, balanced, and accumulation‐prone regimes, respectively. The stability of the equilibrium is shown. The model is calibrated against 5 months of production data from a Bangladeshi ready‐made garment exporter and a normalized‐forward sensitivity analysis of inventory reproduction number identifies the rework rate from finishing to sewing and the final‐output rate are the two parameters with the largest impact. The framework provides ready‐made garments managers with both a time‐resolved view of inventory across stages and a compact, interpretable threshold for diagnosing whether intervention is needed to avoid stockouts or surplus accumulation.
- 1 January 2026
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2026 (1) , 4143352
Open AccessA Four‐Compartment Dynamic Inventory Model for the Ready‐Made Garment Industry With an Inventory Reproduction Number
The ready‐made garment industry suffers from persistent inventory imbalance across its multistage production line: Some stages run short of materials, whereas others accumulate excess stock. Existing dynamic inventory models for this sector rarely address both problems together. In particular, none combines a compartmental representation of production stages with a single, dimensionless indicator that captures the overall balance between replenishment and consumption along the line. This paper develops such a framework. We formulate a four‐compartment dynamic model covering the cutting, sewing, finishing, and disposal sections as a system of four nonlinear ordinary differential equations within the mixing‐problem (MP) framework, with a susceptible–infected–recovered (SIR) inspired rework loop from finishing back to sewing. We prove that the model is well posed and solutions remain nonnegative for nonnegative initial data. In addition, the dynamics evolve inside a positively invariant region and the equilibrium is locally asymptotically stable. We define an inventory reproduction number R in via a next‐generation matrix; values below, equal to, and above unity correspond to depletion‐prone, balanced, and accumulation‐prone regimes, respectively. The stability of the equilibrium is shown. The model is calibrated against 5 months of production data from a Bangladeshi ready‐made garment exporter and a normalized‐forward sensitivity analysis of inventory reproduction number identifies the rework rate from finishing to sewing and the final‐output rate are the two parameters with the largest impact. The framework provides ready‐made garments managers with both a time‐resolved view of inventory across stages and a compact, interpretable threshold for diagnosing whether intervention is needed to avoid stockouts or surplus accumulation.
- Open Access
- 25 August 2025
- Published by EDP Sciences in International Journal for Simulation and Multidisciplinary Design Optimization
- Vol. 16, 11
Optimal algorithm of the traveling salesman problem for tourist location selection
This study explores the Traveling Salesman Problem (TSP) by applying both deterministic and stochastic algorithms. The deterministic algorithms include the Greedy Algorithm (GrA), Brute Force (BF), Branch and Bound (B&B), Dynamic Programming (DP), and Nearest Neighbor (NN), while the stochastic algorithms include Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing (SA), and Particle Swarm Optimization (PSO). The research addresses limitations in the practical application of optimization algorithms in the tourism industry by focusing on minimizing travel distance, time, and cost across eight tourist locations using multi-objective optimization. Unlike most studies that focus solely on theoretical models, this work offers a comprehensive real-world comparison of algorithm performance for tourism route planning. The analysis shows that BF, B&B, and DP achieve optimal results in distance, time, and cost. Among stochastic methods, SA performs competitively alongside GA and PSO for smaller datasets. Notably, DP emerges as the most practical solution for small to medium-sized TSP instances, balancing computational efficiency and optimality. This highlights DP's potential as an effective and efficient algorithm for real-world tourism applications, offering optimal solutions with minimal execution time.
- 25 August 2025
- Published by EDP Sciences in International Journal for Simulation and Multidisciplinary Design Optimization
- Vol. 16, 11
Open AccessOptimal algorithm of the traveling salesman problem for tourist location selection
This study explores the Traveling Salesman Problem (TSP) by applying both deterministic and stochastic algorithms. The deterministic algorithms include the Greedy Algorithm (GrA), Brute Force (BF), Branch and Bound (B&B), Dynamic Programming (DP), and Nearest Neighbor (NN), while the stochastic algorithms include Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing (SA), and Particle Swarm Optimization (PSO). The research addresses limitations in the practical application of optimization algorithms in the tourism industry by focusing on minimizing travel distance, time, and cost across eight tourist locations using multi-objective optimization. Unlike most studies that focus solely on theoretical models, this work offers a comprehensive real-world comparison of algorithm performance for tourism route planning. The analysis shows that BF, B&B, and DP achieve optimal results in distance, time, and cost. Among stochastic methods, SA performs competitively alongside GA and PSO for smaller datasets. Notably, DP emerges as the most practical solution for small to medium-sized TSP instances, balancing computational efficiency and optimality. This highlights DP's potential as an effective and efficient algorithm for real-world tourism applications, offering optimal solutions with minimal execution time.