05872754

j

05872754 Alenezy, Eiman Jadaan Al-Dubaibi, Aisha Alhamad, Khalid Moh. Greedy heuristics to solve the capacitated facility location problem. Far East J. Appl. Math. 48, No. 2, 141-154 (2010). 2010 Pushpa Publishing House, Allahabad, Uttar Pradesh, India EN FLP CFLP UCFLP greedy heuristics cut off point

http://pphmj.com/abstract/5518.htm

Summary: The facility location problem has been the focus of much research in the Operational Research literature. We investigate solution approaches for large instances of the capacitated facility location problem (CFLP). We introduce a new tightening constraint and dual estimates that lead to improved lower bounds (LB). In our computer environment, we describe a number of greedy heuristics that provide good upper bound solutions with a lower bound from a comparative point of view. We show that for small instances of the CFLP, it is effective to have very tight linking constraints. We report results that illustrate the trade off between these constraints, solution time, and solution quality. We detail some techniques that improve the computational running time with no loss in solution quality. Also we show through solving larger instances of the CFLP that our algorithm scales up well in terms of both computational time and solution quality. Moreover, we develop a sparse technology technique in implementing our algorithm and a flexible computer environment.