Cluster-Based Algorithm for Order Grouping Problem of Round Steel

Considering the feature of round steel enterprises with the contradiction between mass production size and the multi-variety and small-batch market demands, an order-grouping problem is studied with transportation optimization. Two objectives that to minimize the delivery destination difference and...

Full description

Saved in:
Bibliographic Details
Published inApplied Mechanics and Materials Vol. 488-489; no. Materials Science, Civil Engineering and Architecture Science, Mechanical Engineering and Manufacturing Technology; pp. 1371 - 1374
Main Authors Wang, Bai Lin, Li, Tie Ke, Wang, Lei, Xu, Shao Yun
Format Journal Article
LanguageEnglish
Published Zurich Trans Tech Publications Ltd 01.01.2014
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Considering the feature of round steel enterprises with the contradiction between mass production size and the multi-variety and small-batch market demands, an order-grouping problem is studied with transportation optimization. Two objectives that to minimize the delivery destination difference and delivery date difference are presented, and an algorithm improved k-means algorithm procedure is proposed to solve the problem. In this algorithm, a method is applied to generate representative initial centers of k-means algorithm for optimization. Experiment results show that the algorithm is feasible and effective.
Bibliography:Selected, peer reviewed papers from the 2014 International Conference on Advanced Engineering Materials and Architecture Science (ICAEMAS 2014), January 4-5, 2014, Xi’an, Shaanxi, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISBN:3037859768
9783037859766
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.488-489.1371