A dynamic location problem of the sugar cane loading station and problems of clustering sugar cane growers

Abstract

This paper formulates a dynamic location problem of the sugar cane loading station and
problems of clustering sugar cane growers by using Clustering Method. The objective of clustering
sugar cane growers problem is to minimize the travel distance between the sugar cane growers to
the sugar cane loading station. Whereas the total cost is minimized in the dynamic problem over a
given planning horizon by considering the tradeoff between the transportation cost consisting of the
cost between the sugar cane growers to the sugar cane loading station and the sugar cane growers to
the sugar cane mill and the rearrangement cost of sugar cane loading station.