Abstract
The travelling thief problem (TTP) is an academic combinatorial optimisation problem in which its two components, namely the travelling salesperson problem (TSP) and the knapsack problem, interact. The goal is to provide to a thief a tour across all given cities and a packing plan that defines which items should be taken in which city. The combining elements are the knapsack’s renting rate that is to be paid for the travel time, and the thief’s slowdown with increasing knapsack use. Previously, successful algorithms focussed almost exclusively on constructing packing plans for near-optimal TSP tours. Even though additional hill-climbers are used at times, this strong initial bias prevents them from finding better solutions that require longer tours that can give rise to more profitable packing plans. Our swarm intelligence approach shifts the focus away from good TSP tours to good TTP tours. In our study we observe that this is effective and computationally efficient, as we outperform state-of-the-art approaches on instances with up to 250 cities and 2000 items, sometimes by more than 10 %.
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 subscriptionsNotes
- 1.
ACOTSPjava: http://adibaba.github.io/ACOTSPJava/, last accessed 28 Feb 2016.
- 2.
As available at http://cs.adelaide.edu.au/~optlog/research/ttp.php.
References
Applegate, D., Cook, W.J., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. J. Comput. 15(1), 82–92 (2003)
Bonyadi, M.R., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: Congress on Evolutionary Computation, pp. 1037–1044. IEEE (2013)
Bonyadi, M.R., Michalewicz, Z., Przybylek, M.R., Wierzbicki, A.: Socially inspired algorithms for the TTP. In: Genetic and Evolutionary Computation Conference, pp. 421–428. ACM (2014)
Chand, S., Wagner, M.: Fast heuristics for the multiple traveling thieves problem. In: Genetic and Evolutionary Computation Conference. ACM (2016). Accepted for publication
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Genetic and Evolutionary Computation Conference, pp. 385–392. ACM (2015)
Mei, Y., Li, X., Yao, X.: Improving efficiency of heuristics for the large scale traveling thief problem. In: Dick, G., et al. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 631–643. Springer, Heidelberg (2014)
Mei, Y., Li, X., Yao, X.: On investigation of interdependence between sub-problems of the TTP. Soft Comput. 20(1), 157–172 (2014)
Nallaperuma, S., Wagner, M., Neumann, F.: Analyzing the effects of instance features and algorithm parameters for max min ant system and the traveling salesperson problem. Front. Robot. AI 2, 18 (2015)
Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Genetic and Evolutionary Computation Conference, pp. 477–484. ACM (2014)
Polyakovskiy, S., Neumann, F.: Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 332–346. Springer, Heidelberg (2015)
Stützle, T., Hoos, H.H.: MAX-MIN ant system. J. Future Gener. Comput. Syst. 16, 889–914 (2000)
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
Wagner, M. (2016). Stealing Items More Efficiently with Ants: A Swarm Intelligence Approach to the Travelling Thief Problem. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2016. Lecture Notes in Computer Science(), vol 9882. Springer, Cham. https://doi.org/10.1007/978-3-319-44427-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-44427-7_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44426-0
Online ISBN: 978-3-319-44427-7
eBook Packages: Computer ScienceComputer Science (R0)