Abstract
Facility Location decisions are part of the company’s strategy which are important due to significant investment and decision is usually irreversible. Facility locations are important because (a) it requires large investment that cannot be recovered, (b) decisions affect the competitiveness of the company, and (c) decisions affect not only costs but the company’s income (d) Customer satisfaction and trade off of decision based on service level. In a supply chain network design, facility locations (for example, warehouse, distributor, manufacturing, cross dock, or retailers locations) play an important role in driving efficient distribution planning and satisfying customer service level. The problem is to identify optimal set of facilities that can serve all the customer’s demand with given service level at minimal cost. This problem becomes complex when possible locations are not known (Green field problem) and cost is the major driver for selection of facilities. This paper addresses this problem in two parts (a) first, improving the existing methodology (clustering) to achieve optimum clustering solution. With improved clustering outcome, we get better set of facility locations to be installed for Greenfield scenario. (b) Second, extend solution towards mathematical optimization based on cost, demand, service level, priority of facilities and business-based constraints (Brown filed Problem). This solution will help in selecting the best set of available facility location respecting business constraint so that customer demand is met in cost. Clustering algorithm, improved Meta Heuristic and GLPK (Open Source package to solve LP/MILP Problems) based mathematical optimization has been developed in Java. Currently we are pursuing further research in this direction to improve network and facility decisions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rana, K. (1991). Order-picking in narrow-aisle warehouse. International Journal of Physical Distribution & Logistics Management, 20(2), 9–15.
Arun Prabha, K., & Saranya, R. (2011). Refinement of K-Means clustering using genetic algorithm. Journal of Computer Applications (JCA), IV(2).
Lin, C.-Y., & Chang, C.-C. (2005). A new density-based scheme for clustering based on genetic algorithm. Fundamenta Informaticae, 68, 315–331.
Cormier, G., & Gunn, E. A. (1992). A review of warehouse models. European Journal of Operational Research, 58(1), 3–13.
Boudahri, F., Bennekrouf, M., Belkaid, F., & Sari, Z. (2012). Application of a capacitated centered clustering problem for design of agri-food supply chain network. IJCSI International Journal of Computer Science Issues, 9(4), No 1.
Grabmeier, J., & Rudolph, A. (2002). Techniques of cluster algorithms in datamining. DataMining and Knowledge Discovery, 6, 303–360.
Maulik, U., & Bandyopadhyay, S. (2002). Performance evaluation of some clustering algorithms and validity indices. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(12), 1650–1654.
Huh, M.-H., & Lim, Y. B. (2009). Weighting variables in K-means clustering. Journal of Applied Statistics, 36(1), 67–78.
Marković, N., Ryzhov, I. O., & Schonfeld, P. (2017). Evasive flow capture: A multi-period stochastic facility location problem with independent demand. European Journal of Operational Research, 257(2), 353–704.
Roodbergen, K. J., & de Koster, R. (2001). Routing methods for warehouses with multiple cross aisles. International Journal of Production Research, 39(9), 1865–1883.
Tsai, C. Y., Liou, J. J., & Huang, T. M. (2008). Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time. International Journal of Production Research, 46(22), 6533–6555.
Zhang, G. Q., Xue, J., & Lai, K. K. (2002). A class of genetic algorithms for multiple-level warehouse layout Problems. International Journal of Production Research, 40(3), 731–744.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Saxena, A., Yadav, D. (2019). Multi-stage Greenfield and Brownfield Network Optimization with Improved Meta Heuristics. In: Balas, V., Sharma, N., Chakrabarti, A. (eds) Data Management, Analytics and Innovation. Advances in Intelligent Systems and Computing, vol 808. Springer, Singapore. https://doi.org/10.1007/978-981-13-1402-5_35
Download citation
DOI: https://doi.org/10.1007/978-981-13-1402-5_35
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1401-8
Online ISBN: 978-981-13-1402-5
eBook Packages: EngineeringEngineering (R0)