Abstract
This paper studies a facility selection problem which is generalised from the design of a mail sorting system with multiple input and output. The problem is formulated as a 0–1 integer linear programming (ILP) problem with logical constraints. We show how the logical constraints can be embedded into a ILP model. We compare three strategies for handling logical relations: (1) explicitly as added linear constraints; (2) implicitly as symbolic constraints; and (3) a combination of the two. The effectiveness of computations under different strategies are shown.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yan, H. An ILP model with logical constraints for mail sorting facility selection. J Oper Res Soc 49, 273–277 (1998). https://doi.org/10.1057/palgrave.jors.2600526
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2600526