DocumentCode :
1754159
Title :
Study of Logistics Distribution Network Planning Based on Heuristic Algorithm
Author :
Juntao, Li ; Bingwu, Liu
Author_Institution :
Sch. of Inf., Beijing Wuzi Univ., Beijing, China
Volume :
1
fYear :
2011
fDate :
28-29 March 2011
Firstpage :
1129
Lastpage :
1133
Abstract :
A mixed integer programming model has been presented after analyzing the logistics distribution network planning problem. Then a heuristics solution procedure for this problem was given to simplify the model and solve the problem. The algorithm was actualized in terms of an expert evaluation method, the Covering model, the Floyd shortest path algorithm and linear programming. Finally, an example was solved based on this heuristic algorithm to prove its feasibility.
Keywords :
goods distribution; integer programming; linear programming; logistics; planning; Floyd shortest path algorithm; covering model; expert evaluation method; heuristic algorithm; linear programming; logistics distribution network planning problem; mixed integer programming model; Algorithm design and analysis; Heuristic algorithms; Linear programming; Logistics; Mathematical model; Planning; distribution network; heuristics algorithm; logistics; mixed integer programming;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Computation Technology and Automation (ICICTA), 2011 International Conference on
Conference_Location :
Shenzhen, Guangdong
Print_ISBN :
978-1-61284-289-9
Type :
conf
DOI :
10.1109/ICICTA.2011.284
Filename :
5750800
Link To Document :
بازگشت