The bi-objective periodic closed loop network design problem

摘要: Abstract Reverse supply chains are becoming a crucial part of retail given the recent reforms in consumers’ rights and regulations by governments. This has motivated companies around world to adopt zero-landfill goals move towards circular economy retain product’s value during its whole life cycle. However, designing an efficient closed loop chain is challenging undertaking as it presents set unique challenges, mainly owing need handle pickups deliveries at same time necessity meet customer requirements within certain limit. In this paper, we model problem bi-objective periodic location routing with simultaneous pickup delivery well windows examine performance two procedures, namely NSGA-II NRGA, solve it. The goal find best locations for depots, allocation customers these service days optimal routes be taken homogeneous vehicles minimise total cost overall violation from customers’ defined limits. Our results show that while there not significant difference between algorithms terms diversity number solutions generated, outperforms NRGA when comes spacing runtime.