Nature Inspired heuristic approach to balance the resource in the multiple distribution centers

Abstract

This paper deals with the balanced allocation of customers to multiple distribution centers. Allocation problem generally deals with clustering of customers so as to achieve minimum total resource viz. cost or time. But the real challenge arises when it is required to strike a balance between the allocation while also minimizing the total cost or time. Since the problem develops to be NP-hard, the paper uses heuristic method to solve. This paper deals with the balanced allocation of customers to multiple distribution centers and also the paper challenges the requirement of Genetic algorithm against the usage of a relatively simple improvement heuristic developed based on the existing 2-opt heuristic. The balanced solution is achieved by using the min-max function. The two heuristics are compared using both existing and simulated data-sets.