Study on Network Design of Reverse Logistics Based on Simulated Annealing Algorithm
Hou Yun-zhang
Abstract
Hou Yun-zhang
Abstract
The development of reverse logistics makes the network design of logistics more complicated. This paper researches both the traditional and reverse logistics in a virtual company, and an MIP model is established to resolve the problem. With the help of simulated annealing and in comparison with the results of different parameters of the algorithm we get the locations of the facilities, the transportation route and the minimal cost of the model. Numerical results show that the simulated annealing has more efficiently in dealing with the net design problem of reverse logistics, which can get the project of network design during short time.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The development of reverse logistics makes the network design of logistics more complicated. This paper researches both the traditional and reverse logistics in a virtual company, and an MIP model is established to resolve the problem. With the help of simulated annealing and in comparison with the results of different parameters of the algorithm we get the locations of the facilities, the transportation route and the minimal cost of the model. Numerical results show that the simulated annealing has more efficiently in dealing with the net design problem of reverse logistics, which can get the project of network design during short time.
Key concepts: Simulated annealing, Reverse logistics, Network planning and design, Computer science, Algorithm, Mathematical optimization, Reverse engineering, Supply chain