A paper detailing the optimization of the HIV drug supply chain focuses on minimizing critical factors such as “Delivered to Client Date” and “Freight Cost (USD)”. The dataset incorporates a range of variables across 10,325 cases, encapsulating various elements of the supply chain from country management to shipment specifics and product details.
4.1. Response Surface Methodology Using MLP
The primary step in the optimization process was the development of predictive models utilizing an Artificial Neural Network (ANN) with a Multi-Layer Perceptron (MLP) architecture. Two distinct models were constructed:
A model for predicting “Freight Cost (USD)” as a function of “Line Item Quantity”, “Pack Price”, “Unit of Measure (Per Pack)”, and “Weight (Kilograms)”;
A model for predicting “delivery time” as a function of the same variables.
An MLP network was designed to accommodate the four selected design variables, followed by three hidden layers and an output layer (see
Figure 1). The first hidden layer contained 30 neurons, the second—20 neurons, and the third—10 neurons, each utilizing a nonlinear activation function to capture the complex relationships between inputs and outputs There is a single neuron for each model in the output layer, which corresponds to the “freight cost” and “delivery time”, respectively. A promising foundation has been established in the initial phase of the optimization process, which involves training and validating the model. In order to optimize the HIV drug supply chain, it is imperative to be able to predict “freight cost” and “delivery time” effectively. Following this section, we will examine the application of these models within the RSM framework to identify optimal conditions that minimize the objectives of the problem, thus improving supply chain efficiency and reliability.
It is crucial to understand the training progress of these models in order to determine their predictive capabilities and potential for optimization In training the “freight cost” model, the initial performance measure was 0.233, improving to a final value of 0.000481, near the target performance of 1 × 10−5. During training, the gradient, which is a measure of the error slope, started at 2.6 and decreased to 0.000151, which is satisfactory for understanding convergence. It took approximately 4 min and 13 s for the model to reach these results in over 30,000 epochs, indicating thorough training.
Comparatively, the “delivery time” model demonstrated an initial performance of 0.0659, which improved to 0.0019 after training. Although the final performance was not as close to the target as the “freight cost” model, the reduction in error suggests that the model can still provide valuable predictions for the optimization process. This model took slightly less time to train, taking 3 min and 54 s to complete the same number of epochs. As seen in the accompanying figures, these results illustrate the architecture of the MLP networks as well as the progression of the training process. As a graphical representation, the figures reinforce the quantitative results presented in the tables. It is evident from the results that the ANN MLP models have learned the underlying patterns in the dataset with a high degree of accuracy, as evidenced by the low post-training performance values. It is important to note that the success of these models depends upon the quality and preprocessing of the dataset, as well as the careful design of the neural network architecture. The training process is summarized in
Table 2, which presents the initial, stopped, and target values for key parameters such as performance, gradient, and validation checks
The training process visualizations for the two ANN MLP models demonstrate the behavior of the gradient descent algorithm over 30,000 epochs (see
Figure 2). The gradient, representing the optimization algorithm’s step size in adjusting network weights, diminishes over time in both figures, suggesting convergence toward a local minimum. The blue plots display the gradient values on a logarithmic scale, which helps to identify changes over several orders of magnitude. It can be seen that the gradient for the “freight cost” model steadily decreases to a final value of 0.00015117, indicating that the weights are approaching optimal values that minimize prediction error. In the lower subplot representing validation checks, there is a flat line at zero, indicating that no early stopping occurred, and the validation performance did not deteriorate throughout training. Additionally, the “delivery time” model exhibits a final gradient of 0.00021075, indicating a successful training phase. Validation checks show no upward spikes, indicating that the model did not experience overfitting and its performance on the validation set remained stable.
Figure 3 illustrate the correlation between the targets and the outputs of the trained neural network models, providing insight into the predictive performance of the models. In the first scatter plot, the “freight cost” model demonstrates a strong correlation between predicted and actual values, with a high correlation coefficient (R) of 0.92322. The data points are closely clustered around the line of perfect fit (Y = T), indicating a high level of predictive accuracy. This suggests that the model effectively captures the underlying patterns in the data, making accurate predictions for freight cost with minimal error. Such strong performance underscores the robustness of the model in handling this specific target variable.
Conversely, the second scatter plot reveals a weaker correlation between the predicted outputs and actual results for the “delivery time” model, with a significantly lower correlation coefficient (R) of 0.64324. In this case, the data points exhibit greater dispersion around the line of perfect fit, reflecting a less accurate predictive capability. The broader spread suggests that the model struggles to generalize well for this variable, potentially due to the higher complexity of the “delivery time” data or the presence of more noise and variability in the dataset. This finding highlights the need for further refinement of this model, possibly by incorporating additional features, fine-tuning hyperparameters, or applying advanced techniques to reduce noise and improve learning. Understanding these differences in performance is crucial for identifying areas where the models excel and where additional development is required to enhance predictive reliability.
In the “freight cost” model, the alignment between actual and predicted lines indicates that the model accurately captures the variation in freight costs. As a result of this congruence, the model can be used to estimate freight costs during the supply chain optimization process, demonstrating its reliability. While there is a wider spread between the actual and predicted delivery times in the “delivery time” model, it still indicates an acceptable level of prediction accuracy. While it may not capture all peaks and troughs of delivery times precisely, this model provides a solid baseline prediction. Combined with other optimization techniques or when additional nuanced factors are considered, this model may be valuable. As a result of their respective predictive strengths, both models provide a substantial foundation for improving decision-making in the HIV drug supply chain (see
Figure 4).
4.2. Optimization of Freight Cost and Delivery Time
To optimize the HIV drug supply chain, we focused on minimizing the combined metrics of “freight cost” (
f1) and “delivery time” (
f’). The objective function aims to maximize both the economic and temporal efficiency of the supply chain. The optimization constraints were determined based on the requirement that the design variables must be positive and exceed
α = 10% of their respective average values across the dataset. As a result, the solutions are feasible and significant in the context of the existing data. As a result, the constraints for the design variables “LineItemQuantity”, “PackPrice”, “UnitofMeasure”, and “weight” can be expressed mathematically as follows:
where
denotes the average value of that variable across the entire dataset. The standardized forms of these variables, which were scaled to lie between 0 and 1 for the ANN modeling phase, were subsequently used as inputs for the optimization algorithm. The objective function to be minimized was defined as Equation (2). Where f1 represents the standardized “freight cost”, and f2 represents the standardized “delivery time”. The function encapsulates the essence of the optimization goal, which is to reduce the cost and time of deliveries concurrently. The Fmincon function in MATLAB was employed for optimization, utilizing the “active-set” algorithm. This algorithm is particularly well-suited for dealing with problems that have a mix of bound constraints and linear constraints. The optimization options were meticulously set to fine-tune the performance of the algorithm, with “ScaleProblem” configured to “obj-and-constr” to normalize the scale of the objective function and constraints, “ConstraintTolerance” set to a stringent 1 × 10
−7 to ensure a precise adherence to the constraints, and “DiffMinChange”s adjusted to 1 × 10
−6 to control the minimum change in variables for the finite-difference gradients. Based on these methods and settings, the optimal standardized values for “LineItemQuantity”, “PackPrice”, “UnitofMeasur”, and “weight” were found to be the following:
The de-standardization process, which converts these values back to their original scales, yielded the following optimum non-standardized values:
These values are instrumental in achieving the optimized “freight cost” and “delivery time”. The application of the optimized variables led to the following results:
In our optimization framework, the constraints were carefully designed to ensure practical relevance and feasibility in real-world scenarios. Specifically, the constraints required that all design variables—Line Item Quantity, Pack Price, Unit of Measure (Per Pack), and Weight (Kilograms)—remain positive and exceed
of their respective average values across the dataset. Mathematically, these constraints were expressed as follows:
These constraints reflect the realities of supply chain logistics, ensuring that the optimization solutions remain realistic. For example, Line Item Quantity cannot drop below a practical minimum threshold without jeopardizing supply chain efficiency, while Pack Price must account for the minimum cost viability set by suppliers. Similarly, constraints on weight ensure that shipment volumes remain feasible for transportation modes.
According to the results, the optimized design variables are capable of resulting in substantial cost savings and efficiency improvements compared to the initial supply chain state. The study’s results demonstrate the power of combining ANN predictive models with optimization algorithms to address complex supply chain challenges. In addition to providing insight into the factors affecting “freight cost” and “delivery time”, the models also assist in the optimization process in order to discover feasible and efficient solutions. Moreover, these findings underscore the broader applicability of ANN-driven optimization frameworks in tackling complex supply chain challenges. The approach not only enhances operational efficiency but also provides a systematic method to balance competing objectives, such as cost minimization and timely delivery. The use of MATLAB’s Fmincon with a carefully configured “active-set” algorithm ensures precise adherence to constraints and fine-tuning of results, making the methodology robust and scalable. Future research can build on this foundation by integrating additional factors, such as supplier reliability, geopolitical risks, and environmental considerations, to further optimize supply chain operations. These results reaffirm the critical role of advanced predictive and optimization tools in supporting decision-making, ensuring the sustainable delivery of essential resources like HIV drugs in challenging and dynamic environments. The predictive accuracy of the ANN models was evaluated using additional metrics to provide a more comprehensive assessment. For the “freight cost” model, the following performance metrics were recorded: RMSE = 0.045; MAE = 0.032; and R2 = 0.923, indicating strong predictive accuracy and alignment with the actual values. The scatter plot confirms this, with data points closely clustered around the line of perfect fit, validating the model’s robustness in predicting freight costs.
Conversely, the “delivery time” model exhibited comparatively lower accuracy, with RMSE = 0.089, MAE = 0.065, and R2 = 0.643. These metrics suggest that this model struggled to capture the variability inherent in delivery times, potentially due to unmodeled external factors such as weather conditions, political stability, and logistical constraints. The broader dispersion of data points in the scatter plot further highlights these limitations. To improve the “delivery time” model’s accuracy, we propose the incorporation of additional features that reflect real-world variability. Sensitivity analysis on key variables, such as “Shipment Mode” and “Vendor INCO Term”, will also be conducted to assess their relative influence on delivery time predictions. These enhancements aim to refine the model’s predictive capability and address the current limitations.
The comparative analysis confirms that Fmincon balances computational efficiency and solution precision, making it an ideal choice for the healthcare supply chain optimization problem. While EAs are effective for highly complex problems, their computational cost and stochastic variability make them less suitable for scenarios requiring fast, reliable results. LP, on the other hand, is not a viable alternative for the nonlinear nature of this problem. This robust benchmarking demonstrates that our proposed approach offers a practical and scalable solution for dual-objective optimization, achieving meaningful improvements in freight cost and delivery time while maintaining computational efficiency. Future work can extend this comparison to other advanced techniques, such as hybrid optimization frameworks, to further validate our methodology.
Table 3 compares the proposed Fmincon-based optimization approach against baseline methods, including linear programming (LP) and evolutionary algorithms (EAs), highlighting differences in optimization type, computational efficiency, convergence behavior, interpretability, performance metrics, and practical applicability.