Modeling Multi-Plant Capacitated Lot Sizing Problem with Interplant Transfer

Abstract

Lot sizing models involve operational and tactical decisions. These decisions may entail multi-level production processes such as assembly operations with multiple plants and limited capacities. Lot sizing problems are widely recognized as NP-hard problems therefore difficult to solve, especially the ones with multiple plants and capacity constraints. The level of complexity rises to an even higher level when there is an interplant transfer between the plants. This paper presents a Genetic Algorithm (GA) based solution methodology applied to large scale multi-plant capacitated lot sizing problem with interplant transfer (MPCLSP-IT). Although the GA has been a very effective and widely accepted meta-heuristic approach used to solve large scale complex problems, it has not been employed for MPCLSP-IT problem. This paper solves the MPCLSP-IT problem in large scale instances by using a genetic algorithm, and in doing so successfully obtains a better solution in terms of computation time when compared to the results obtained by the other methods such as Lagrangian relaxation, greedy randomized adaptive search procedure (GRASP) heuristics, and GRASP-path relinking techniques used in extant literature.

Keywords

• multi-plant capacitated lot sizing problem
• inter-plant transfer
• metaheuristics
• genetic algorithm
• production planning