DocumentCode
2223961
Title
Genetic Local Search for Facility Location-Allocation Problem in Closed-Loop Supply Chains
Author
Yang Guang-zhi ; Ning Shu-shi ; Li Qing
Author_Institution
Transp. Manage. Coll., Dalian Maritime Univ., Dalian, China
fYear
2009
fDate
26-28 Dec. 2009
Firstpage
4316
Lastpage
4319
Abstract
The complexity of closed-loop supply chain makes the operation of logistics system more dependent on logistics network, so the facility location-allocation problem in closed-loop supply chains has been the most important problem in the supply chain management with reverse logistics. The Facility location-allocation problem in designing closed-loop supply chains is analyzed in this paper at first, and then the mathematical model is formulated. In the model the logistics network is shared by forward logistics and reverse logistics, and the demanded quantities is considered as stochastic variable. The objective of the model is to optimize the total cost of the closed-loop supply chain. Because the formulated model is NP-hard, genetic local search algorithm is designed to solve the problem. The local search is used in the algorithm to improve the search effectiveness. Simulations based on numerical examples show that the proposed mathematical model and the algorithm are effective.
Keywords
computational complexity; facility location; genetic algorithms; reverse logistics; search problems; stochastic programming; supply chain management; NP-hard; closed-loop supply chains; facility location-allocation problem; forward logistics; genetic local search algorithm; logistics system; mathematical model; reverse logistics; stochastic variable; supply chain management; Algorithm design and analysis; Costs; Genetics; Information science; Mathematical model; Reverse logistics; Stochastic processes; Supply chain management; Supply chains; Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science and Engineering (ICISE), 2009 1st International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-4909-5
Type
conf
DOI
10.1109/ICISE.2009.624
Filename
5455173
Link To Document