p.1348
p.1354
p.1358
p.1363
p.1371
p.1375
p.1379
p.1383
p.1387
Cluster-Based Algorithm for Order Grouping Problem of Round Steel
Abstract:
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.
Info:
Periodical:
Pages:
1371-1374
Citation:
Online since:
January 2014
Authors:
Price:
Сopyright:
© 2014 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: