A precedence-constrained asymmetric traveling salesman model for disassembly optimization

Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art

“…They applied both the heuristic algorithm and the iterative BILP method (Lambert, 2006) using disassembly precedence graph of a cell phone. Sarin et al (2006) propose a precedence-constrained asymmetric traveling salesman problem formulation together with a three phase iterative solution procedure. Adenso-Diaz et al (2008) propose a GRASP and path-relinking-based heuristic methodology to solve a bi-criteria disassembly planning problem.…”

Disassembly planning and sequencing for end-of-life products with RFID enriched information

“…Tiwari et al [11] applied Petri nets for calculating indices for disassembly, recycling and disposing. As an alternative, Sarin et al [12] proposed an innovative approach of network representation which aligns with the product's Bill-of-Material graph. This method shows the mating relationship among the parts/ subassemblies as well as the joints that hold these components together.…”

“…Galantucci et al [19] proposed the Fuzzy Logic-Genetic Algorithm methodology to plan for the automatic assembly and disassembly sequences of products. Sarin et al [12] proposed a disassembly optimization model using the Lagrangian relaxation technique for obtaining a tighter bound for the problem. The authors developed a new way of modeling the sub-tour elimination constraints, which are usually encountered in a travelling salesman problem.…”

A Hybrid Approach Combining Improved Shuffled Frog-Leaping Algorithm With Dynamic Programming for Disassembly Process Planning

“…The ( 6) aims to minimize the total cost consisting of subcosts of plus . The (7) stipulates each component has one succeeding component. The ( 8) requires each component has only one preceding component.…”

“…The [6] developed a mixed integer nonlinear programming (MINLP) for DPP. The [7] used Lagrangian relaxation technique to find the optimal/near-optimal solutions. However, mathematical models tend to become computationally intractable due to NP-hard, which limits their wide use.…”