The recycling and reuse of discarded express delivery cartons can yield environmental, economic, and social benefits. A key factor influencing the volume of express packaging collected is the uncertainty in the total amount of such packaging within the service range of each collection point. Additional uncertainties include the costs associated with the construction of recycling stations, operational expenses, transportation costs, additional recycling fees, and government subsidies. To address the issue of express packaging recycling, a fuzzy integer programming model for the reverse logistics network of express packaging is constructed. The model aims to minimise the total network cost and maximise the total recycling rate while enabling decisions regarding the location of recycling facilities and the flow between facilities. Then, a memetic algorithm based on dynamic local search is designed. Several alternative solution approaches were considered to evaluate the proposed algorithm, including the precision optimization method (CPLEX) and a hybrid priority-based genetic algorithm. The results confirm the feasibility of the memetic algorithm. Finally, the applicability of this fuzzy programming model is analysed and validated by changing the confidence level. The case study results reveal quantifiable trade-offs: as the confidence level (α) increases from 0.75 to 0.90 under a fixed recycling rate threshold (ε = 80%), the total network cost rises approximately linearly, while the required number of recycling stations increases, with their average facility level upgrading accordingly. Variations in confidence levels and the degree of total recycling rate achievement can significantly influence the increase in target values. Moreover, the magnitude of this influence exhibits irregularity, indicating that changes in confidence levels entail a certain degree of risk.
Kun Wang (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: