Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    En Ss2013 Lm01 Formelherleitung Bestimmung Von Mittleren Wegstrecken

    Uploaded by

    Seçkin Dilek
    This document discusses calculating the average distance traveled by a forklift in a warehouse. It considers two cases: 1) where the starting point is fixed at the boundary and the destination is random, and 2) where both the starting and ending points are random. For each case, it sets up double integrals to calculate the expected distance based on the warehouse dimensions and assuming uniform probability of destination/starting points. The integrals are evaluated to obtain closed-form expressions for the average distances in each case.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    En Ss2013 Lm01 Formelherleitung Bestimmung Von Mittleren Wegstrecken

    Uploaded by

    Seçkin Dilek
    13 views1 page
    This document discusses calculating the average distance traveled by a forklift in a warehouse. It considers two cases: 1) where the starting point is fixed at the boundary and the destination is random, and 2) where both the starting and ending points are random. For each case, it sets up double integrals to calculate the expected distance based on the warehouse dimensions and assuming uniform probability of destination/starting points. The integrals are evaluated to obtain closed-form expressions for the average distances in each case.

    Original Description:

    logistik

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses calculating the average distance traveled by a forklift in a warehouse. It considers two cases: 1) where the starting point is fixed at the boundary and the destination is random, and 2) where both the starting and ending points are random. For each case, it sets up double integrals to calculate the expected distance based on the warehouse dimensions and assuming uniform probability of destination/starting points. The integrals are evaluated to obtain closed-form expressions for the average distances in each case.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    13 views1 page

    En Ss2013 Lm01 Formelherleitung Bestimmung Von Mittleren Wegstrecken

    Uploaded by

    Seçkin Dilek
    This document discusses calculating the average distance traveled by a forklift in a warehouse. It considers two cases: 1) where the starting point is fixed at the boundary and the destination is random, and 2) where both the starting and ending points are random. For each case, it sets up double integrals to calculate the expected distance based on the warehouse dimensions and assuming uniform probability of destination/starting points. The integrals are evaluated to obtain closed-form expressions for the average distances in each case.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    1

    Determination of the average distances of a fork lift


    1. Case Start with x = 0 (boundary any point in the warehouse)




    = =

    = = =

    ( = = = =

    1
    1 1
    2 2
    1
    0
    0
    , da ( )
    fr
    1 1 1
    2 2 2
    n n
    i i i i
    i i
    L
    L
    x x
    d x P x P Gleichverteilung
    L L
    x dx
    x dx
    d x L L
    L L L


    2. Case Start with x
    i
    (any point in the warehouse any point in the warehouse)




    2 2
    1 1
    2
    1 1
    2 2 2
    0 0 0 0
    1

    1
    fr und y dy
    1 1
    d ( ) ( )
    n n
    j i ij ij
    i j
    n n
    j i
    i j
    y L L L L
    y
    x y
    d y x P P x y
    L L L
    y x x y
    L
    x dx
    y x dxdy y x dx x y dx dy
    L L
    = =
    = =

    = = =
    =

    (
    (
    = = +
    (




    | |
    ( (
    = + |
    ( (
    |

    \ .
    ( (
    = + + = +
    ( (

    ( (
    = + = + = =
    ( (


    2 2
    2
    0
    0
    2 2 2 2 2 2 2
    2 2
    0 0
    2 2 3 3 3 3 3
    2 2 2
    0
    1 1 1
    2 2
    1 1 1 1 1 1
    2 2 2 2
    1 1 1 1 1 1 1 1 1 1
    2 2 3 2 2 3 3 3
    L
    y L
    y
    L L
    L
    yx x x yx dy
    L
    y y L yL y y dy L yL y dy
    L L
    L y y L y L L L L L
    L L L

    0 L x
    i
    d
    1
    0
    L
    x
    i
    d
    2
    y
    j

    You might also like