Package balancing k-means algorithm for physical distribution
by Yinglong Dai; Wang Yang; Guojun Wang
International Journal of Computational Science and Engineering (IJCSE), Vol. 14, No. 4, 2017

Abstract: As the express delivery service is flourishing, it is a challenge to assign a set of tasks to a set of carriers, as it has to aggregate the neighbour tasks to a carrier and keep the loads of carriers balanced simultaneously. K-means clustering algorithm is an effective way to split the delivery tasks. However, it cannot solve the load balancing problem. This paper proposes an extended clustering algorithm - package balancing k-means. It adding the weight metric to the standard k-means algorithm to achieve load balancing. Analyses and experiments show that package balancing k-means can solve the load balancing clustering problem efficiently. Moreover, experiments show that the extended algorithm can achieve faster convergence.

Online publication date: Wed, 21-Jun-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com