Abstract
Traveling Salesman Problem and Knapsack Problem are perhaps the best-known combinatorial optimization problems that researchers have been racking their brains over for many decades. But they can also be combined into a single multi-component optimization problem, the Traveling Thief Problem, where the optimal solution for each single component does not necessarily correspond to an optimal Traveling Thief Problem solution. The aim of this work is to compare two generic algorithms for solving a Traveling Thief Problem independently of the test instance.
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
References
Blank, J., Deb, K., Mostaghim, S.: Solving the bi-objective traveling thief problem with multi-objective evolutionary algorithms. In: Trautmann, H., et al. (eds.) EMO 2017. LNCS, vol. 10173, pp. 46–60. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-54157-0_4
Bonyadi, M.R., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: 2013 IEEE Congress on Evolutionary Computation, pp. 1037–1044. IEEE (2013)
Deb, K.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-2. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Mei, Y., Li, X., Yao, X.: On investigation of interdependence between sub-problems of the travelling thief problem. Soft. Comput. 20(1), 157–172 (2016). https://doi.org/10.1007/s00500-014-1487-2
Srinivas, N., Deb, K.: Muiltiobjective optimization using non-dominated sorting in genetic algorithms. Evol. Comput. 2(3), 221–248 (1994)
Zamuda, A., Brest, J.: Population reduction differential evolution with multiple mutation strategies in real world industry challenges. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) EC/SIDE - 2012. LNCS, vol. 7269, pp. 154–161. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29353-5_18
Garbaruk, J., Logofătu, D.: Convergence behaviour of population size and mutation rate for NSGA-II in the context of the traveling thief problem. In: Nguyen, N.T., Hoang, B.H., Huynh, C.P., Hwang, D., Trawiński, B., Vossen, G. (eds.) ICCCI 2020. LNCS (LNAI), vol. 12496, pp. 164–175. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-63007-2_13
Wagner, M., Lindauer, M., Mısır, M., Nallaperuma, S., Hutter, F.: A case study of algorithm selection for the traveling thief problem. J. Heuristics 24(3), 295–320 (2017). https://doi.org/10.1007/s10732-017-9328-y
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 IFIP International Federation for Information Processing
About this paper
Cite this paper
Garbaruk, J., Logofătu, D., Leon, F. (2022). Comparative Study by Using a Greedy Approach and Advanced Bio-Inspired Strategies in the Context of the Traveling Thief Problem. In: Maglogiannis, I., Iliadis, L., Macintyre, J., Cortez, P. (eds) Artificial Intelligence Applications and Innovations. AIAI 2022. IFIP Advances in Information and Communication Technology, vol 646. Springer, Cham. https://doi.org/10.1007/978-3-031-08333-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-031-08333-4_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-08332-7
Online ISBN: 978-3-031-08333-4
eBook Packages: Computer ScienceComputer Science (R0)
