Abstract
The Travel Salesman Problem (TSP) is one of the most studied optimization problems due to its high difficulty and its practical interest. In some real-life applications of this problem the solution methods must be very efficient to deal with dynamic environments or large problem instances. For this reasons, low time consuming heuristics as priority rules are often used. Even though such a single heuristic may be good to solve many instances, it may not be robust enough to take the best decisions in all situations so, we hypothesise that an ensemble of heuristics could be much better than the best of those heuristic. We view an ensemble as a set of heuristics that collaboratively build a single solution by combining the decisions of each individual heuristic. In this paper, we study the application of single heuristics and ensembles to the TSP. The individual heuristics are evolved by Genetic Programming (GP) and then Genetic Algorithms (GA) are used to build ensembles from a pool of single heuristics. We conducted an experimental study on a set of instances taken from the TSPLIB. The results of this study provided interesting insights about the behaviour of rules and ensembles.
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 subscriptionsReferences
TSP Test Data. http://www.math.uwaterloo.ca/tsp/data/index.html. Accessed 1 Feb 2021
Branke, J., Hildebrandt, T., Scholz-Reiter, B.: Hyper-heuristic evolution of dispatching rules: a comparison of rule representations. Evol. Comput. 23(2), 249–277 (2015)
Duflo, G., Kieffer, E., Brust, M.R., Danoy, G., Bouvry, P.: A GP hyper-heuristic approach for generating TSP heuristics. In: IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, pp. 521–529 (2019)
Đumić, M., Jakobović, D.: Ensembles of priority rules for resource constrained project scheduling problem. Appl. Soft Comput. 110, 107606 (2021)
Đurasević, M., Jakobović, D.: Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment. Genet. Program. Evolvable Mach. 19, 53–92 (2017). https://doi.org/10.1007/s10710-017-9302-3
Durasević, M., Jakobović, D.: Creating dispatching rules by simple ensemble combination. J. Heuristics 25, 959–1013 (2019)
Durasević, M., Jakobović, D., Knežević, K.: Adaptive scheduling on unrelated machines with genetic programming. Appl. Soft Comput. 48, 419–430 (2016)
Gil-Gala, F.J., Mencía, C., Sierra, M.R., Varela, R.: Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time. Appl. Soft Comput. 85, 105782 (2019)
Gil-Gala, F.J., Mencía, C., Sierra, M.R., Varela, R.: Learning ensembles of priority rules for on-line scheduling by hybrid evolutionary algorithm. Integr. Comput. Aided Eng. 28(1), 65–80 (2021)
Gil-Gala, F.J., Sierra, M.R., Mencía, C., Varela, R.: Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling. Nat. Comput., 1–11 (2020). https://doi.org/10.1007/s11047-020-09793-4
Gil-Gala, F.J., Sierra, M.R., Mencía, C., Varela, R.: Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity. Swarm Evol. Comput. 66, 100944 (2021). https://doi.org/10.1016/j.swevo.2021.100944
Gil-Gala, F.J., Varela, R.: Genetic algorithm to evolve ensembles of rules for on-line scheduling on single machine with variable capacity. In: Ferrández Vicente, J.M., Álvarez-Sánchez, J.R., de la Paz López, F., Toledo Moreo, J., Adeli, H. (eds.) IWINAC 2019. LNCS, vol. 11487, pp. 223–233. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19651-6_22
Hart, E., Sim, K.: A hyper-heuristic ensemble method for static job-shop scheduling. Evol. Comput. 24(4), 609–635 (2016)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)
McMenemy, P., Veerapen, N., Adair, J., Ochoa, G.: Rigorous performance analysis of state-of-the-art TSP heuristic solvers. In: Liefooghe, A., Paquete, L. (eds.) EvoCOP 2019. LNCS, vol. 11452, pp. 99–114. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-16711-0_7
Nguyen, S., Mei, Y., Xue, B., Zhang, M.: A hybrid genetic programming algorithm for automated design of dispatching rules. Evol. Comput. 27(3), 467–496 (2019)
Park, J., Mei, Y., Nguyen, S., Chen, G., Johnston, M., Zhang, M.: Genetic programming based hyper-heuristics for dynamic job shop scheduling: cooperative coevolutionary approaches. In: Heywood, M.I., McDermott, J., Castelli, M., Costa, E., Sim, K. (eds.) EuroGP 2016. LNCS, vol. 9594, pp. 115–132. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30668-1_8
Park, J., Mei, Y., Nguyen, S., Chen, G., Zhang, M.: An investigation of ensemble combination schemes for genetic programming based hyper-heuristic approaches to dynamic job shop scheduling. Appl. Soft Comput. 63, 72–86 (2018)
Acknowledgements
This research has been supported by the Spanish State Agency for Research (AEI) under research project PID2019-106263RB-I00, and by the Croatian Science Foundation under the project IP-2019-04-4333.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Gil-Gala, F.J., Đurasević, M., Sierra, M.R., Varela, R. (2022). Building Heuristics and Ensembles for the Travel Salesman Problem. In: Ferrández Vicente, J.M., Álvarez-Sánchez, J.R., de la Paz López, F., Adeli, H. (eds) Bio-inspired Systems and Applications: from Robotics to Ambient Intelligence. IWINAC 2022. Lecture Notes in Computer Science, vol 13259. Springer, Cham. https://doi.org/10.1007/978-3-031-06527-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-031-06527-9_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-06526-2
Online ISBN: 978-3-031-06527-9
eBook Packages: Computer ScienceComputer Science (R0)