کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
477122 | 1446135 | 2010 | 8 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem](/preview/png/477122.png)
This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests.
Journal: European Journal of Operational Research - Volume 200, Issue 3, 1 February 2010, Pages 747–754