Document Type : Research Paper

Authors

• S. Jabari ¹
• Dara Moazzami ²
• A. Ghodousian ²

¹ University of Tehran, Department of Algorithms and Computation.

² University of Tehran, College of Engineering, Faculty of Engineering Science

Abstract

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

Keywords

• Generalized Bin Covering Problem
• heuristic algorithm
• greedy algorithm