Abstract
Determining optimum places for the facilities and optimum transportation from existing sites to the facilities belongs to the main problems in supply chain management. The solid transportation-p-facility location problem (ST-p-FLP) is an integration between the facility location problem and the solid transportation problem (STP). This paper delineates the ST-p-FLP, a generalization of the classical STP in which location of p-potential facility sites are sought so that the total transportation cost by means of conveyances from existing facility sites to potential facility sites will be minimized. This is one of the most important problems in the transportation systems and the location research areas. Two heuristic approaches are developed to solve such type of problem: a locate-allocate heuristic and an approximate heuristic. Thereafter, the performance of the proposed model and the heuristics are evaluated by an application example, and the obtained results are compared. Moreover, a sensitivity analysis is introduced to investigate the resiliency of the proposed model. Finally, conclusions and an outlook to future research works are provided.
Similar content being viewed by others
References
Amin SH, Baki F (2017) A facility location model for global closed-loop supply chain network design. Appl Math Model 41:316–330
Bieniek M (2015) A note on the facility location problem with stochastic demands. Omega 55:53–60
Chen D, He C, Wu S (2016) Single facility collection depots location problem with random weights. Oper Res Int J 16(2):287–299
Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6:37–53
Dohse ED (1996) Using transportation solutions for a facility location problem. Comput Ind Eng 31(1–2):63–66
Ebrahimnejad A (2011) Sensitivity analysis in fuzzy number linear programming problems. Math Comput Model 53:1878–1888
Farahani RZ, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies. Physica-Verlag, Heidelberg
Farahani RZ, SteadieSeifi M, Asgari N (2010) Multiple criteria facility location problems: a survey. Appl Math Model 34:1689–1709
Haley KB (1962) New methods in mathematical programming—the solid transportation problem. Oper Res 10(4):448–463
Hua G, Wang S, Chan CK, Hou SH (2009) A fractional programming model for international facility location. J Ind Manag Optim 5(3):629–649
Jia H, Ordóñez F, Dessouky MM (2007) Solution approaches for facility location of medical supplies for large-scale emergencies. Comput Ind Eng 52(2):257–276
Jiménez F, Verdegay JL (1998) Uncertain solid transportation problems. Fuzzy Sets Syst 100:45–57
Klibi W, Lasalle F, Martel A, Ichoua S (2010) The stochastic multiperiod location transportation problem. Transp Sci 44(2):221–237
Labbé M, Thisse J-F, Wendell RF (1991) Sensitivity analysis in minisum facility location problems. Oper Res 39(6):961–969
Larson RC, Brandeau M (1986) Extending and applying the hypercube queueing model to deploy ambulances in Boston. In: Swersey A, Ignall E (eds) Delivery of urban services. North Holland, New York
Li G, Wang Z, Xu D (2012) An approximation algorithm for the k-level facility location problem with submodular penalties. J Ind Manag Optim 8(3):521–529
Love R, Morris J, Wesolowsky G (1995) Facility location: models and methods. Springer, Berlin
Mahapatra DR, Roy SK, Biswal MP (2013) Multi-choice stochastic transportation problem involving extreme value distribution. Appl Math Model 37(4):2230–2240
Maity G, Roy SK (2014) Solving multi-choice multi-objective transportation problem: a utility function approach. J Uncertain Anal Appl 2(1):11. https://doi.org/10.1186/2195-5468-2-11
Maity G, Roy SK (2017) Solving fuzzy transportation problem using multi-choice goal programming. Discrete Math Algorithms Appl 9(06):1750076
Maity G, Roy SK, Verdegay JL (2016) Multi-objective transportation problem with cost reliability under uncertain environment. Int J Comput Intell Syst 9(5):839–849
Melo MT, Nickel S, Saldanha-da-Gama F (2009) Facility location and supply chain management—a review. Eur J Oper Res 196(2):401–412
Midya S, Roy SK (2014) Solving single-sink, fixed-charge, multi-objective, multi-index stochastic transportation problem. Am J Math Manag Sci 33(4):300–314
Midya S, Roy SK (2017) Analysis of interval programming in different environments and its application to fixed-charge transportation problem. Discrete Math Algorithms Appl 9(03):1750040
Mis̆ković S, Stanimirović Z, Grujic̆ić I (2017) Solving the robust two-stage capacitated facility location problem with uncertain transportation costs. Optim Lett 11(6):1169–1184
Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
Roy SK, Maity G (2017) Minimizing cost and time through single objective function in multi-choice interval valued transportation problem. J Intell Fuzzy Syst 32(3):1697–1709
Roy SK, Maity G, Weber GW (2017a) Multi-objective two-stage grey transportation problem using utility function with goals. Cent Eur J Oper Res 25(2):417–439
Roy SK, Maity G, Weber GW, Gök SZA (2017b) Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal. Ann Oper Res 253(1):599–620
Roy SK, Ebrahimnejad A, Verdegay JL, Das S (2018) New approach for solving intuitionistic fuzzy multi-objective transportation problem. Sadhana 43(1):3. https://doi.org/10.1007/s12046-017-0777-7
Saif A, Elhedhli S (2016) A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem. Optim Lett 10(5):1087–1100
Shell E (1955) Distribution of a product by several properties. In: Directorate of Management Analysis. Proceedings of the 2nd symposium on linear programming, vol 2, pp 615–642
Sherali HD, Tuncbilek CH (1992) A squared-Euclidean distance location-allocation problem. Naval Res Logist 39:447–469
Tadei R, Perboli G, Ricciardi N, Baldi MM (2012) The capacitated transshipment location problem with stochastic handling utilities at the facilities. Int Trans Oper Res 19:789–807
Taillard ED (2003) Heuristic methods for large centroid clustering problems. J Heuristics 9:51–73
Wanka G, Wilfer O (2017) Duality results for nonlinear single minimax location problems via multi-composed optimization. Math Methods Oper Res 86(2):401–439
Acknowledgements
The author Soumen Kumar Das is very thankful to the Department of Science & Technology (DST) of India for providing financial support to continue this research work under [JRF-P (DST-INSPIRE Program)] scheme: Sanctioned letter number DST/INSPIRE Fellowship/2015/IF150209 dated 01/10/2015. The research of Sankar Kumar Roy and Gerhard-Wilhelm Weber is partially supported by the Portuguese Foundation for Science and Technology (“FCT-Fundação para a Ciência e a Tecnologia”), through the CIDMA-Center for Research and Development in Mathematics and Applications, University of Aveiro, Portugal, within project UID/MAT/04106/2013. The authors express the gratitude to the anonymous reviewers for their valuable criticisms, and to the Editor-in-Chief, Prof. Dr. Ulrike Leopold-Wildburger for her great support.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix A
Appendix A
Here, we present the iteration formulas used in the solution methodology section. Now, we refer to
where \(\phi _k=\epsilon _k\varphi _k(u_{i},v_{i};x_{j},y_{j})\) and the terms \(w_{ijk}^B\) are constants. Differentiating Z with respect to \(x_j\) and \(y_j\), respectively, and then equating to 0 gives:
Now, from Eqs. (6.1)–(6.2) we obtain:
Then,
These equations are solved iteratively. The iteration equations for \((x_j,y_j)\) are as follows:
where \(\varphi _k(u_{i},v_{i};x_{j}^r,y_{j}^r)=[{(u_{i}-x_{j}^r)^{2}+(v_{i}-y_{j}^r)^{2}}+\delta _k]^{1/2}\). The initial estimates of \((x_j,y_j)\) are illustrated by the weighted mean coordinates as follows:
Rights and permissions
About this article
Cite this article
Das, S.K., Roy, S.K. & Weber, G.W. Heuristic approaches for solid transportation-p-facility location problem. Cent Eur J Oper Res 28, 939–961 (2020). https://doi.org/10.1007/s10100-019-00610-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-019-00610-7