1. BOMB
1.1. MAX CUBE FILL
1.1.1. Calculate Optimal Stop Identify X,Y coordinates of: o Location immediately following Optimal Stop – called “step-off location” o All pick locations with same Optimal Stop
1.1.2. Calculate walking distance between the “step-off location” and each pick location
1.1.3. Sort pick locations in this order: o Shortest to longest on the same side o Longest to shortest on the opposite side
1.1.4. Send OP and DP messages to Paperless to display/voice locations according to new order, starting from same side as “step-off location”
1.2. ENHANCED MAX CUBE FILL
1.2.1. Calculate Optimal Stop Identify X,Y coordinates of: o Location immediately following Optimal Stop – called “step-off location” o All pick locations with same Optimal Stop
1.2.2. Calculate walking distance between the “step-off location” and each pick location
1.2.3. Sort pick locations in this order: o Shortest to longest on the same side o Longest to shortest on the opposite side
1.2.4. Send OP and DP messages to Paperless to display/voice locations according to new order, starting from same side as “step-off location”
1.3. NO MAX CUBE FILL
1.3.1. Calculate Optimal Stop Identify X,Y coordinates of: o Location immediately following Optimal Stop – called “step-off location” o All pick locations with same Optimal Stop
1.3.2. Calculate walking distance between the “step-off location” and each pick location
1.3.3. Sort pick locations in this order: o Shortest to longest on the same side o Longest to shortest on the opposite side
1.3.4. Send OP and DP messages to Paperless to display/voice locations according to new order, starting from same side as “step-off location”