A robust optimization approach for disassembly assembly routing problem under uncertain yields

This study examines a stochastic disassembly assembly routing problem with returns (SDARP-R), in which disassembly yields are considered uncertain due to the unknown status of the returned products. We introduce a new formulation for the robust SDARP-R defined by discrete scenarios. We address five hypotheses, where different levels of decision flexibility are given. Analyses indicate that allowing flexibility in the procurement process improves the total cost but increases the difficulty of solving the problem, as well. However, allowing flexibility only to purchasing decisions is the most practical to the industry. An efficient matheuristic method based on integer programming and the Variable Neighborhood Search algorithm is also developed. The performance of the matheuristic method is evaluated through numerical tests, under three most promising hypothesis.