How to? Best fit algorithm results in QV

[shahafei2]

Hi all,

I'm wondering if there is any way to implement a script calculation that will simulate a loading units building algorithm in QV.

My goal is to present the required number of loading units and movements between areas per time period (Day/Hour) and/or per Order.

The script supposed to go through the orders and to sort them by Requierd_Data, Requierd_ Time, Tour_ID

Then it should group the required Product_ID and Required_Quantity by Area, Zone

and begin to allocate them into Child_Loading_Units based on the  Area, Zone restrictions 

the next step is to build the Loading_Units based on the Child_Loading_Units calculation

-Each Area, Zone combination could contain a number of Child_Loading_Units 

and the model should check which one could fit based on the required dimensions and volume

-Order mixing in Loading_Units and Child_Loading_Units  is not allowed

-The Loading_Unit path is A->B->C

when the following scenarios are available

A,B,C

A->B,C

A->C,B

A,B->C

A->B->C

The DB structure will be based on the following tables and data.

Order_Header:

Order_ID,

Tour_ID,

Requierd_Data,

Requierd_ Time

Order_Lines:

Order_ID,

Product_ID,

Required_Quantity

Products:

Product_ID,

Product_Desc,

Area,

Zone,

Unit_Height,

Unit_Width,

Unit_Length

Unit_Vol

Loading_Units:

LU_ID,

LU_Desc,

LU_Height,

LU_Width,

LU_Length,

LU_Vol,

Zone

Child_Loading_Units:

Child_LU_ID,

LU_ID,

Child_LU_Desc,

Child_LU_Height,

Child_LU_Width,

Child_LU_Length,

Child_LU_Vol,

Area