Fast Heuristics for Designing Integrated E-Waste Reverse Logistics Networks

This paper investigates a mixed-integer linear programming model that solves an integrated facility location and configuration problem for recycling electronic waste (e-waste). Since different recycled e-waste consume different levels of recycling processes and resources, the capability of processing only one or more categories of recycled e-waste for each candidate facility is considered in addition to its location to maximize the total revenue. Computational experiments based on proposed heuristics are conducted using data collected from Taiwan´s recycled e-waste market and show our proposed methods give a high-quality near-optimal solution in a promising time shorter than previous solution methods and CPLEX.