Article ID Journal Published Year Pages File Type
476962 European Journal of Operational Research 2011 9 Pages PDF
Abstract

Multilevel lot-sizing (MLLS) problems, which involve complicated product structures with interdependence among the items, play an important role in the material requirement planning (MRP) system of modern manufacturing/assembling lines. In this paper, we present a reduced variable neighborhood search (RVNS) algorithm and several implemental techniques for solving uncapacitated MLLS problems. Computational experiments are carried out on three classes of benchmark instances under different scales (small, medium, and large). Compared with the existing literature, RVNS shows good performance and robustness on a total of 176 tested instances. For the 96 small-sized instances, the RVNS algorithm can find 100% of the optimal solutions in less computational time; for the 40 medium-sized and the 40 large-sized instances, the RVNS algorithm is competitive against other methods, enjoying good effectiveness as well as high computational efficiency. In the calculations, RVNS updated 7 (17.5%) best known solutions for the medium-sized instances and 16 (40%) best known solutions for the large-sized instances.

► We propose a reduced variable neighborhood search algorithm for the uncapacitated Multilevel lot-sizing problems. ► The proposed algorithm shows good performance on a total of 176 tested instances. ► For the medium-sized instances, 17.5% of best known solutions are updated. ► For the large-sized instances, 40% of best known solutions are updated.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , , ,