Abstract
We present a software tool, called EasySyn++, for the automatic synthesis of the source code for a set of stochastic local search (SLS) algorithms. EasySyn++ uses C++ as object language and relies on EasyLocal++, a C++ framework for the development of SLS algorithms. EasySyn++ is particularly suitable for the frequent case of having many neighborhood relations that are potentially useful.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Di Gaspero, L., Schaerf, A.: EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software—Practice and Experience 33(8), 733–765 (2003)
Di Gaspero, L., Schaerf, A.: Writing local search algorithms using EasyLocal++. In: Voß, S., Woodruff, D.L. (eds.) Optimization Software Class Libraries. OR/CS series, pp. 155–176. Kluwer Academic Publishers, Boston (2002)
Di Gaspero, L., Roli, A., Schaerf, A.: EasyAnalyzer: an object-oriented framework for the experimental analysis of stochastic local search algorithms. In: Stützle, T., Birattari, M., Hoos, H. (eds.) Engineering Stochastic Local Search Algorithms (SLS-2007). LNCS, vol. 4638, pp. 76–90. Springer, Heidelberg (2007)
Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms 5(1), 65–89 (2006)
Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gaspero, L., Schaerf, A. (2007). EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms. In: Stützle, T., Birattari, M., H. Hoos, H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007. Lecture Notes in Computer Science, vol 4638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74446-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-74446-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74445-0
Online ISBN: 978-3-540-74446-7
eBook Packages: Computer ScienceComputer Science (R0)