Scribd
Upload
18 views1 page

1 N (D) 1 2 M m+1 M+M

The document describes a delivery optimization problem involving deliveries from a plant to construction sites. It defines the sets of deliveries from the plant, construction sites that do and do not require pumps, and deliveries to each site. It provides parameters for the number of deliveries required for each site and introduces the variables and predecessors/successors for optimizing vehicle routes between deliveries.

Uploaded by

JuanCarlosCarrillo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views1 page

1 N (D) 1 2 M m+1 M+M

The document describes a delivery optimization problem involving deliveries from a plant to construction sites. It defines the sets of deliveries from the plant, construction sites that do and do not require pumps, and deliveries to each site. It provides parameters for the number of deliveries required for each site and introduces the variables and predecessors/successors for optimizing vehicle routes between deliveries.

Uploaded by

JuanCarlosCarrillo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

̅1, … .

, d
̅ : {d
D ̅ n(d) } set of deliveries from the plant

C = {c1 , c2 , … , cm , cm+1 , … , cm+m0 } ∶ set of all construction sites

m: the number of sites that do not need pumps

m0 : number of sites in need of a pump

C 0 = {cm+1 , cm+2 … , cm+m0 } ∶ 𝑠𝑢𝑏𝑠𝑒𝑡 𝑡ℎ𝑎𝑡 𝑟𝑒𝑝𝑟𝑒𝑠𝑒𝑛𝑡𝑠 𝑎𝑙𝑙 𝑠𝑖𝑡𝑒𝑠 𝑛𝑒𝑒𝑑 𝑜𝑓 𝑎 𝑝𝑢𝑚𝑝

Set of deliveries to the site ci : c̅i : {c̅i,1 … . , c̅i,n(ci } where c̅i,j denotes the jth delivery to 𝑐𝑖 and
𝑛(𝑐𝑖 ) is total number of trucks deliveries scheduled for 𝑐𝑖 .
𝑞(𝑐𝑖 )
𝑛(𝑐𝑖 ): [𝐾 ] 𝑖𝑠 𝑢𝑝𝑝𝑒𝑟 𝑏𝑜𝑢𝑛𝑑 𝑓𝑜𝑟 𝑡ℎ𝑒 𝑚𝑎𝑥𝑖𝑚𝑢𝑚 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑛𝑒𝑐𝑒𝑠𝑠𝑎𝑟𝑦 𝑑𝑒𝑙𝑖𝑣𝑒𝑟𝑖𝑒𝑠 𝑡𝑜 𝑐𝑖
min(𝑐𝑖 )

̅ ∪ C̅ , k ∈ K
xuvk , u, v ∈ D
∶ if vehicle k supplies u, reloads at u or starts its delivery at u, and moves towards v, xuvk
= 1, otherwise, xuvk = 0
̅ ∪ C̅: is the predecessor of a specific delivery u via vehicle k
∆− (u), u ∈ D
k

̅ ∪ C̅: is the suceessor of a specific delivery u via vehicle k


∆+ (u), u ∈ D
k

You might also like