Robust Optimization of the Hub Location Problem for Fresh Agricultural Products With Uncertain Demand

Abstract

Traditional hub location problems are usually based on deterministic circumstances. However, many uncertain factors can cause demand to vary in the long run, which increases the difficulty of strategic hub location planning. The hub location problem for fresh agricultural products is studied considering the perishability of the products and the uncertainty of customer demands. An uncertain demand variable is described by an affine function of the nominal mean and several independent uncertainty sources and is further adjusted by the deterioration rate. An uncapacitated robust hub location model for fresh agricultural products with uncertain demand is first established and solved using the Lagrangian relaxation approach. Then, a robust optimization model for the corresponding capacitated hub location problem is given. A numerical study based on the Australian Post data set (AP20) shows that the deterioration rate of fresh agricultural products, the uncertainty of demand and the degree of conservatism of decision makers all have significant impacts on the total transportation profit. Furthermore, the capacitated model yields more profit than the uncapacitated model because it allows the effects of the deterioration rate and uncertainty to be moderated through flow reallocation. The proposed models are useful for helping decision makers determine the locations and capacities of hubs for fresh agricultural products in accordance with different risk preferences.

The strategies of hub facility location and its utilization in managing the supply chain of perishable products for sustainability and uncertainty mitigation: A literature review

“…The paper offers a general framework where hub setup costs depend not only on hub location but also on the size of the area. In their study, (Li, 2022) investigated the hub location problem for fresh agricultural products, considering product perishability and uncertainty in customer demand. Initially, they explored and solved a capacityunconstrained model for locating hubs for fresh agricultural products with uncertain demand using the Lagrangean relaxation approach.…”

Aptenodytes forsteri optimization algorithm for low-carbon logistics network under demand uncertainty

“…A6. The vehicle specifications are the same [ 38 ], and the vehicle travels at a uniform speed during transportation [ 39 ].…”

“…dec (dec is a constant) is the decreasing value of the interval time of strategy I. gap min is the minimum trigger time interval of strategy I updates (gap min is a constant). The probability of adopting strategy III for the i-th penguin in the population in iteration period t is p i ; p i is calculated as in Eq (39), and the probability of adopting strategy II is p = 1 −p i .…”

“…We take supermarket retail logistics location distribution as an example from the data set of cargo demand reference Maoni [37].Taking the monthly demand of 42 stores in the region as the period, the demand points are numbered as 1, 2, 3. . .42 in order, and the logistics centers are also demand points according to the actual situation, and the demand points 12,17,24,26,29,35,38,39, and 42 are numbered as alternative logistics centers in order as P1, P2,. .…”

A Review on Optimal Energy Management of Multimicrogrid System Considering Uncertainties

“…In the approaches of the first category, referred to as stochastic programming, which need to assume uncertainty variables follow a predefined probability distribution and then we can transform it into a deterministic mathematical programming problem and solve it [31]. In the approaches of the second category, referred to as robust optimization, which can express the fluctuation range of the uncertain parameters by setting up an uncertain set and the robust optimization can generally obtain feasible solutions [32][33]. The third category called distributionally robust optimization which remedies the stochastic optimization's concreteness of probability information and robust optimization's ignorance of probability information is proposed to solve the uncertainties in MMG system [34][35].…”