Abstract
Understanding the interaction between different combinatorial optimization problems is a challenging task of high relevance for numerous real-world applications including modern computer and memory architectures as well as high performance computing. Recently, the Traveling Thief Problem (TTP), as a combination of the classical traveling salesperson problem and the knapsack problem, has been introduced to study these interactions in a systematic way. We investigate the underlying non-linear Packing While Traveling Problem (PWTP) of the TTP where items have to be selected along a fixed route. We give an exact dynamic programming approach for this problem and a fully polynomial time approximation scheme (FPTAS) when maximizing the benefit that can be gained over the baseline travel cost. Our experimental investigations show that our new approaches outperform current state-of-the-art approaches on a wide range of benchmark instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Alternatively, an intermediate city with no item might be deleted from the sequence.
References
Bonyadi, M., 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 (CEC), pp. 1037–1044, June 2013. https://doi.org/10.1109/CEC.2013.6557681
El Yafrani, M., Ahiod, B.: Population-based vs. single-solution heuristics for the travelling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016 GECCO 2016, pp. 317–324. ACM, New York (2016). https://doi.org/10.1145/2908812.2908847
Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation GECCO 2015, pp. 385–392. ACM, New York (2015).https://doi.org/10.1145/2739480.2754716
GOODYEAR: Factors Affecting Truck Fuel Economy (2008). http://www.goodyeartrucktires.com/pdf/resources/publications/Factors Affecting Truck Fuel Economy.pdf
Hochbaum, D.: Appromixation Algorithms for NP-hard Problems. PWS Publishing Company (1997)
Hoy, D., Nikolova, E.: Approximately optimal risk-averse routing policies via adaptive discretization. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 3533–3539. AAAI Press, Austin, 25–30 January 2015
Lin, C., Choy, K., Ho, G., Chung, S., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4, Part 1), 1118–1138 (2014). https://doi.org/10.1016/j.eswa.2013.07.107
Mei, Y., Li, X., Yao, X.: On investigation of interdependence between subproblems of the travelling thief problem. Soft Comput. 20, 157–172 (2016). https://doi.org/10.1007/s00500-014-1487-2
Meyer, U., Sanders, P., Sibeyn, J. (eds.): Algorithms for Memory Hierarchies. LNCS, vol. 2625. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36574-5
Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32, 2271–2284 (2005). https://doi.org/10.1016/j.cor.2004.03.002
Polyakovskiy, S., Neumann, F.: The packing while traveling problem. Eur. J. Oper. Res. 258, 424–439 (2017)
Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation GECCO 2014, pp. 477–484. ACM, New York (2014). https://doi.org/10.1145/2576768.2598249
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, Cham (2015). https://doi.org/10.1007/978-3-319-18008-3_23
Toth, P.: Dynamic programming algorithms for the zero-one knapsack problem. Computing 25, 29–45 (1980). https://doi.org/10.1007/BF02243880
Yang, G., Nikolova, E.: Approximation algorithms for route planning with nonlinear objectives. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 3209–3217. AAAI Press, Phoenix, 12–17 February 2016
Zhang, J.: A survey on streaming algorithms for massive graphs. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data. Advances in Database Systems, vol. 40, pp. 393–420. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-6045-0_13
Acknowledgements
The first, second, and fifth author were supported by Australian Research Council grants DP130104395 and DP140103400. The third author is supported by the Einstein Foundation Berlin in the framework of Matheon.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L., Wu, J. (2019). A Fully Polynomial Time Approximation Scheme for Packing While Traveling. In: Disser, Y., Verykios, V. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2018. Lecture Notes in Computer Science(), vol 11409. Springer, Cham. https://doi.org/10.1007/978-3-030-19759-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-19759-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19758-2
Online ISBN: 978-3-030-19759-9
eBook Packages: Computer ScienceComputer Science (R0)