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

The present study proposes an integrated model for hub location problem in a Multi-location, Multi-period, Multicommodity (3M) three-echelon supply chain. The problem is formulated as a mixed integer programming model that could be solved using GAMS software. As the developed model is a mixed integer non-linear programming and NPhard, a new algorithm for re-formulation is proposed to change it to a mixed integer leaner programming. Also, a new heuristic algorithm 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.

[1]  Nader Ghaffari-Nasab,et al.  Hub interdiction problem variants: Models and metaheuristic solution algorithms , 2017, Eur. J. Oper. Res..

[2]  Reinaldo Morabito,et al.  Benders decomposition applied to a robust multiple allocation incomplete hub location problem , 2018, Comput. Oper. Res..

[3]  Mohammad Bagher Fakhrzad,et al.  A NEW MULTI-OBJECTIVE JOB SHOP SCHEDULING WITH SETUP TIMES USING A HYBRID GENETIC ALGORITHM , 2013 .

[4]  Mark Goh,et al.  Setting operating policies for supply hubs , 2006 .

[5]  Nenad Mladenovic,et al.  A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem , 2009, Eur. J. Oper. Res..

[6]  Bahar Yetis Kara,et al.  Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems , 2018, Comput. Oper. Res..

[7]  Mohammad Bagher Fakhrzad,et al.  A GA MODEL DEVELOPMENT FOR DECISION MAKING UNDER REVERSE LOGISTICS , 2010 .

[8]  Mohammad Bagher Fakhrzad,et al.  Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms , 2014 .

[9]  Mehdi Heydari,et al.  A HEURISTIC ALGORITHM FOR HYBRID FLOW-SHOP PRODUCTION SCHEDULING TO MINIMIZE THE SUM OF THE EARLINESS ANDF TARDINESS COSTS , 2008 .

[10]  El-Ghazali Talbi,et al.  The robust uncapacitated multiple allocation p-hub median problem , 2017, Comput. Ind. Eng..

[11]  Artur Alves Pessoa,et al.  A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification , 2018, Expert Syst. Appl..

[12]  Gilles Goncalves,et al.  A VNDS Approach for the Liner Shipping Transport in a Structure of Hub-and-Spoke with Sub-Hub , 2018 .

[13]  T. Aykin.  Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem , 1994 .

[14]  Morton E. O'Kelly,et al.  Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints , 2017 .

[15]  Daniele Ferone,et al.  A 2‐stage biased‐randomized iterated local search for the uncapacitated single allocation p‐hub median problem , 2018, Trans. Emerg. Telecommun. Technol..

[16]  Ricardo Saraiva de Camargo,et al.  Hub location under hub congestion and demand uncertainty: the Brazilian case study , 2011 .

[17]  Mikael Rönnqvist,et al.  Speciality oils supply chain optimization: From a decoupled to an integrated planning approach , 2013, Eur. J. Oper. Res..

[18]  Jasmine Siu Lee Lam,et al.  Patterns of maritime supply chains: slot capacity analysis , 2011 .

[19]  S. Chopra,et al.  Supply Chain Management: Strategy, Planning & Operation , 2007 .

[20]  Lori Tavasszy,et al.  Freight network design with heterogeneous values of time , 2017 .

[21]  Ali Elkamel,et al.  Multisite facility network integration design and coordination: An application to the refining industry , 2008, Comput. Chem. Eng..

[22]  Edward A. Silver,et al.  Changing the givens in modelling inventory problems: the example of just-in-time systems , 1992 .

[23]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[24]  Andreas T. Ernst,et al.  The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems , 2019, Comput. Oper. Res..

[25]  Ángel Corberán,et al.  Heuristics for the capacitated modular hub location problem , 2017, Comput. Oper. Res..

[26]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[27]  Reinaldo Morabito,et al.  Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements , 2018, Expert Syst. Appl..

[28]  M. Bruce,et al.  Lean or agile: A solution for supply chain management in the textiles and clothing industry? , 2004 .

[29]  Claudio B. Cunha,et al.  Production , Manufacturing and Logistics A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem , 2017 .

[30]  Nader Ghaffari-Nasab,et al.  An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty , 2018, Comput. Oper. Res..

[31]  Hasan Hosseini-Nasab,et al.  Classification of facility layout problems: a review study , 2018 .