Extremum properties of hexagonal partitioning and the uniform distribution in Euclidean location
M. Haimovich,Thomas L. Magnanti +1 more
Reads0
Chats0
TLDR
For Euclidean location problems with uniformly distributed customers, the results imply that hexagonal partitioning of the region is asymptotically optimal and that the uniform distribution is the worst possible.Abstract:
A zero-sum game with a maximizer that selects a point x in given polygon R in the plane and a minimizer that selects K points $c_1 ,c_2 , \cdots ,c_K $ in the plane is considered; the payoff is the Euclidean distance from x to the closest of the points $c_j $, or any monotonically nondecreasing function of this quantity. Lower and upper bounds on the value of the game are derived by considering, respectively, the maximizer’s strategy of selecting a uniformly distributed random point in R and the minimizer’s strategy of selecting K members of a (uniformly) randomly positioned grid of centers that induce a covering of R by K congruent regular hexagons. The analysis shows that these strategies are asymptotically optimal (for $K \to \infty $). For Euclidean location problems with uniformly distributed customers, the results imply that hexagonal partitioning of the region is asymptotically optimal and that the uniform distribution is asymptotically the worst possible.read more
Citations
More filters
Journal ArticleDOI
A stochastic and dynamic vehicle routing problem in the Euclidean plane
TL;DR: The model is motivated by applications in which the objective is to minimize the wait for service in a stochastic and dynamically changing environment, a departure from classical vehicle routing problems where one seeks to minimize total travel time in a static, deterministic environment.
Journal ArticleDOI
Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles
TL;DR: This paper analyzes the problem of m identical vehicles with unlimited capacity and shows that in heavy traffic the system time is reduced by a factor of 1/m2 over the single-server case and considers the case in which each vehicle can serve at most q customers before returning to a depot.
Journal ArticleDOI
A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
TL;DR: These new developments are based on theoretical analysis, combine probabilistic and combinatorial modeling, and lead to new algorithms that produce near-optimal solutions, and a deeper understanding of uncertainty issues in vehicle routing.
Journal ArticleDOI
Coordinated Logistics with a Truck and a Drone
John Gunnar Carlsson,Siyuan Song +1 more
TL;DR: It is demonstrated that the improvement in efficiency of a delivery system in which an unmanned aerial vehicle UAV provides service to customers while making return trips to a truck that is itself moving is proportional to the square root of the ratio of the speeds of the truck and the UAV.
Book
Models for Planning Capacity Expansion in Local Access Telecommunication Networks
TL;DR: The goal is to present relevant aspects of the engineering environment for local access telecommunication networks, and to discuss the relationship between engineering issues and the formulation of economic decision models.
References
More filters
Book
On Growth and Form
TL;DR: This book is an application of some of the concepts of physical science and sundry mathematical methods to the study of organic form and is like one of Darwin's books, well-considered, patiently wrought-out, learned, and cautious.
Book
Location on Networks: Theory and Algorithms
TL;DR: This book is the first in the MIT Press Series in Signal Processing, Optimization, and Control and will be of interest to transportation systems analysts, urban and regional planners, industrial, communication and systems engineers, and academicians and professionals in management, geography, engineering, operations research, and applied mathematics.
Journal ArticleDOI
Exact and approximate solutions to the multisource weber problem
TL;DR: A branch-and-bound algorithm for exact solution of the problem is developed, and computational experience with it is described.
Journal ArticleDOI
Worst-Case and Probabilistic Analysis of a Geometric Location Problem
TL;DR: This work considers the problem of choosing K “medians” among n points on the Euclidean plane such that the sum of the distances from each of the n points to its closest median is minimized and presents two heuristics that produce arbitrarily good solutions with probability going to 1.