IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v3y2019i3p17-d244977.html
   My bibliography  Save this article

Probability Density Functions for Travel Times in One-Dimensional and Taxicab Service Zones Parameterized by the Maximal Travel Duration of the S/R Machine Within the Zone

Author

Listed:
  • Todor Todorov

    (Faculty of Mechanical Engineering, Technical University of Sofia, 8 Kliment Ohridski Boulevard, 1000 Sofia, Bulgaria)

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.

Suggested Citation

  • Todor Todorov, 2019. "Probability Density Functions for Travel Times in One-Dimensional and Taxicab Service Zones Parameterized by the Maximal Travel Duration of the S/R Machine Within the Zone," Logistics, MDPI, vol. 3(3), pages 1-15, July.
  • Handle: RePEc:gam:jlogis:v:3:y:2019:i:3:p:17-:d:244977
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/3/3/17/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2305-6290/3/3/17/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Noha Mostafa & Walaa Hamdy & Hisham Alawady, 2019. "Impacts of Internet of Things on Supply Chains: A Framework for Warehousing," Social Sciences, MDPI, vol. 8(3), pages 1-10, March.
    2. Vickson, R. G. & Lu, Xinjian, 1998. "Optimal product and server locations in one-dimensional storage racks," European Journal of Operational Research, Elsevier, vol. 105(1), pages 18-28, February.
    3. Roodbergen, Kees Jan & Vis, Iris F.A., 2009. "A survey of literature on automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 194(2), pages 343-362, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Govindan, Kannan & Kannan, Devika & Jørgensen, Thomas Ballegård & Nielsen, Tim Straarup, 2022. "Supply Chain 4.0 performance measurement: A systematic literature review, framework development, and empirical evidence," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    2. Chen, Lu & Langevin, André & Riopel, Diane, 2011. "A tabu search algorithm for the relocation problem in a warehousing system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 147-156, January.
    3. Polten, Lukas & Emde, Simon, 2022. "Multi-shuttle crane scheduling in automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 302(3), pages 892-908.
    4. Gianluca Nastasi & Valentina Colla & Silvia Cateni & Simone Campigli, 2018. "Implementation and comparison of algorithms for multi-objective optimization based on genetic algorithms applied to the management of an automated warehouse," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1545-1557, October.
    5. Daria Minashkina & Ari Happonen, 2023. "Warehouse Management Systems for Social and Environmental Sustainability: A Systematic Literature Review and Bibliometric Analysis," Logistics, MDPI, vol. 7(3), pages 1-33, July.
    6. Boysen, Nils & Briskorn, Dirk & Meisel, Frank, 2017. "A generalized classification scheme for crane scheduling with interference," European Journal of Operational Research, Elsevier, vol. 258(1), pages 343-357.
    7. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    8. repec:pcz:journl:v:5:y:2011:i:1:p:119-126 is not listed on IDEAS
    9. Bortolini, Marco & Faccio, Maurizio & Ferrari, Emilio & Gamberi, Mauro & Pilati, Francesco, 2017. "Time and energy optimal unit-load assignment for automatic S/R warehouses," International Journal of Production Economics, Elsevier, vol. 190(C), pages 133-145.
    10. Sharifpour Hojatallah & Ghaseminezhad Yaser & Hashemi-Tabatabaei Mohammad & Amiri Maghsoud, 2022. "Investigating cause-and-effect relationships between supply chain 4.0 technologies," Engineering Management in Production and Services, Sciendo, vol. 14(4), pages 22-46, December.
    11. Chen, Ran & Yang, Jingjing & Yu, Yugang & Guo, Xiaolong, 2023. "Retrieval request scheduling in a shuttle-based storage and retrieval system with two lifts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    12. George Polak, 2005. "On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices," Annals of Operations Research, Springer, vol. 138(1), pages 223-233, September.
    13. Nicolas, Lenoble & Yannick, Frein & Ramzi, Hammami, 2018. "Order batching in an automated warehouse with several vertical lift modules: Optimization and experiments with real data," European Journal of Operational Research, Elsevier, vol. 267(3), pages 958-976.
    14. Azadeh, K. & de Koster, M.B.M. & Roy, D., 2017. "Robotized Warehouse Systems: Developments and Research Opportunities," ERIM Report Series Research in Management ERS-2017-009-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    15. Gláucya Daú & Annibal Scavarda & Luiz Felipe Scavarda & Vivianne Julianelli Taveira Portugal, 2019. "The Healthcare Sustainable Supply Chain 4.0: The Circular Economy Transition Conceptual Framework with the Corporate Social Responsibility Mirror," Sustainability, MDPI, vol. 11(12), pages 1-19, June.
    16. Martin Epp & Simon Wiedemann & Kai Furmans, 2017. "A discrete-time queueing network approach to performance evaluation of autonomous vehicle storage and retrieval systems," International Journal of Production Research, Taylor & Francis Journals, vol. 55(4), pages 960-978, February.
    17. Claeys, Dieter & Adan, Ivo & Boxma, Onno, 2016. "Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations," European Journal of Operational Research, Elsevier, vol. 254(3), pages 895-906.
    18. Marcus Ang & Yun Fong Lim & Melvyn Sim, 2012. "Robust Storage Assignment in Unit-Load Warehouses," Management Science, INFORMS, vol. 58(11), pages 2114-2130, November.
    19. Wenquan Dong & Mingzhou Jin & Yanyan Wang & Peter Kelle, 2021. "Retrieval scheduling in crane-based 3D automated retrieval and storage systems with shuttles," Annals of Operations Research, Springer, vol. 302(1), pages 111-135, July.
    20. Nils Boysen & David Füßler & Konrad Stephan, 2020. "See the light: Optimization of put‐to‐light order picking systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(1), pages 3-20, February.
    21. Yu, Y. & de Koster, M.B.M., 2009. "On the Suboptimality of Full Turnover-Based Storage," ERIM Report Series Research in Management ERS-2009-051-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jlogis:v:3:y:2019:i:3:p:17-:d:244977. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.