Heuristic approach for balanced allocation problem in logistics: a comparative study

P. Sivakumar, K. Ganesh, S.P. Anbuudayasankar, M. Punniyamoorthy and S.C. Lenny Koh

International Journal of Operational Research, 2012, vol. 14, issue 3, 255-270

Abstract: The core issue of this paper is efficient balancing of allocation of customers among multiple distribution centres. Allocation involves clustering of customers in such a way that the associated resources in terms of cost and time are minimal. Ready solution to this problem could be through non-deterministic polynomial (NP)-hard type model. But NP-hard type model is inherently time consuming in arriving at an optimal solution. This paper compares the meta-heuristic genetic algorithm with an improvised heuristic scheme developed from the 2-opt heuristic model. Possible solutions for efficient clustering of customers are then proposed.

Keywords: logistics; balanced allocation; GAs; genetic algorithms; 2-opt heuristic; improvement heuristics; allocation balancing; multiple distribution centres; customer clustering. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=47090 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:14:y:2012:i:3:p:255-270

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().