DocumentCode
3198953
Title
Improved graph clustering algorithm for logistics company alliance building problem
Author
Li Ding ; Laisheng Xiang ; Xiyu Liu ; Chaochao Song
Author_Institution
Inst. of Manage. Sci. & Eng., Shandong Normal Univ., Jinan, China
Volume
2
fYear
2012
fDate
3-5 Aug. 2012
Firstpage
974
Lastpage
978
Abstract
Logistics company alliance building problem studies that how to build alliance with a method of great rate and low cost. It presents an improved algorithm about graph clustering base on PSO to solve the problem. Optimize the clustering result through PSO, and expand the solution space through disturbance strategies in order to obtain the optimal solution. Experimental result shows that the algorithm can solve the problem in a high rate and low cost.
Keywords
graph theory; logistics; particle swarm optimisation; PSO; disturbance strategies; improved graph clustering algorithm; logistics company alliance building problem; particle swarm optimization; Complexity theory; Company alliance; Discretization; Disturbance strategies; Graph clustering; PSO; The fourth party logistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology in Medicine and Education (ITME), 2012 International Symposium on
Conference_Location
Hokodate, Hokkaido
Print_ISBN
978-1-4673-2109-9
Type
conf
DOI
10.1109/ITiME.2012.6291465
Filename
6291465
Link To Document