Abstract
EasyLocal++ is an object-oriented framework that helps the user to design and implement local search algorithms in C++ for a large variety of problems.
In this paper we highlight the usability of EasyLocal++ by showing its contribution for the development of a solver for a real-life scheduling problem, namely the Course Timetabling problem. The Course Timetabling problem involves hard and soft constraints, and requires, in order to be solved in a satisfactory way, a non-trivial combination of different neighborhood relations. We show all steps of the implementation using EasyLocal++, which in our opinion is very straightforward. The resulting code is modular, small, and easy to maintain.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Di Gaspero, L., Schaerf, A. (2003). Writing Local Search Algorithms Using Easylocal++. In: Voß, S., Woodruff, D.L. (eds) Optimization Software Class Libraries. Operations Research/Computer Science Interfaces Series, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-306-48126-X_5
Download citation
DOI: https://doi.org/10.1007/0-306-48126-X_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7002-0
Online ISBN: 978-0-306-48126-0
eBook Packages: Springer Book Archive