The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids

Anja Fischer (), Philipp Hungerländer () and Anna Jellen ()
Additional contact information
Anja Fischer: Tehnische Universität Dortmund
Philipp Hungerländer: Alpen-Adria-Universität Klagenfurt
Anna Jellen: Alpen-Adria-Universität Klagenfurt

A chapter in Operations Research Proceedings 2017, 2018, pp 213-219 from Springer

Abstract: Abstract We study the traveling salesperson problem with forbidden neighborhoods (TSPFN) on regular three-dimensional (3D) grids. The TSPFN asks for a shortest tour over all grid points such that successive points along a tour have at least some given distance. We present optimal solutions and explicit construction schemes for the Euclidean TSP and the TSPFN, where edges of length one are forbidden, on regular 3D grids.

Keywords: Traveling salesman problem; Forbidden neighborhood (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_30

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_30

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().