Abstract
We examine an extension of the Traveling Salesperson Problem (TSP), the so called TSP with Forbidden Neighborhoods (TSPFN). The TSPFN is asking for a shortest Hamiltonian cycle of a given graph, where vertices traversed successively have a distance larger than a given radius. This problem is motivated by an application in mechanical engineering, more precisely in laser beam melting.
This paper discusses a heuristic for solving the TSPFN when there don’t exist closed-form solutions and exact approaches fail. The underlying concept is based on Warnsdorff’s Rule but allows arbitrary step sizes and produces a Hamiltonian cycle instead of a Hamiltonian path. We implemented the heuristic and conducted a computational study for various neighborhoods. In particular the heuristic is able to find high quality TSPFN tours on 2D and 3D grids, i.e., it produces optimum and near-optimum solutions and shows a very good scalability also for large instances.
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
References
DeMaio, J., Mathew, B.: Which chessboards have a closed knight’s tour within the rectangular prism? Electron. J. Comb. 18, #P8 (2011)
Firstein, M., Fischer, A., Hungerländer, P.: Closed almost knight’s tours on 2D and 3D chessboards. In: Operations Research Proceedings. Springer, Cham (2017)
Fischer, A., Hungerländer, P.: The traveling salesman problem on grids with forbidden neighborhoods. J. Comb. Optim. 34(3), 891–915 (2017)
Fischer, A., Hungerländer, P., Jellen, A.: The traveling salesperson problem with forbidden neighborhoods on regular 3D grids. In: Operations Research Proceedings. Springer, Cham (2017)
Jellen, A.: The traveling salesperson problem with forbidden neighborhoods on regular 3D grids. Master thesis, Alpen-Adria-Universität Klagenfurt (2018)
Kordaß, R.: Untersuchungen zum Eigenspannungs- und Verzugsverhalten beim Laserstrahlschmelzen. Master thesis, Technische Universität Chemnitz (2014)
Schwenk, A.J.: Which rectangular chessboards have a knight’s tour? Math. Mag. 64(5), 325–332 (1991)
Squirrel, D. Cull, P. A Warnsdorff-rule algorithm for knight’s tours on square chessboards. Oregon State REU Program (1996)
Warnsdorff, H.C.: Des Rösselsprungs einfachste und allgemeinste Lösung, Schmalkalden (1823)
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
Armbrust, P., Hungerländer, P., Jellen, A. (2019). A Heuristic for the Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 2D and 3D Grids. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-18500-8_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18499-5
Online ISBN: 978-3-030-18500-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)