Abstract
Methods based on Stochastic Local Search (SLS) have been ranked as the best heuristics available for many hard combinatorial optimization problems. The design of SLS methods which use many neighborhoods poses difficult questions regarding the exploration of these neighborhoods: how much computational effort should be invested in each neighborhood? Should this effort remain fixed during the entire search or should it be dynamically updated as the search progresses? Additionally, is it possible to learn the best configurations during runtime without sacrificing too much the computational efficiency of the search method? In this paper we explore different tuning strategies to configure a state-of-the-art algorithm employing fourteen neighborhoods for the Multi-Mode Resource Constrained Multi-Project Scheduling Problem. An extensive set of computational experiments provide interesting insights for neighborhood selection and improved upper bounds for many hard instances from the literature.
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
Similar content being viewed by others
Notes
- 1.
Moves which do not change the objective function value but modify the solution.
- 2.
The quality \(q_i=\frac{b_i}{c_i}\) of a solution for instance i with cost \(c_i\), considering the best known solution’s cost \(b_i\).
- 3.
LAHC list size value was fixed to 1,000.
- 4.
To the best of our knowledge the post competition results of Asta et al. [1] were not submitted to the MISTA Challenge official website.
- 5.
References
Asta, S., Karapetyan, D., Kheiri, H., Ozcan, E., Parkes, A.J.: Combining monte-carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. In: Kendall, G., Berghe, G.V., McCollum, B. (eds.) Proceedings of the 6th Multidisciplinary International Scheduling Conference, (in review), pp. 836–839 (2013)
Baker, J.E.: Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the 2nd International Conference on GA, pp. 14–21. Lawrence Erlbaum Associates, Inc., Mahwah, NJ, USA (1987)
da Fonseca, G.H.G., Santos, H.G., Toffolo, T.A.M., Brito, S.S., Souza, M.J.F.: GOAL solver: a hybrid local search based solver for high school timetabling. Ann. Oper. Res. 239(1), 77–97 (2014)
Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling: A Research Handbook. Kluwer Academic Publishers, Norwell (2002)
Hansen, P., Mladenović, N.: First vs. best improvement: an empirical study. Discrete Appl. Math. 154(5), 802–817 (2006)
Hoos, H.H., Stützle, T.: Stochastic local search: Foundations and applications, pp. 149–201. Morgan Kaufmann (2005)
Ochoa, G., Verel, S., Daolio, F., Tomassini, M.: Local optima networks: a new model of combinatorial fitness landscapes. In: Richter, H., Engelbrecht, A. (eds.) Recent Advances in the Theory and Application of Fitness Landscapes. ECC, vol. 6, pp. 245–276. Springer, Heidelberg (2014)
Soares, J.A., Santos, H.G., Baltar, D., Toffolo, T.A.M.: LAHC applied to the multi-mode resource-constrained multi-project scheduling problem. In: Proceedings of 7th Multidisciplinary International Conference on Scheduling, pp. 905–908 (2015)
Wauters, T., Kinable, J., Smet, P., Vancroonenburg, W., Berghe, G.V., Verstichel, J.: The multi-mode resource-constrained multi-project scheduling problem:The MISTA 2013 challenge. J. Sched. (2014)
Acknowledgments
The authors thank CNPq and FAPEMIG for supporting this research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Araujo, J.A.S., Santos, H.G., Baltar, D.D., Toffolo, T.A.M., Wauters, T. (2016). Neighborhood Composition Strategies in Stochastic Local Search. In: Blesa, M., et al. Hybrid Metaheuristics. HM 2016. Lecture Notes in Computer Science(), vol 9668. Springer, Cham. https://doi.org/10.1007/978-3-319-39636-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-39636-1_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39635-4
Online ISBN: 978-3-319-39636-1
eBook Packages: Computer ScienceComputer Science (R0)