Enhanced simulated-annealing-based algorithms and their applications to process planning in reconfigurable manufacturing systems

Authors:
F. Musharavati;A. S. M. Hamouda
Affiliations:
Mechanical and Industrial Systems Engineering, Qatar University, Doha, Qatar;Mechanical and Industrial Systems Engineering, Qatar University, Doha, Qatar
Venue:
Advances in Engineering Software
Year:
2012

Citing 7
Cited 1

Cooling schedules for optimal annealing

Mathematics of Operations Research
Job shop scheduling by simulated annealing

Operations Research
Convergence of the simulated annealing algorithm for continuous global optimization

Journal of Optimization Theory and Applications
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling

Computers and Operations Research
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem

Journal of Scheduling

Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Capabilities of enhanced simulated-annealing-based algorithms in solving process planning problems in reconfigurable manufacturing are investigated. The algorithms are enhanced by combining variants of the simulated annealing technique with other algorithm concepts such as (i) knowledge exploitation and (ii) parallelism. Four configurations of simulated annealing algorithms are devised and engaged to solve an instance of a process planning problem in reconfigurable manufacturing systems. These configurations include; a basic simulated annealing algorithm, a variant of the basic simulated annealing algorithm, a variant of the simulated annealing algorithm coupled with auxiliary knowledge and a variant of the simulated annealing algorithm implemented in a quasi-parallel architecture. Although differences in performances were observed, the implemented algorithms are capable of obtaining good solutions in reasonable time. Experimental results show that the performances of the variants of simulated annealing based algorithms are better in comparison to a basic simulated annealing algorithm. A computational analysis and comparison using ANOVA indicates that improvements towards a better optimal solution can be gained by implementing variants of the simulated annealing algorithm. In addition, little speed gains can be obtained by implementing variants of the simulated annealing algorithms that are coupled with other algorithmic concepts.