A linear programming model for the separate refuse collection service
Computers and Operations Research
Developing a Theory of Reverse Logistics
Interfaces
A GRASP algorithm to solve the unicost set covering problem
Computers and Operations Research
International Journal of Computer Integrated Manufacturing
A stochastic model for forward-reverse logistics network design under risk
Computers and Industrial Engineering
| Hi-index | 0.00 |
This study considers the problem of determining the locations of collection points as well as the allocations of refuses at demand points to collection points while satisfying the capacity and the maximum allowable collection distance constraints at each collection point. To consider fluctuating demands commonly occurred in refuse collection systems, we consider a restricted dynamic version of the problem in which the locations are fixed, but the allocations are changed over a given planning horizon. The problem is formulated as an integer programming model for the objective of minimizing the sum of fixed costs to open collection points and variable costs to transport refuses between demand and collection points, and then, due to the complexity of the problem, two heuristic algorithms are suggested. The heuristics, called the multi-stage branch and bound and the modified drop heuristics in this paper, are based on the decomposition of the entire problem into the static location and the dynamic allocation sub-problems. Computational experiments were done on various test instances, and the results are reported.