Abstract
AbstractIn this chapter we elaborate on meta-heuristics for optimization from a beginner’s perspective. Basically, we start from scratch to describe the different methodologies and provide the reader with the elements and strategies to build and implement them successfully. Although we describe the adaptation of these methods to the linear ordering problem (LOP) and the maximum diversity problem (MDP), we do not limit our descriptions to these problems. Instead, we present all methods in their generic form and then adapt them to the specific case of the LOP and the MDP. This way, the reader can easily apply these methods to a wide range of combinatorial optimization problems.
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.
