Journal ArticleDOI
The shortest path through many points
Jillian Beardwood,John H. Halton,J. M. Hammersley +2 more
- Vol. 55, Iss: 4, pp 299-327
Reads0
Chats0
TLDR
In this paper, it was shown that the length of the shortest closed path through n points in a bounded plane region of area v is almost always asymptotically proportional to √(nv) for large n; and this result was extended to bounded Lebesgue sets in k-dimensional Euclidean space.Abstract:
We prove that the length of the shortest closed path through n points in a bounded plane region of area v is ‘almost always’ asymptotically proportional to √(nv) for large n; and we extend this result to bounded Lebesgue sets in k–dimensional Euclidean space. The constants of proportionality depend only upon the dimensionality of the space, and are independent of the shape of the region. We give numerical bounds for these constants for various values of k; and we estimate the constant in the particular case k = 2. The results are relevant to the travelling-salesman problem, Steiner's street network problem, and the Loberman—Weinberger wiring problem. They have possible generalizations in the direction of Plateau's problem and Douglas' problem.read more
Citations
More filters
Journal ArticleDOI
Hierarchical Solution of the Traveling Salesman Problem with Random Dyadic Tilings
TL;DR: A hierarchical heuristic approach for solving the Traveling Salesman Problem (TSP) in the unit square with a random dyadic tiling and clusters are formed by the points located in the same tile.
Journal ArticleDOI
Distributed Task Allocation Algorithms for Multi-Agent Systems With Very Low Communication
TL;DR: In this paper , the authors explore the problem of task allocation when communication is very low, e.g., when the probability of a successful message between agents is $\ll 0.01$
Posted Content
Beardwood-Halton-Hammersley Theorem for Stationary Ergodic Sequences: Construction of a Counterexample
TL;DR: In this article, a stationary ergodic process with uniform stationary distribution on the unit square is constructed and the length of the shortest path through the process is not asymptotic to a constant times the square root of n.
Journal Article
Properties of vehicle routes with variable shipment sizes in euclidean plane
TL;DR: In this paper, an exploratory study of the geometric properties of vehicle routes that carry shipments of variable size (hence, capacity utilization and number of stops vary from route to route) is presented.
Computers & Operations Research
TL;DR: In this paper, an adaptive large neighbourhood search metaheuristic is developed for the multiple traveling salesman and districting problem with multi-periods and multi-depots, where the customers of a sales territory dynamically evolve over the periods of a planning horizon.
References
More filters
Journal ArticleDOI
On the shortest spanning subtree of a graph and the traveling salesman problem
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Book ChapterDOI
Solution of a Large-Scale Traveling-Salesman Problem
TL;DR: The RAND Corporation in the early 1950s contained Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, Johnson, Nash, Orchard-Hays, Robinson, Shapley, Simon, Wagner, and other household names as discussed by the authors.
Journal ArticleDOI