This paper presents a novel parallel tabu search (PTS) algorithm equipped with a proper adaptive neighborhood generation mechanism to solve the primal buffer allocation problem, which consists of minimizing the total buffer capacity of a serial production system under a minimum throughput rate constraint. An evaluative method based on a specific algorithm has been implemented to simulate the system behavior. In order to validate the effectiveness of the proposed PTS a mixed integer linear programming-based simulation/optimization approach and several metaheuristics from the relevant literature have been implemented. Since most metaheuristics are sensitive to the parameter setting, a proper calibration analysis based on a non-parametric test has been performed. Then, a comprehensive comparison analysis, concerning with both quality of solutions and computational efficiency, has been carried out. Finally, through the numerical results obtained from PTS, a multi-factorial experimental analysis has been developed to analyze the influencing factors of the problem under investigation.
|Titolo:||A parallel tabu search for solving the primal buffer allocation problem in serial production systems|
|Data di pubblicazione:||2015|
|Citazione:||A parallel tabu search for solving the primal buffer allocation problem in serial production systems / Costa A; Alfieri A; Matta A; Fichera S. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 64(2015), pp. 3795.97-3795.112.|
|Appare nelle tipologie:||1.1 Articolo in rivista|