Abstract
Simulated Annealing (SA) heuristics have been successfully applied on a variety of complex optimisation problems. This paper investigates the effect of different neighbourhood scheme on the SA process through computational experiments on the permutation flowshop scheduling problem with makespan criterion and proposes an improved SA procedure with a neighbourhood scheme. The test problems are selected from the OR-library and experiment results show that the comparative performances of SA with different neighbourhood schemes and that the proposed SA with a neighbourhood scheme always gives good performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Services Operations and Informatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.