Locating Postal Relay Boxes Using a set Covering Algorithm

Abstract

SYNOPTIC ABSTRACTIn a mail delivery network, relay boxes along postmen's routes are made necessary by the fact that postmen can carry only a limited amount of mail at any time and must replenish their mail bags at specific points on their route. The problem studied in this paper is that of minimizing the number of relay box locations. It is formulated as a set covering problem and solved heuristically. Computational results confirm the efficiency of the proposed solution and indicate that important savings can be achieved.