MHMd. Riad Hossen

Md. Riad Hossen

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Open Access

    A Four‐Compartment Dynamic Inventory Model for the Ready‐Made Garment Industry With an Inventory Reproduction Number

    by Hami Jafar Koushik, Md. Riad Hossen, Mohammed Forhad Uddin

    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

    Optimal algorithm of the traveling salesman problem for tourist location selection

    by Riad Hossen, Hami Jafar Koushik, Mohammed Forhad Uddin, Atiqur Rahman, Abdul Hye

    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.