On the Optimal Spatial Layout of Transshipment Facilities on an Infinite Homogeneous Euclidean Plane
Lists
Only you see this
Abstract
This paper studies optimal spatial layout of transshipment facilities and their corresponding service regions on an infinite homogeneous Euclidean plane that minimizes the total cost for facility set-up, outbound delivery and inbound replenishment transportation -- the outbound delivery involves direct point-to-point shipment, while the inbound replenishment is carried out by a vehicle with infinite capacity through a tour. This paper first proves the Gersho's conjecture (1979) which states if the inbound transportation cost is ignored, the optimal shape of each service region should be a regular hexagon. When inbound transportation cost becomes non-negligible, however, the authors show that a tight upper bound can be achieved by a type of elongated cyclic hexagons. A cost lower bound based on relaxation and idealization is also obtained. The authors can derive analytical formulas for the upper and lower bounds, and the gap between them turns out to be within 0.3%. This strongly suggests that the elongated cyclic hexagon is very close to, and highly likely to be, truly optimal. The authors further conduct numerical studies to illustrate the impact of service region shapes, and to verify the analytical findings.
BibTeX
@inproceedings{xie2014optimal,
author = {Weijun Xie and Yanfeng Ouyang},
title = {{On the Optimal Spatial Layout of Transshipment Facilities on an Infinite Homogeneous Euclidean Plane}},
booktitle = {Transportation},
year = {2014},
}Loading related content...