DocumentCode
2035508
Title
Combined Simulated Annealing Algorithm for Logistics Network Design Problem
Author
Qin Jin ; Miao Li-xin
Author_Institution
Res. Center for Logistics, Tsinghua Univ., Shenzhen
fYear
2009
fDate
23-24 May 2009
Firstpage
1
Lastpage
4
Abstract
The essence of the logistics network design problems is to determine the location of the facility and the allocation of the demands of customers, which under the condition of the minimum of the cost. Based on the standard simulated annealing algorithm, an all-purpose combined simulated annealing algorithm(CSA) is presented for the logistics network design problem. The CSA is divided into two layers as inner layer and outer layer to solve the problem. The outer algorithm is optimization for the decision of the facility location, and the inner algorithm is optimization for the allocation of customer´s demand under the given decision of the outer algorithm. Applications of numerical examples with different scale denoted the algorithm is more effective than standard simulated annealing and other algorithms proposed to solve logistics network design problem.
Keywords
facility location; logistics; simulated annealing; logistics network design problem; optimization; simulated annealing algorithm; Algorithm design and analysis; Costs; Design engineering; Gravity; Logistics; Mixed integer linear programming; Simulated annealing; Telecommunication traffic; Traffic control; Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-3893-8
Electronic_ISBN
978-1-4244-3894-5
Type
conf
DOI
10.1109/IWISA.2009.5072784
Filename
5072784
Link To Document