A Location-Inventory-Routing Problem in Forward and Reverse Logistics Network Design

We study a new problem of location-inventory-routing in forward and reverse logistic (LIRP-FRL) network design, which simultaneously integrates the location decisions of distribution centers (DCs), the inventory policies of opened DCs, and the vehicle routing decision in serving customers, in which new goods are produced and damaged goods are repaired by a manufacturer and then returned to the market to satisfy customers’ demands as new ones. Our objective is to minimize the total costs of manufacturing and remanufacturing goods, building DCs, shipping goods (new or recovered) between the manufacturer and opened DCs, and distributing new or recovered goods to customers and ordering and storage costs of goods. A nonlinear integer programming model is proposed to formulate the LIRP-FRL. A new tabu search (NTS) algorithm is developed to achieve near optimal solution of the problem. Numerical experiments on the benchmark instances of a simplified version of the LIRP-FRL, the capacitated location routing problem, and the randomly generated LIRP-FRL instances demonstrate the effectiveness and efficiency of the proposed NTS algorithm in problem resolution.

[1]  Hong Liu,et al.  Research on location-routing problem of reverse logistics with grey recycling demands based on PSO , 2011, Grey Syst. Theory Appl..

[2]  Maria Grazia Scutellà,et al.  Distribution network design: New problems and related models , 2005, Eur. J. Oper. Res..

[3]  R. Teunter.  Economic ordering quantities for recoverable item inventory systems , 2001 .

[4]  Manoj Kumar Tiwari,et al.  Analyzing alternatives in reverse logistics for end-of-life computers: ANP and balanced scorecard approach , 2005, Comput. Ind. Eng..

[5]  Djamal Habet.  Tabu Search to Solve Real-Life Combinatorial Optimization Problems: A Case of Study , 2009, Foundations of Computational Intelligence.

[6]  Ping-Feng Pai,et al.  An Integrated Methodology using Linguistic PROMETHEE and Maximum Deviation Method for Third-party Logistics Supplier Selection , 2010, Int. J. Comput. Intell. Syst..

[7]  John W. Sutherland,et al.  Comparing Energy and Other Measures of Environmental Performance in the Original Manufacturing and Remanufacturing of Engine Components , 2007 .

[8]  Ismail Karaoglan,et al.  A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery , 2013, Comput. Ind. Eng..

[9]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[10]  Kamlesh Mathur,et al.  Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems , 1997 .

[11]  Yanhui Li,et al.  A Hybrid Genetic-Simulated Annealing Algorithm for the Location-Inventory-Routing Problem Considering Returns under E-Supply Chain Environment , 2013, TheScientificWorldJournal.

[12]  K. Richter.  The EOQ repair and waste disposal model with variable setup numbers , 1996 .

[13]  Reza Tavakkoli-Moghaddam,et al.  Reliable design of a logistics network under uncertainty: A fuzzy possibilistic-queuing model , 2013 .

[14]  Ying Zhang,et al.  Hybrid metaheuristic solutions to inventory location routing problem , 2014 .

[15]  Bailing Liu,et al.  A Two-Stage Algorithm for the Closed-Loop Location-Inventory Problem Model Considering Returns in E-Commerce , 2014 .

[16]  D. J. Rosenkrantz,et al.  Approximate Algorithms for the Traveling Salesperson Problem , 1974, SWAT.

[17]  Ziping Wang,et al.  A new location-inventory policy with reverse logistics applied to B2C e-markets of China , 2007 .

[18]  S. C. Liu,et al.  A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration , 2003 .

[19]  Shih-Wei Lin,et al.  Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery , 2014, Appl. Soft Comput..

[20]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[21]  Emmanouil E. Zachariadis,et al.  A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries , 2011, Expert Syst. Appl..

[22]  Behnam Vahdani,et al.  A bi-objective interval-stochastic robust optimization model for designing closed loop supply chain network with multi-priority queuing system , 2015 .

[23]  Guoqing Zhang,et al.  Optimal production planning for a multi-product closed loop system with uncertain demand and return , 2011, Comput. Oper. Res..

[24]  Reza Tavakkoli-Moghaddam,et al.  Fuzzy Possibilistic Modeling for Closed Loop Recycling Collection Networks , 2012, Environmental Modeling & Assessment.

[25]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..

[26]  Nader Azad,et al.  Incorporating location, routing and inventory decisions in supply chain network design , 2010 .

[27]  Behnam Vahdani,et al.  A mathematical programming model for recycling network design under uncertainty: an interval-stochastic robust optimization model , 2014 .

[28]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[29]  Nubia Velasco,et al.  A relax-and-price heuristic for the inventory-location-routing problem , 2015, Int. Trans. Oper. Res..