Enhanced simulated annealing for solving aggregate production planning

DOI10.1155/2016/1679315MaRDI QIDQ1792731zbMATH OpenOpenAlexWikidataFDO

Authors M. R. Abu Bakar, Abdul Jabbar Khudhur Bakheet, Farah Kamil, Bayda Atiya Kalaf, Iraq T. Abbas, Lee Lai Soon

Publication date 12 October 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2016/1679315

Mathematics Subject Classification ID

Production models (90B30) Management decision making, including multiple objectives (90B50) Linear programming (90C05) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Simulated annealing (SA) has been an effective means that can address difficulties related to optimisation problems. SA is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multiobjective linear programming model for APP and optimised by SA. During the course of optimising for the APP problem, it uncovered that the capability of SA was inadequate and its performance was substandard, particularly for a sizable controlled APP 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 SA (MSA) 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 SA and harmony search (HS), the real performance of an industrial company and simulation are made for evaluation. The results show that, compared to SA and HS, MSA offers better quality solutions with regard to convergence and accuracy.

Recommendations

• Application of simulated annealing to solve multi-objectives for aggregate production planning
• A simulated annealing algorithm for aggregate production planning with considering of ancillary costs
• A new multi-objective optimization method for master production scheduling problems using simulated annealing
• Simulated annealing algorithm for solving the single machine early/tardy problem
• Hybrid pattern search and simulated annealing for fuzzy production planning problems

Cites work

• A simulated annealing algorithm for aggregate production planning with considering of ancillary costs
• Deterministic Approximations to Stochastic Production Problems
• Multi-objective aggregate production planning with fuzzy parameters
• Optimization by simulated annealing
• Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints

Cited in

(4)

• A simulated annealing algorithm for aggregate production planning with considering of ancillary costs
• A new multi-objective optimization method for master production scheduling problems using simulated annealing
• Application of simulated annealing to solve multi-objectives for aggregate production planning
• Hybrid pattern search and simulated annealing for fuzzy production planning problems

This page was built for publication: Enhanced simulated annealing for solving aggregate production planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1792731)