The capacitated plant location problem with customer and supplier matching and interval demands uncertainty

The capacitated plant location problem with customer and supplier matching can be modeled as a mixed integer linear program, where the product distribution from plants to customers and the material supply from suppliers to plants are considered together. In order to save allocation cost, distribution trip and a supply trip is merged into one triangular trip. Moreover, vehicles from plants visit a customer and a supplier for each trip. In this paper, we assume interval uncertainties in the demands of costumers. We show that the robust counterpart of the original model with interval uncertainty is equivalent to a larger mixed integer linear program. Finally, the original and robust models are compared on several randomly generated examples showing the impact of uncertainty.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.