Enhanced Simulated Annealing for Solving Aggregate Production Planning

الملخص EN

Simulated annealing ( S A ) has been an effective means that can address difficulties related to optimisation problems.

S A is now a common discipline for research with several productive applications such as production planning.

Due to the fact that aggregate production planning ( A P P ) is one of the most considerable problems in production planning, in this paper, we present multiobjective linear programming model for APP and optimised by S A .

During the course of optimising for the APP problem, it uncovered that the capability of S A was inadequate and its performance was substandard, particularly for a sizable controlled A P P problem with many decision variables and plenty of constraints.

Since this algorithm works sequentially then the current state will generate only one in next state that will make the search slower and the drawback is that the search may fall in local minimum which represents the best solution in only part of the solution space.

In order to enhance its performance and alleviate the deficiencies in the problem solving, a modified S A ( M S A ) is proposed.

We attempt to augment the search space by starting with N + 1 solutions, instead of one solution.

To analyse and investigate the operations of the MSA with the standard S A and harmony search ( H S ), the real performance of an industrial company and simulation are made for evaluation.

The results show that, compared to S A and H S , M S A offers better quality solutions with regard to convergence and accuracy.