Abstract
Tabu search (TS) has provided advances for solving difficult optimization problems in many domains. At the same time, fundamental TS strategies are often not applied as effectively as they might be, and their underlying rationale is often not completely understood. We examine basic concepts and principles of tabu search, emphasizing those that have sometimes led to applying the label “adaptive memory programming” to this class of methods.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
