Abstract
In the paper we present some methods of empirical research of optimization problems’ solution space, for which solutions are represented by permutations. Sampling the feasible solutions set we determine a histogram of frequency of incidence of local minima measuring its distance to the neighborhood graph’s center. On its basis we verify a statistical hypothesis on normal distribution occurrence of local minima. Due to this research we can significantly reduce the area of the searching process during a local search metaheuristics work, focusing the searching process on Big Valley. We propose an algorithm with changeable diameter of the search.
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
Notes
- 1.
Calculations were conducted in Wroclaw Centre for Networking and Supercomputing within the Computational Grant No. 96.
References
Bożejko, W.: A New Class of Parallel Scheduling Algorithms. Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław (2010)
Bożejko, W.: Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. J. Intell. Manufact. 21(6), 777–785 (2010)
Bożejko, W., Gnatowski, A., Niżyński, T., Wodecki, M.: Tabu search algorithm with neural tabu mechanism for the cyclic job shop problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2016. LNCS (LNAI), vol. 9693, pp. 409–418. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39384-1_35
Bożejko, W., Uchroński, M., Wodecki, M.: Parallel neuro-tabu search algorithm for the job shop scheduling problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2013. LNCS (LNAI), vol. 7895, pp. 489–499. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38610-7_45
Daolio, F., Verel, S., Ochoa, G., Tomassini, M.: Local optima networks and the performance of iterated local search. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 369–376. GECCO 2012. ACM, New York (2012)
Humeau, J., Liefooghe, A., Talbi, E.G., Verel, S.: ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms. J. Heuristics 19(6), 881–915 (2013)
Lu, H., Shi, J., Fei, Z., Zhou, Q., Mao, K.: Measures in the time and frequency domains for fitness landscape analysis of dynamic optimization problems. Appl. Soft Comput. 51, 192–208 (2017)
Mattfeld, D., Bierwirth, C., Kopfer, H.: A search space analysis of the job shop scheduling problem. Ann. Oper. Res. 86, 441–453 (1999)
Naudts, B., Suys, D., Verschoren, A.: Epistasis as a basic concept in formal landscape analysis. In: Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 65–72 (1997)
Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6), 797–813 (1996)
Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job shop problem. J. Sched. 8(2), 145–159 (2005)
Reeves, C.R.: Fitness landscapes. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 587–610. Springer, Boston (2005). https://doi.org/10.1007/0-387-28356-0_19
Reidys, C.M., Stadler, P.F.: Neutrality in fitness landscapes. Appl. Math. Comput. 117(2–3), 321–350 (2001)
Rosé, H., Ebeling, W., Asselmeyer, T.: The density of states—a measure of the difficulty of optimisation problems. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 208–217. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61723-X_985
Smutnicki, C.: Optimization technologies for hard problems. In: Fodor, J., Klempous, R., Suárez Araujo, C.P. (eds.) Recent Advances in Intelligent Engineering Systems. SCI, vol. 378, pp. 79–104. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-23229-9_4
Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)
Vassilev, V.K., Fogarty, T.C., Miller, J.F.: Information characteristics and the structure of landscapes. Evol. Comput. 8(1), 31–60 (2000)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67–82 (1997)
Wong, L.P., Puan, C.Y., Low, M.Y.H., Wong, Y.W., Chong, C.S.: Bee colony optimisation algorithm with big valley landscape exploitation for job shop scheduling problems. Int. J. Bio-Inspired Comput. 2(2), 85 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Bożejko, W., Gnatowski, A., Smutnicki, C., Uchroński, M., Wodecki, M. (2018). Local Search Metaheuristics with Reduced Searching Diameter. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2017. EUROCAST 2017. Lecture Notes in Computer Science(), vol 10671. Springer, Cham. https://doi.org/10.1007/978-3-319-74718-7_54
Download citation
DOI: https://doi.org/10.1007/978-3-319-74718-7_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74717-0
Online ISBN: 978-3-319-74718-7
eBook Packages: Computer ScienceComputer Science (R0)