An efficient mat-heuristic algorithm for the dynamic disassembly assembly routing problem with returns Online publication date: Tue, 06-Sep-2022
by Sana Frifita; Hasan Murat Afsar; Faicel Hnaien
European J. of Industrial Engineering (EJIE), Vol. 16, No. 5, 2022
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]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook