Input data
I	Set of customers
$I_0$	Set of nodes involved in the network (customers plus depot)
$\mathrm{\Omega }$	Set of ODs
K	Set of bids
M	Number of available vehicles
$\rho$	Cost of serving a customer by a direct shipment with a taxi service
$c_{\mathit{ij}}$	Travel cost between node i and node j
$q_i$	Demand of customer i
$[e_i,l_i]$	Delivery TW for customer i (depot TW if $i=0$)
$s_i$	Service time for node i (customer or depot nodes)
$Q_{\mathit{max}}$	Capacity of owned-fleet vehicles
$Q_{\mathit{max}}^{\mathit{OD}}$	Capacity of ODs’ vehicles
$b_k$	Price of bid k offered by an OD
${\tau }_k$	Bundle related to bid k
$o_k$	OD who submitted bid k
$C_k$	Set of customers belonging to bundle ${\tau }_k$