Publication Type:

Journal Article

Source:

International Journal of Operational Research, Volume 14, Number 3, p.255-270 (2012)

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-84861884980&partnerID=40&md5=85caa606a912a5fc251c55ed1b6ffc2c

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 nondeterministic 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. Copyright © 2012 Inderscience Enterprises Ltd.

Notes:

cited By (since 1996)0

Cite this Research Publication

Pa Sivakumar, Ganesh, Kb, Anbuudayasankar, S. Pc, Punniyamoorthy, Md, and Koh, S. CeLenny, “Heuristic approach for balanced allocation problem in logistics: A comparative study”, International Journal of Operational Research, vol. 14, pp. 255-270, 2012.

207
PROGRAMS
OFFERED
5
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
9th
RANK(INDIA):
NIRF 2017
150+
INTERNATIONAL
PARTNERS