On the minimal travel time needed to collect n items on a circle.

DOI10.1214/105051604000000152zbMATH Open1121.90012arXivmath/0405294OpenAlexW2952738077MaRDI QIDQ1879896FDOQ1879896

Authors: Nelly Litvak, Willem van Zwet 

Publication date: 15 September 2004

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: Consider n items located randomly on a circle of length 1. The locations of the items are assumed to be independent and uniformly distributed on [0,1). A picker starts at point 0 and has to collect all n items by moving along the circle at unit speed in either direction. In this paper we study the minimal travel time of the picker. We obtain upper bounds and analyze the exact travel time distribution. Further, we derive closed-form limiting results when n tends to infinity. We determine the behavior of the limiting distribution in a positive neighborhood of zero. The limiting random variable is closely related to exponential functionals associated with a Poisson process. These functionals occur in many areas and have been intensively studied in recent literature.

Full work available at URL: https://arxiv.org/abs/math/0405294

Recommendations

• The travel time in carousel systems under the nearest item heuristic
• A selection-replacement process on the circle
• scientific article; zbMATH DE number 33260
• Random, nonuniform distribution of line segments on a circle
• Limiting distribution of the maximal distance between random points on a circle: a moments approach

Mathematics Subject Classification ID

Processes with independent increments; Lévy processes (60G51) Exact distribution theory in statistics (62E15) Central limit and other weak theorems (60F05) Inventory, storage, reservoirs (90B05)

Cites Work

• Exponential functionals of Brownian motion and related processes
• Title not available (Why is that?)
• Extremes of moving averages of random variables with finite endpoint
• Ramanujan's Extensions of the Gamma and Beta Functions
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• Title not available (Why is that?)
• On subordinators, self-similar Markov processes and some factorizations of the exponential variable
• Title not available (Why is that?)
• On the entire moments of self-similar Markov processes and exponential functionals of Lévy processes
• Title not available (Why is that?)
• AIMD algorithms and exponential functionals
• The entrance laws of self-similar Markov processes and exponential functionals of Lévy processes
• Distribution of linear combination of exponential variates
• The travel time in carousel systems under the nearest item heuristic
• On a class of order pick strategies in paternosters
• Some peculiarities of exponential random variables

Cited In (10)

• Statistical inference for generalized Ornstein-Uhlenbeck processes
• A survey on performance analysis of warehouse carousel systems
• A selection-replacement process on the circle
• Tail asymptotics for exponential functionals of Lévy processes
• Willem van Zwet's research
• An evening spent with Bill van Zwet
• Exact and inexact solution procedures for the order picking in an automated carousal conveyor
• A non-increasing Lindley-type equation
• One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations
• FUNCTIONALS OF BROWNIAN BRIDGES ARISING IN THE CURRENT MISMATCH IN D/A CONVERTERS

This page was built for publication: On the minimal travel time needed to collect \(n\) items on a circle.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879896)