Integration of P-hub Location Problem and 3M Supply Chain

Document Type: Research Paper

Authors

Department of Industrial Engineering, Yazd University, Yazd, Iran

Abstract

The present study proposes an integrated model for hub location problem in a Multi-location, Multi-period, Multi-commodity (3M), three echelon supply chain. The problem is formulated as a mixed integer programming model and solved using GAMS software. As the developed model is a mixed integer non leaner programming and NP-hard, a new algorithm for re-formulation is proposed to change it to a mixed integer leaner programming and also a new heuristic algorithms is proposed to solve it in a reasonable time. To prove the applicability of the model, the well-known real CAB data set is used. Numerical examples show the benefit of the proposed model in both solution time and result quality.

Keywords

Main Subjects


Al-Qahtani, K., and Elkamel, A. (2008). Multisite facility network integration design and coordination: An application to the refining industry. Computers & Chemical Engineering, Vol. 32(10), pp. 2189-2202.

Aykin, T. (1994). Lagrangian relaxation based approaches to the capacitated hub-and-spoke network design problem. European Journal of Operational Research, Vol. 79(3), pp. 501-523.

Bruce, M., Daly, L., and Towers, N. (2004). Lean or agile: A solution for supply chain management in the textiles and clothing industry? International Journal of Operations & Production Management, Vol. 24(2), pp. 151-170.

Campbell, J. F. (1991). Hub location problems and the p-hub median problem, . Center for Business and Industrial Studies Working Paper 91-06-21, University of Missouri-St. Louis, St. Louis.

Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, Vol. 72(2), pp. 387-405.

Chopra, S., and Meindl, P. (2016). Supply Chain Management. Strategy, Planning & Operation. In C. Boersch & R. Elschen (Eds.), Das Summa Summarum des Management: Die 25 wichtigsten Werke für Strategie, Führung und Veränderung (6th Revised edition ed., pp. 528). Upper Saddle River, United States: Pearson Education (US).

da Costa Fontes, F. F., and  Goncalves, G. (2018). A VNDS Approach for the Liner Shipping Transport in a Structure of Hub-and-Spoke with Sub-Hub. IFAC-PapersOnLine, Vol. 51(11), pp. 247-252.

de Camargo, R. S., de Miranda, G., O’Kelly, M. E., and  Campbell, J. F. (2017). Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints. Applied Mathematical Modelling, Vol. 51, pp. 274-301.

Duan, L., Tavasszy, L.,  and Peng, Q. (2017). Freight network design with heterogeneous values of time. Transportation Research Procedia, Vol. 25, pp. 1144-1150.

Fakhrzad, M., and Esfahanib, A. S. (2013). Modeling the time windows vehicle routing problem in cross-docking strategy using two meta-heuristic algorithms. International Journal of Engineering-Transactions A: Basics, Vol. 27(7), pp.1113-1126.

Fakhrzad, M. B., and  Moobed, M. (2010). A GA Model Development for Decision Making Under Reverse Logistics. International Journal of Industiral Engineering & Producion Research, Vol. 21(4), pp. 211-220.

Fakhrzad, M.B., Sadeghieh, A., and Emami, L., 2012. A new multi-objective job shop scheduling with setup times using a hybrid genetic algorithm. International Journal of Engineering-Transactions B: Applications, Vol. 26 (2), pp. 207-223.

Fakhrzad, M.B., and Heydari, M., 2008. A Heuristic Algorithm for Hybrid Flow-shop Production Scheduling to Minimize the Sum of The Earliness ANDF Tardiness Costs. Journal of the Chinese Institute of Industrial Engineers. Vol. 25 (2), pp. 105-115.

Fotheringham, A. S. (1983). A new set of spatial-interaction models: the theory of competing destinations Environment & Planning A ,Vol. 15, pp. 15-36.

Ghaffari nasab, N. (2018). An efficient metaheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. Computers & Operations Research, Vol.97, pp. 31-47.

Ghaffari nasab, N., and  Motallebzadeh, A. (2018). Hub interdiction problem variants: Models and metaheuristic solution algorithms. European Journal of Operational Research, Vol. 267(2), pp. 496-512.

Ghaffari nasab, N., Motallebzadeh, A., Jabarzadeh, Y., and Kara, B. Y. (2018). Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. Computers & Operations Research, Vol. 90, pp. 173-192.

Guajardo, M., Kylinger, M., and Rönnqvist, M. (2013). Speciality oils supply chain optimization: From a decoupled to an integrated planning approach. European Journal of Operational Research, Vol. 229(2), pp. 540-551.

Hines, T. (2004). Supply Chain Strategies: Customer Driven and Customer Focused: Routledge.

Hoff, A., Peiró, J., Corberán, Á., and Martí, R. (2017). Heuristics for the capacitated modular hub location problem. Computers & Operations Research, Vol. 86, pp. 94-109.

Hosseini-Nasab, H., Fereidouni, S., Ghomi, SMTF., and Fakhrzad, MB., (2018),Classification of facility layout problems: a review study, The International Journal of Advanced manufacturing Technology Vol. 94 (1-4), pp. 957-977.

Hugos, M. H. (2011). Essentials of supply chain management (3 ed. Vol. 62): John Wiley & Sons.

Ilić, A., Urošević, D., Brimberg, J., and Mladenović, N. (2010). A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research, Vol. 206(2), pp. 289-300.

Lam, J. S. L. (2011). Patterns of maritime supply chains: slot capacity analysis. Journal of Transport Geography, Vol. 19(2), pp. 366-374.

Martins de Sá, E., Morabito, R., and de Camargo, R. S. (2018a). Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Computers & Operations Research, Vol. 89, pp. 31-50.

Martins de Sá, E., Morabito, R., and de Camargo, R. S. (2018b). Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements. Expert Systems with Applications, Vol. 93, pp. 50-61.

Miranda Junior, G. d., Camargo, R. S. d., Pinto, L. R., Conceição, S. V., & Ferreira, R. P. M. (2011). Hub location under hub congestion and demand uncertainty: the Brazilian case study. Pesquisa Operacional, Vol. 31, pp. 319-349.

Mokhtar, H., Krishnamoorthy, M., and Ernst, A. T. (2019). The 2-Allocation p-Hub Median Problem and a Modified Benders Decomposition Method for Solving Hub Location Problems. Computers & Operations Research. Vol. 104, pp. 375-393.

O'Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, Vol. 32(3), pp. 393-404.

Quadros, H., Costa Roboredo, M., and Alves Pessoa, A. (2018). A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification. Expert Systems with Applications, Vol. 110, pp. 311-322.

Shah, J., and Goh, M. (2006). Setting operating policies for supply hubs. International Journal of Production Economics, Vol. 100(2), pp. 239-252.

Silva, M. R., and Cunha, C. B. (2017). A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. European Journal of Operational Research, Vol. 262(3), pp. 954-965.

Silver, E. A. (1992). Changing the givens in modelling inventory problems: the example of just-in-time systems. International Journal of Production Economics, Vol. 26(1), pp. 347-351.

Talbi, E.-G., and Todosijević, R. (2017). The robust uncapacitated multiple allocation p-hub median problem. Computers & Industrial Engineering, Vol. 110, pp. 322-332.

Webster, S. T. (2008). Principles and tools for supply chain management. Boston: McGraw-Hill/Irwin.