Title: An efficient mat-heuristic algorithm for the dynamic disassembly assembly routing problem with returns

Authors: Sana Frifita; Hasan Murat Afsar; Faicel Hnaien

Addresses: LIST3N, University of Technology of Troyes, France ' LIST3N, University of Technology of Troyes, France ' LIST3N, University of Technology of Troyes, France

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.

DOI: 10.1504/EJIE.2022.125301

European Journal of Industrial Engineering, 2022 Vol.16 No.5, pp.584 - 617

Received: 04 Dec 2020
Accepted: 27 Jun 2021
Published online: 06 Sep 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article