A Dynamic Collection Network Design and Capacity Planning Model in Reverse Logistics

초록

We consider refuse collection network design and capacity planning in reverse logistics, which is the problem of determining the locations and capacities of collection points as well as the allocations of refuses at demand points to the opened collection points under the capacity and the maximum allowable collection distance constraints at each collection point. As an extension of the previous study, we consider a dynamic version of the problem. The integrated problem is formulated as an integer programming model, and then two heuristic algorithms are suggested. Computational experiments were done, and the results are reported.