IDEAS home Printed from https://ideas.repec.org/a/hin/jjmath/3381870.html
   My bibliography  Save this article

Neutrosophic Simulated Annealing Algorithm and Its Application in Operation Optimization in Dangerous Goods Warehouse

Author

Listed:
  • Fangwei Zhang
  • Zhenrui Chen
  • Jun Ye
  • Bing Han
  • Sheng Du

Abstract

In the classical simulated annealing algorithm (SAA), the iteration feasible solution is mainly based on a certain random probability. In the process of iteration, there is a lack of comparison between individuals and the whole population of feasible solutions, and the indicators to measure the change of state of individuals are too absolute to achieve the overall control of the algorithm. To deal with uncertain information that individuals encounter in iteration, this study introduces the idea of neutrosophic decision-making and establishes a kind of neutrosophic fuzzy set (NFS) to describe the time-varying iterative state of individuals according to the change of individual state, the change of population state, and the number of iteration. The biggest feature of this study is to propose a neutrosophic simulated annealing algorithm that combines the idea of NFS with simulated annealing. The biggest contribution of this study is to propose a novel entropy measurement method using the NFS and combine it with the simulated annealing algorithm to handle the optimization process. Finally, the effectiveness of the novel algorithm is verified by an example of warehouse optimization.

Suggested Citation

  • Fangwei Zhang & Zhenrui Chen & Jun Ye & Bing Han & Sheng Du, 2022. "Neutrosophic Simulated Annealing Algorithm and Its Application in Operation Optimization in Dangerous Goods Warehouse," Journal of Mathematics, Hindawi, vol. 2022, pages 1-12, June.
  • Handle: RePEc:hin:jjmath:3381870
    DOI: 10.1155/2022/3381870
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2022/3381870.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/jmath/2022/3381870.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/3381870?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jjmath:3381870. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.