A VNS algorithm for a disassembly cell formation problem with demand variability Online publication date: Tue, 18-Feb-2014
by Julio Mar-Ortiz; José Luis González-Velarde; Belarmino Adenso-Díaz
European J. of Industrial Engineering (EJIE), Vol. 8, No. 1, 2014
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. [Received 5 October 2011; Revised 3 March 2012; Revised 11 May 2012; Accepted 12 May 2012]
Online publication date: Tue, 18-Feb-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org