Abstract
This paper describes a methodology of automatic genetic algorithm parameters adjustment dedicated to a job-shop problem with a no-wait constraint with a makespan criterion. The numerical results show that in a given problem, the efficiency of an algorithm with auto-tuning is placed at the level of an algorithm steered in a classical way with the best-fit steering parameters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
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.
