Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/310056 
Authors: 
Year of Publication: 
2019
Citation: 
[Journal:] Logistics [ISSN:] 2305-6290 [Volume:] 3 [Issue:] 3 [Year:] 2019 [Pages:] 1-15
Publisher: 
MDPI, Basel
Abstract: 
Travel times for simple trips and cycles are analyzed for a storage/retrieval machine working in a one-dimensional or two-dimensional zone with taxicab geometry. A semi-random trip is defined as one-way travel from a known to a random location or vice versa. A random trip is defined as one-way travel from a random to another random location. The probability density function (PDF) of the travelling time for a semi-random trip in a one-dimensional zone is expressed analytically for all possible locations of its starting point. The PDF of a random trip within the same zone is found as a marginal probability by considering all possible durations for such travel. Then the PDFs for the travel times of single command (SC) and dual command (DC) cycles are obtained by scaling the PDF for the travel time of a semi-random trip (for SC) and as the maximum travel time of two independent semi-random trips (for DC). PDFs for travel times in a two-dimensional service zone with taxicab geometry are calculated by considering the trip as a superposition of two one-dimensional trips. The PDFs for travel times of SC and DC cycles are calculated in the same way. Both the one-dimensional and the two-dimensional service zones are analyzed in the time domain without normalization. The PDFs for all travel times are expressed in an analytical form parameterized by the maximal possible travel time within the zone. The graphs of all PDFs are illustrated by numerical examples.
Subjects: 
dual command
Manhattan distance
one dimension
probability density function
single command
taxicab geometry
travel time
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.