 An efficient mat-heuristic algorithm for the dynamic disassembly assembly routing problem with returnsSana Frifita, Hasan Murat Afsar and Faicel Hnaien European Journal of Industrial Engineering, 2022, vol. 16, issue 5, 584-617 Abstract: We study a static and dynamic disassembly assembly routing problem with returns (2D-ARP-R). The problem presents the case where a set of disassembled components and raw materials are converted into a final product. By regrouping production and routing decisions, it is possible to synchronise different activities (assembly, disassembly, inventory management, and vehicle routing) and build a global optimal solution. A mixed integer linear programming (MILP) is presented to solve this new variant. A mat-heuristic based on integer programming and variable neighborhood search algorithm (VNS) is also developed to solve the larger size instances. Numerical results show that the mat-heuristic approach improves the upper bounds obtained by CPLEX in a much shorter time, in most cases. We also evaluate the benefits of coordination of the production and routing decisions within the same optimisation model. This benefit can reach up to 117.38% compared to the hierarchical approach. [Submitted: 4 April 2020; Accepted: 27 June 2021] Keywords: supply chain management; assembly routing problem; ARP; disassembly problem; returns; mat-heuristic. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:16:y:2022:i:5:p:584-617 Access Statistics for this article More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.