This paper presents two hybrid metaheuristics to solve a multiproduct two-stage capacitated facility location problem (MP-TSCFLP). In this problem, a set of different products must be transported from a set of plants to a set of intermediate depots (first stage) and from these depots to a set of customers (second stage). The objective is to minimize the cost related to open plants and depots plus the cost for transporting the products from the plants to the customers satisfying demand and capacity constraints. Recently, the methods clustering search (CS) and biased random-key genetic algorithm (BRKGA) were successfully applied to solve a singleproduct problem (SP-TSCFLP). Therefore, in this paper we propose adaptations and implementations of these methods for handling with a multiproduct approach. To the best of our knowledge, CS and BRKGA presented the best results for the SP-TSCFLP and both have not yet been applied to solve the problem with multiple products. Four sets of large-sized instances with different characteristics are proposed and computational experiments compare the obtained results to those from a commercial solver.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.