The world suffers from the acute respiratory syndrome COVID-19 pandemic, which will be scary if other co-existing illnesses exacerbate it. The co-occurrence of the COVID-19 virus with kidney disease has not been available in the literature. So, further research needs to be conducted to reveal the transmission dynamics of COVID-19 and kidney disease. This study aims to create mathematical models to understand how COVID-19 interacts with kidney diseases in specific populations. Therefore, the initial step was to formulate a deterministic Susceptible-Infected-Recovered (SIR) mathematical model to depict the co-infection dynamics of COVID-19 and kidney disease. A mathematical model with seven compartments has been developed using nonlinear ordinary differential equations. This model incorporates the invariant region, disease-free and endemic equilibrium, along with the positivity solution. The basic reproduction number, calculated via the next-generation matrix, allows us to assess the stability of the equilibrium. Sensitivity analysis is also utilised to understand the influence of each parameter on disease spread or containment. The results show that a surge in COVID-19 infection rates and the existence of kidney disease significantly enhances the co-infection risks. Numerical simulations further clarify the potential outcomes of treating COVID-19 alone, kidney disease alone, and co-infected cases. The study of the potential model can be utilised to maximise the benefits of simulation to minimise the global health complexity of COVID-19 and kidney disease.
Efficient use of resources in production stages is very much important for every industry. For sustainable development of industry, efficacious management decision making techniques may be employed to analyze and utilize resources. Linear programming, as a quantitative decision-making tool, can be engaged by the managements for enhancing resource utilization along with increasing profit and decreasing cost. Proper allocation and usage of resources like available processing time at different stages, labors, materials such as fabrics and sewing threads is the tacit factor for profitability of an apparel manufacturing firm. Apparel processes such as cutting, sewing, washing, dying, trimming and finishing are needed to be optimized for lead time management. This study formulated a linear programming model to maximize profit and minimize cost of apparel industries. The model also optimizes the utilization of resources. This paper considers a knit garment manufacturing unit of Bangladesh which is situated in Gazipur district. Data containing monthly resources utilization amount, product volume, profit per unit on different types of products have been collected from the case industry. The data collected was used as the parameters of the proposed linear programming to validate the model. The model was implemented and solved by the Microsoft Excel Solver as well by AMPL. This research revealed that the profit of the case company can be increased by 22% when there is sufficient demand and that can be 12.33% when clients’ requests are to be met. On the other hand, cost may be decreased by 37% by using the LPP model.
25 August 2025 in International Journal for Simulation and Multidisciplinary Design Optimization
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.
1 January 2016 in Yugoslav Journal of Operations Research
This paper presents a model that deals with a vendor-buyer multi-product, multi-facility and multi-customer location selection problem, which subsume a set of manufacturer with limited production capacities situated within a geographical area. We assume that the vendor and the buyer are coordinated by mutually sharing information. We formulate Mixed Integer Linear Fractional Programming (MILFP) model that maximize the ratio of return on investment of the distribution network, and a Mixed Integer Program (MIP), used for the comparison. The performance of the model is illustrated by a numerical example. In addition, product distribution and allocation of different customers along with the sensitivity of the key parameters are analyzed. It can be observed that the increment of the opening cost decreases the profit in both MILFP and MIP models. If the opening cost of a location decreases or increases, the demand and the capacity of that location changes accordingly.