A VNS algorithm for a disassembly cell formation problem with demand variability. (1st January 2014)

• Record Type: Journal Article
• Authors: Mar-Ortiz, Julio; González-Velarde, José Luis; Adenso-Díaz, Belarmino
• Is Part Of: European journal of industrial engineering. Volume 8:Number 1 (2014)
• Page Start: 22
• Page End: 49
• Publication Date: 2014-01-01
• Subjects: disassembly cell formation problem -- DCFP -- cellular manufacturing -- variable neighbourhood search -- VNS -- integer optimisation -- reverse logistics; Industrial engineering -- Europe -- Periodicals; 658.50094
• Languages: English
• ISSNs: 1751-5254

Abstract

A disassembly cell formation problem with demand variability is addressed in this paper under a reconfigurable approach. The reconfigurable approach allows the cells to be rearranged periodically to deal with demand variability in a multi-period planning horizon. We present a first mathematical programming model for this new problem as well as a solution method based on the variable neighbourhood search (VNS) methodology. Computational results on a set of random instances show the convenience of the proposed algorithm to reach near optimal solutions in short computing times. When compared with the solutions found by CPLEX after 5 hrs of CPU time, on average our proposed algorithm obtained solutions improved by 7.96%. When our VNS solution is provided to CPLEX as the starting solution, these are improved by 2.75% on average. The comparison shows that our heuristic algorithms reach high quality solutions in very short computing times.