{'fraction_non_alphanumeric': 0.020640569395017794, 'fraction_numerical': 0.0, 'mean_word_length': 5.5092592592592595, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Improved Simulated Annealing Based Network Model for E-Recycling Reverse Logistics Decisions under Uncertainty

Electronic waste recycle (e-recycling) is gaining increasing importance due to greater environmental concerns, legislation, and corporate social responsibility. A novel approach is explored for designing the e-recycling reverse logistics network (RLN) under uncertainty. The goal is to obtain a solution, i.e., increasing the storage capacity of the logistics node, to achieve optimal or near-optimal profit under the collection requirement set by the government and the investment from the enterprise. The approach comprises two parts: a matrix-based simulation model of RLN formed for the uncertainty of demand and reverse logistics collection which calculates the profit under a given candidate solution and simulated annealing (SA) algorithm that is tailored to generating solution using the output of RLN model. To increase the efficiency of the SA algorithm, network static analysis is proposed for getting the quantitative importance of each node in RLN, including the static network generation process and index design. Accordingly, the quantitative importance is applied to increase the likelihood of generating a better candidate solution in the neighborhood search of SA. Numerical experimentation is conducted to validate the RLN model as well as the efficiency of the improved SA.