An efficient two-phase iterative heuristic for Collection-Disassembly problem

Abstract Closing the loop in the supply chains is one of the mandatory conditions for more sustainable development. The Collection-Disassembly Problem appears in the reverse part of the closed-loop supply chains. Its aim is to coordinate the activities of collection of end-of-life products from collection centres and their subsequent disassembly. The disassembly step is required for efficient remanufacturing and recycling of returned products. The Collection-Disassembly problem integrates such optimization problems as dynamic lot-sizing and vehicle routing in general cases. In this paper, we develop a Two-Phase Iterative Heuristic to efficiently address large size instances. The numerical tests show that the heuristic provides good solutions under acceptable computational time.

[1]  Alexandre Dolgui,et al.  Disassembly Line Balancing and Sequencing under Uncertainty , 2014 .

[2]  Surendra M. Gupta,et al.  Lot sizing in reverse MRP for scheduling disassembly , 2008 .

[3]  Josefa Mula,et al.  A review of tactical optimization models for integrated production and transport routing planning decisions , 2015, Comput. Ind. Eng..

[4]  Stéphane Dauzère-Pérès,et al.  A Two-Phase Iterative Heuristic Approach for the Production Routing Problem , 2015, Transp. Sci..

[5]  Francesca Fumero,et al.  Synchronized Development of Production, Inventory, and Distribution Schedules , 1999, Transp. Sci..

[6]  Wei-Chang Yeh,et al.  Simplified swarm optimization in disassembly sequencing problems with learning effects , 2012, Comput. Oper. Res..

[7]  Lionel Amodeo,et al.  Efficient multi-objective optimization of supply chain with returned products , 2015 .

[8]  Jean-François Cordeau,et al.  The production routing problem: A review of formulations and solution algorithms , 2015, Comput. Oper. Res..

[9]  Vinícius Amaral Armentano,et al.  A tabu search procedure for coordinating production, inventory and distribution routing problems , 2010, Int. Trans. Oper. Res..

[10]  Gerald G. Brown,et al.  The Kellogg Company Optimizes Production, Inventory, and Distribution , 2001, Interfaces.

[11]  Herminia I. Calvete,et al.  Bilevel model for production-distribution planning solved by using ant colony optimization , 2011, Comput. Oper. Res..

[12]  Luca Bertazzi,et al.  Analysis of the maximum level policy in a production-distribution system , 2011, Comput. Oper. Res..

[13]  Christian Prins,et al.  A reactive GRASP and path relinking for a combined production-distribution problem , 2007, Comput. Oper. Res..

[14]  Jonathan F. Bard,et al.  A branch-and-price algorithm for an integrated production and inventory routing problem , 2010, Comput. Oper. Res..

[15]  Yossiri Adulyasak,et al.  Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems , 2012, INFORMS J. Comput..

[16]  Mei-Shiang Chang,et al.  Production scheduling and vehicle routing with time windows for perishable food products , 2009, Comput. Oper. Res..

[17]  Jean-François Cordeau,et al.  Benders Decomposition for Production Routing Under Demand Uncertainty , 2012, Oper. Res..

[18]  Gerald G. Brown,et al.  The Kellogg Company Optimizes Production, Inventory, and Distribution , 2001, Interfaces.

[19]  Abdorreza Sheikholeslami,et al.  A sample average approximation approach to the berth allocation problem with uncertain tides , 2017 .

[20]  Manoj Kumar Tiwari,et al.  Multi-objective modeling of production and pollution routing problem with time window: A self-learning particle swarm optimization approach , 2016, Comput. Ind. Eng..

[21]  David L. Woodruff,et al.  Solving the medium newspaper production/distribution problem , 1999, Eur. J. Oper. Res..

[22]  Pedro Amorim,et al.  Lot sizing versus batching in the production and distribution planning of perishable goods , 2013 .

[23]  Christian Prins,et al.  A memetic algorithm with dynamic population management for an integrated production-distribution problem , 2009, Eur. J. Oper. Res..

[24]  Marshall L. Fisher,et al.  Coordination of production and distribution planning , 1994 .

[25]  Alexandre Dolgui,et al.  Collection-disassembly problem in reverse supply chain , 2017 .

[26]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[27]  Chuang Liu,et al.  Minimizing the total cost of barrier coverage in a linear domain , 2018, J. Comb. Optim..

[28]  HuijunSun,et al.  Bilevel Model for Pricing and Production Planning Decision with Fuzzy Parameters , 2004 .

[29]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[30]  Luca Bertazzi,et al.  Minimizing the Total Cost in an Integrated Vendor—Managed Inventory System , 2005, J. Heuristics.

[31]  Alexandre Dolgui,et al.  A sample average approximation method for disassembly line balancing problem under uncertainty , 2014, Comput. Oper. Res..

[32]  Jean-François Cordeau,et al.  Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem , 2011, Transp. Sci..

[33]  Nicholas Dew,et al.  An RFID application in large job shop remanufacturing operations , 2011 .

[34]  Sila Çetinkaya,et al.  An Integrated Outbound Logistics Model for Frito-Lay: Coordinating Aggregate-Level Production and Distribution Decisions , 2009, Interfaces.