Multi-commodity Multimodal Splittable Logistics Hub Location Problem with Stochastic Demands

Authors

Department of Industrial Engineering, Shahed University, Tehran, Iran

Abstract

This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles demands using a discrete chance constraint programming to make the model one step closer to the reality. On the other hand, commodity splitting makes it possible for the remaining portion of commodity flow to be transported by another hub or transportation system in such a way that demands are completely fulfilled as much as possible. The problem decides on the optimum location of hubs, allocates spokes to established hubs efficiently, adopts and combines transportation systems and then makes a right decision as to whether transportation infrastructure to be built at points lacking a suitable transportation infrastructure and having the potential for infrastructure establishment. A Mixed Integer Linear Programming (MILP) model is formulated with the aim of cost minimization. Also, the proposed sensitivity analysis shows that, the discrete chance constraint programming is a good approximation of the continuous chance constraint programming when an uncertain parameter follows a normal distribution.  The results indicate the higher accuracy and efficiency of the proposed model comparing with other models presented in the literature.

Keywords

References

1.     O'kelly, M.E.," A quadratic integer program for the location of interacting hub facilities", European Journal of Operational Research, Vol. 32. No. 3, (1987), 393-404.
2.     Alumur, S.A., Nickel, S., Rohrbeck, B. and Saldanha-da-Gama, F., "Modeling congestion and service time in hub location problems", Applied Mathematical Modelling, Vol. 55, No. 1, (2018), 13-32.
3.     Ambrosino, D. and Sciomachen,A., "A capacitated hub location problem in freight logistics multimodal networks", Optimization Letters, Vol. 10, No. 5, ( 2016), 875-901.
4.     Mohammadi, M., Jolai, F. and Tavakkoli-Moghaddam, R.,"Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm", Applied Mathematical Modelling, Vol. 37, No. 24, (2013), 10053-10073.
5.     Javadian, N.,  Modarres, S. and  Bozorgi, A., "A bi-objectivestochasticoptimizationmodelforhumanitarian relief chain byusingevolutionary algoritms", International Journal of Engineering-Transactions A: Basics, Vol. 30, No. 10, (2017), 1526-1537.
6.     Naderi, M.J. and Pishvaee, M.S.,"A stochastic programming approach to integrated water supply and wastewater collection network design problem", Computers & Chemical Engineering, Vol. 104, No. 1, (2017), 107-127.
7.     Farina, M., Giulioni, L. and Scattolini, R., "Stochastic linear model predictive control with chance constraints–a review", Journal of Process Control, Vol. 44, No. 1,(2016), 53-67.
8.     Charnes, A., Cooper, W.W. and Symonds, G.H.,"Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil", Management Science, Vol. 4, No. 3, (1958),  235-263.
9.     Tan, X., Gong, Z., Chiclana, F. and Zhang, N., "Consensus modeling with cost chance constraint under uncertainty opinions", Applied Soft Computing, Vol. 67, No. 1, (2017), 721-727.
10.   Elçi, Ö., Noyan, N. and Bülbül, K., "Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design", Computers & Operations Research, Vol. 96, No.1, (2018),  91-107.
11.   Küçükyavuz, S., "On mixing sets arising in chance-constrained programming", Mathematical programming, Vol. 132, No. 1-2,   (2012), 31-56.
 
12.   Kınay, Ö.B., Kara, B.Y., Saldanha-da-Gama, F. and Correia,  I., "Modeling the shelter site location problem using chance constraints: A case study for Istanbul", European Journal of Operational Research, Vol. 270, No. 1, (2018), 132-145.
13.   Luedtke, J., Ahmed, S. and Nemhauser, G., "An integer programming approach for linear programs with probabilistic constraints", in International Conference on Integer Programming and Combinatorial Optimization. Springer, (2007), 410- 423.
14.   Zheng, X., Wu, B. and Cui, X., "Cell-and-bound algorithm for chance constrained programs with discrete distributions", European Journal of Operational Research, Vol. 260, No. 2, (2017),  421-431.
15.   Ghodratnama, A., Tavakkoli-Moghaddam, R. and Baboli, A., "Comparing three proposed meta-heuristics to solve a new p-hub location-allocation problem", International Journal of Engineering-Transactions C: Aspects, Vol. 26, No. 9, (2013),  1043-1058.
16.   Karimi, M., Eydi, A.  and Korani, E., "Modeling of the capacitated single allocation hub location problem with a hierarchical approch", International Journal of Engineering-Transactions A: Basics, Vol. 27, No. 4, (2013), 573-586.
17.   Bashiri, M., Mirzaei, M. and Randall, M., "Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution", Applied Mathematical Modelling, Vol. 37, No. 5, (2013),  3513-3525.
18.   Rieck, J., Ehrenberg, C. and Zimmermann, J., "Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery", European Journal of Operational Research, Vol. 236, No. 3, ( 2014), 863-878.
19.   Boukani, F.H., Moghaddam, B.F. and Pishvaee, M.S.,"Robust optimization approach to capacitated single and multiple allocation hub location problems",Computational and Applied Mathematics, Vol. 35, No. 1, (2016), 45-60.
20.   Serper, E.Z. and Alumur, S.A., "The design of capacitated intermodal hub networks with different vehicle types", Transportation Research Part B: Methodological, Vol. 86, No. 1, (2016),  51-65.
21.   Meraklı, M. and Yaman, H., "A capacitated hub location problem under hose demand uncertainty", Computers & Operations Research, Vol. 88, No. 1, (2017),  58-70.
22.   Zhalechian, M., Tavakkoli-Moghaddam, R. and Rahimi, Y.,"A self-adaptive evolutionary algorithm for a fuzzy multi-objective hub location problem: An integration of responsiveness and social responsibility", Engineering Applications of Artificial Intelligence, Vol.  62, No. 1, (2017), 1-16.
23.   Zetina, C.A.,  Contreras, I., Cordeau, J.F. and Nikbakhsh, E.,  "Robust uncapacitated hub location", Transportation Research Part B: Methodological, Vol. 106, No.1, (2017),  393-410.
24.   Ghezavati, V. and Hosseinifar, P., "Application of efficient metaheuristics to solve a new bi-objective optimization model for hub facility location problem considering value at risk criterion", Soft Computing, Vol. 22, No.1, (2018), 195-212.
25.   Correia, I., Nickel, S. and Saldanha-da-Gama., F. A.,"stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities", Omega, Vol. 74, No. 1, (2018), 122-134.
26.   de Sá, E. M., Morabito, R. and de Camargo, R.S., "Benders decomposition applied to a robust multiple allocation incomplete hub location problem", Computers & Operations Research, Vol. 89, No. 1, ( 2018), 31-50.
International Journal of Engineering
Volume 31, Issue 11
TRANSACTIONS B: Applications
November 2018
Pages 1935-1942

Files

Cited by

Share

How to cite

Statistics