A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over

Abstract

This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.

Modeling Multi-Plant Capacitated Lot Sizing Problem with Interplant Transfer

“…Guinet (2001) pointed out that one way to achieve these objectives is by locating a manufacturing facility close to the customers and also with the help of multiple production units. However, our research reveals that only a few studies such as Nascimento, 2016, 2018;Nascimento et al, 2010;Nascimento and Toledo, 2008;Sambasivan and Schmidt, 2002;Sambasivan and Yahya, 2005) are based on the large scale MPCLSP.…”

“…A Lagrangian heuristic was proposed by Deleplanque et al (2012) to solve MPCLSPs with transfer and shortage capacity models by decomposing it into two subproblems: the master facility location problem and the multi-commodity flow problem. Carvalho and Nascimento (2016) developed a Lagrangian based heuristic using a path relinking strategy that produced even better results for the standard instances of the MPCLSP problem presented in Nascimento and Toledo (2008) and Sambasivan and Yahya (2005). A recent study has employed GA to solve a similar kind of multi-plant capacitated lot sizing problem, however, considered a small size problem with only two plants (Mohammadi et al, 2020).…”