Improved simulated annealing based network model for E-recycling reverse logistics decisions under uncertainty (Q1720913)

From MaRDI portal





scientific article; zbMATH DE number 7018969
Language Label Description Also known as
default for all languages
No label defined
    English
    Improved simulated annealing based network model for E-recycling reverse logistics decisions under uncertainty
    scientific article; zbMATH DE number 7018969

      Statements

      Improved simulated annealing based network model for E-recycling reverse logistics decisions under uncertainty (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      8 February 2019
      0 references
      Summary: 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.
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references