Professional Documents
Culture Documents
A R T I C L E I N F O A B S T R A C T
Keywords: A mathematical model is developed to calculate the costs of alternative distribution set-ups for last mile
Urban freight transport transportation in a supply chain with small and fragmented volumes. The model is based on input from logistics
Sustainability cost models for urban areas combined with cost variables related to logistics processes, receiver attributes and
Megacities local city characteristics. The cost variables for each aspect (logistics, receiver, city) influence the cost-effec-
Modelling
tiveness and applicability of an alternative distribution set-up. The model is applied on the delivery of fast
moving consumer goods (FMCG) towards small independent retailers in a megacity. The current supply of these
stores is characterized by high costs, inefficiency and unsustainability. Four different set-ups are modelled. The
model shows the effects of different city and store request parameters. When drop sizes are low and distances are
short, direct shipments with smaller vehicles outperform the current direct set-up. When drop sizes are low and
distances are long, collaborating in an urban consolidation centre (UCC) shows a saving. The model can be
further validated with data from other cities and other distribution set-ups.
⁎
Corresponding author.
E-mail address: bram.kin@vub.be (B. Kin).
https://doi.org/10.1016/j.cstp.2017.11.009
Received 17 February 2017; Received in revised form 26 September 2017; Accepted 30 November 2017
Available online 07 December 2017
2213-624X/ © 2017 World Conference on Transport Research Society. Published by Elsevier Ltd. All rights reserved.
B. Kin et al. Case Studies on Transport Policy 6 (2018) 125–132
126
B. Kin et al. Case Studies on Transport Policy 6 (2018) 125–132
Table 1
Cost variables (own depiction based on literature review).
Number of receivers (#) Average stop time (h) Size area (km2)
Stop density (#/km2) Average distance depot to stop (km) Population (#)
Drop size (# items) Average distance between stop (km) Population density (p/km2)
Replenishment frequency (#/period) Average speed (km/h) Street density (% of urban area)
Parcel size/volume (m3) Shift length driver (h) Congestion factor (% delay)
Parcel value ($) Delivery vehicle; capacity volume (m3) Time restrictions
Volumetric weight of parcel (kg/m3) Delivery vehicle; capacity weight (kg) Vehicle restrictions
Annual rent depot ($/m2) Wage ($/h)
Capacity depot (m2) Fixed costs ($/period) Fuel price ($/l)
Annual number of picks (#)
Time needed per pick (h)
Delivery vehicle; annual costs ($/#)
Fuel consumption (liter/100 km)
hinder deliveries and can be divided between those specifically for the the influence of varying speeds in the city; e.g. a β of 2.0 means that the
vehicle (e.g., emission standard, size, weight) and time (Macário et al., average speed that the vehicle could drive in a free flow situation will
2008). Finally, the local wage level and fuel price influence the overall now be halved. The effects of increasing or decreasing monthly re-
costs (Otto et al., 2009). Table 1 lists the three categories with cost plenishment frequencies, f, is added. We assume that Q is equally di-
variables. vided over replenishment periods. As stops can be visited multiple times
per period, tstopi , should be multiplied by f. The total formula should be
multiplied by f and the variable r is changed to rj reflecting the specific
3. Mathematical cost-model
distance between depot j − 1 and depot j. Cases and loose items (e.g., e-
commerce) can be transported. Ci is in cases and Q in items. To translate
With input from the previous section – the logistics cost models
items to cases, p is introduced. An inefficiency factor, δ, corrects for the
(Daganzo, 2005; Gevaers, 2013; Tavasszy et al., 2010) and the cost
loose items taking up more space than full cases. The term Di is used
variables – a mathematical model is built to cost-model different dis-
both as an output of the equation as well as input variable. This is due
tribution set-ups. Last mile transportation consists, first of all, of
to the fact that the total distance covered influences the driving time,
transport costs which can be subdivided between time and distance. In
case of multi-echelon networks, transshipment facilities or depots are
added. At a depot there are costs for inventory and handling (space and
and therefore the shift length restriction. Using recursive estimatior Di ,
the value of Di will continuously be updated until the improvement is
ˆ
smaller than 0.01. As a starting point, only the volume restriction is
time costs). An overview of all cost drivers can be found in Appendix A
used to determine the number of tours m. Few iterations are needed
of Supplementary material. The main assumptions underlying the
when assuming that the shift length of the driver is approximately
mathematical cost-model are listed in Appendix B of Supplementary
matched with the volume capacity restriction, which is true when f is
material.
small. In the case of extra cross-dock depots, each depot serves its own
The transport time costs refer to the cost per km of driving a vehicle.
area, thereby dividing N by the number of depots. Furthermore, A will
It consists of a summation of the total distance travelled per vehicle
be divided by the number of depots, in equal parts. In case of joint
type i per tier, Di, multiplied by the cost per vehicle type, with a
delivery systems transport and depots are shared. For a shared set-up
maximum of n vehicles. Note that i reflects the vehicle type per tier and
with a UCC, costs are shared based on volume shipped, whereby V
another vehicle can be selected for another tier. It is assumed that an
represents the fraction costs. In this case N’ are the number of stops
optimal route is pursued when calculating the total distance. Due to the
reached by the sharing partners and Q’ the extra volume created per
high complexity of the problem, where the number of stops N is large,
stop. z1 is the Boolean telling if j is non-shared (0) or shared (1) and z2
solving the VRP to determine the optimal total distance is not possible.
when N’ are the same stops (0) or new ones (1). Shapley and Scarf
Daganzo (2005) created an estimation function for the expected total
(1974) discuss economic models for sharing commodities that are in-
distance of a route (D). The estimation function consists of two parts.
herently indivisible using a cooperative game theory approach. How-
The average distance from the depot to the stops (r) and the distance in
ever, for this research it is assumed that both the transport costs and the
the area between the stops. For the second part, a uniform distribution
depot costs are shared based on volume shipped. The costs per i per
N over service area A is assumed with k as a dimensionless constant that
km,CiD , consist of fuel consumption, fuel cost, purchase price, depre-
depends on the metric (k ≈ 0.57 for the Euclidean metric, and k ≈ 0.82
ciation, average annual km, maintenance and insurance. The transport
for the L1 metric). In practice, this might not always hold as there are
distance costs for the final tier can be calculated by combining Eqs.
streets with multiple stops and streets where there are no stops at all.
(3.1)–(3.3). In non-final tiers − to the depots − the stop time will be
However, because the distance travelled is not overly sensitive to de-
higher than at the stops due to unloading of full vehicles. However, as
viations from the ideal design, the distance formula should be accurate
the number of stops is much smaller, the shift length constraint will
(Daganzo, 2005). The number of tours, m, is determined by the capacity
never be reached to its full potential. Therefore, only the volume ca-
of a vehicle type, Ci in N it can serve. In practice the vehicle fill rate can
pacity of the vehicle will determine the number of tours.
be lower than 100% because of the shift length of the driver. Therefore,
m should be the max function of volume restriction and shift length
restriction. Q is the average monthly demand of stop N, τi is the total
⎛⎡
⎜
m = max ⎢
N· (
Q/f
p
+ z1· N ′·
Q′ / f
p )
·(1 + δ ) ⎤
⎥·f ,
ˆ
⎡ Di + t · f ·(N + z · N ') ⎤⎞
⎢ vi / β stopi 2
⎥⎟
⎜⎢ ⎥ ⎢ ⎥⎟
time it takes per stop (stop time and driving time) per vehicle type i, Ci ⎢ Tl ⎥
⎜⎢
⎢
⎥
⎥ ⎢ ⎥ ⎟
and Tli is the shift length per i. It is assumed that either one of these ⎝ ⎢ ⎥⎠ (3.1)
restrictions is used optimally. The total time per stop is the sum of the
Di ≈ 2r j·m + k A·(N + N ′·z2 − 1) ·f (3.2)
average driving time per stop, and the stop time per vehicle tstopi . The
first time hit rate is 100% and stop time does not depend on the volume. n
Average driving time involves Di divided by N, subsequently divided by CTransportDistance = ∑ Di ·CiD·V
average speed, vi. A congestion factor β is inserted to be able to check i=1 (3.3)
127
B. Kin et al. Case Studies on Transport Policy 6 (2018) 125–132
For the transport time costs, Ti is multiplied by the time per i, CiT . The indirectly via distributors (on-board or with presales) and via whole-
latter is an input parameter based on the number of employees per salers (Blanco and Fransoo, 2013; Garza Ramirez, 2011; Otto et al.,
vehicle (i.e., driver, loaders) and the hourly wage. In case of a shared 2009). Whereas in Europe and the United States the majority of the
tier, the costs are shared with the UCC partners. The costs are shown in store owners go the wholesaler or modern retailer, in emerging
Eq. (3.4). It is assumed that in the case of transhipment facilities, full- economies manufacturers mostly work through distributors. Due to the
truckload (FTL) vehicles are shipped and no time constraint is active. high number of stores in cities, exclusive distributors are often used,
The stop time should be left out of the time cost calculation for the non- meaning that only the products of that particular company are sold and
final tiers to the transhipment facilities. The costs for unloading these delivered (da Silva, 2008; Garza Ramirez, 2011). Since nanostores often
vehicles are already being calculated in the (un)loading costs at the lack a storage room, a product is out of stock when it is not on the shelf.
depot. This leads to continuous inventory replenishment (Boulaksil et al.,
n 2014; Magalhães, 2010). Therefore, in order to drive sales, manu-
Dˆ
CTransportTime = ∑ ⎛ ν /iβ
⎜ + tstopi.f .(N + z2·N ′) ⎞⎟·CiT ·V facturers want to secure shelf space and try to supply as often as pos-
i=1 ⎝ i ⎠ (3.4) sible (Otto et al., 2009). One can therefore say that physical supply and
In case of transhipment facilities, the depot space costs refer to the sales are inherently linked and lead to inefficiencies. From a business as
costs for renting the depot and some fixed overhead. As shown in the well as sustainability perspective it is therefore necessary to reassess the
Eq. (3.5), Nj is the total number of depots of type j and CjF the monthly currently used distribution set-ups for small deliveries in terms of cost-
fixed costs per depot regardless of shipped volumes. Sj is the average effectiveness.
number of m2 needed for the depot based on the volume and CjS the cost With data from a FMCG company, the cost-effectiveness of four
per m2. For the depots it is assumed that cases have the same in- distribution set-ups to supply nanostores in a real megacity in an
efficiency factor as the vehicles, δ. A factor αj is introduced which is emerging economy is calculated.1 Currently the FMCG company uses a
defined as the space required per case in depot type j. A maximum distributor to exclusively deliver its products to a high number of na-
function is introduced to force the depot to be at least S jmin m2 since nostores in this city. First, the FMCG company delivers FTL to the DC of
vehicles need to arrive and minimum space is necessary for managers. the distributor which is located on the edge of the city. Due to the size
Again, the costs are split in case of a UCC. Inventory costs are not in- of the area and number of stops (high stop density), the distributor
curred and administration costs are left out of scope as it is diffuclt to divided the area. Each part is served by one distributor branch which is
assign costs to it. supplied from the DC on a daily basis. From each branch several
m thousands of nanostores are supplied on a weekly or bimonthly basis. A
⎛ ⎛ Q Q′ ⎞ ⎤ · αj ⎞ · C S ⎞ · V
CDepotSpace = ∑ ⎜Nj·⎜CjF + max ⎛⎜Sjmin ⎡⎢ ⎛N · p
⎜ + z1·N ′ ·
p⎠
⎟.(1 + δ )
⎥ Nj ⎟ j ⎟
sales employee of the distributor who represents the FMCG company,
j=1 ⎝ ⎝ ⎝ ⎣⎝ ⎦ ⎠ ⎠ visits several stores on a day to take orders (presales). Cases as well as
(3.5) loose items can be ordered. After collecting the orders, these are sent to
Depot time costs involve labour for unloading vehicles, picking of the branch where an aggregated pick-list is created. The combined
cases/items and loading. T Uj ,TjP and TjL are defined as the time it takes order of two sales employees are submitted to one vehicle; a van or
per case to unload, pick and load respectively. CUj ,CjP andCjL are the la- small truck. On the vehicle there is a driver and one or two loaders.
bour costs for unloading, case picking, and loading (Eq. (3.6)). Products are delivered following the same tour as the sales employee.
After the delivery at the store they receive the payment.
m
⎛ ⎞ Q Q′ ⎞ The case study focuses on an area within the megacity that is sup-
CDepotTime = ∑ ⎜T Uj ·CUj + TjP·CjP + TjL·CjL⎟·⎡⎢N · p + z1·N ′ ·
p⎠
⎟.(1 + δ )
⎤·V
⎥ plied from one distributor branch. It thus concerns the very last mile. In
j=1 ⎝ ⎠⎣ ⎦
addition to the direct distribution set-up, three other set-ups leading to
(3.6) multi-echelon settings are modelled. In the second set-up, an additional
When combining equations Eqs. (3.1)–(3.6), the total costs applic- cross-dock (XD) depot is added. In the XD goods are transshipped into
able to each set-up are yielded. The model is non-linear and the aim is smaller vehicles. No inventory is held at the cross-dock depots. The
to see the effects when different parameters are changed. It is translated purpose of this set-up is to create more efficient transport by increasing
into an Excel tool, from which the results can be derived. vehicle fill rates. The third set-up concerns sharing a cross-dock depot
and vehicles for final deliveries with other distributors in a UCC. The
4. Analysis purpose is to increase the volume per vehicle by cooperating with other
companies thereby decreasing the costs per item. In the final set-up
4.1. Set-up goods are first shipped to a UCC and hereafter to a XD in order to de-
crease distances to the stores. Consequently this leads to a multi-
To validate the mathematical model a case study is conducted. The echelon setting with three tiers.
model is applied on the last mile transport towards small independent During the final tiers of a delivery round, the driver and loader(s)
retailers in a megacity. Freight flows towards small independent re- pick cases and items at each depot and deliver them to the stores. These
tailers, in literature also known as nanostores, are highly fragmented operations are captured in an average stop time. Hereafter, they drive
(Blanco and Fransoo, 2013). Nanostores are typically smaller than to the next store, and the process repeats, until their vehicle is empty
15 m2 and are the dominant retail channel in most emerging economies; and they drive back to the depot. The vehicles are restricted on either
i.e., 61% of the retail market in Latin America and more than 90% in the shift length of the drivers or the volume capacity of the vehicle. In
India (Kin et al., 2017). Compared to modern retail, the number of the set-ups with transhipment facilities, FTLs are shipped on the first
customers and products are considerably lower. From a logistics per- tier. At this depot the vehicles are completely unloaded and loaded into
spective, modern retailers rely on distribution centres (DC), cross-docks smaller vehicles. Different vehicle modes are included in the modelling.
and third party logistics (3PL) leading to relatively efficient logistics The set-ups are shown in the figure below (Fig. 2). Costs are calculated
characterized by the consolidation of goods from different manu- as soon as the vehicle leaves the branch. In the figure, the arcs represent
facturers. Contrary, nanostores have no logistics support and ways to
supply these stores are relatively inefficient. This is particularly caused
1
Due to confidentiality reasons, the company from which the data originate is not
by low drop sizes and high replenishment frequencies leading to low
mentioned, neither are the specific costs nor the megacity that has been visited to obtain
vehicle fill rates (Blanco and Fransoo, 2013; Morganti and Gonzalez- data. Cost values are either manipulated or left out. However, this will not influence our
Feliu, 2015). Five different supply strategies are distinguished for na- results because the intention is to compare the values between different alternative dis-
nostores: on-board sales, presales with direct store delivery (DSD), tribution set-ups.
128
B. Kin et al. Case Studies on Transport Policy 6 (2018) 125–132
a transport job, composed of distance and time (transport time costs used as well. A case contains 6 items on average. Because of the small
and transport distance costs). The squashed rectangles represent depots size of the area and the high density the distance between the branch
subdivided in costs for inventory and handling (depot space costs and and the nanostores (set-up 1), and between branch-XD/UCC is 3 km,
depot time costs). In order to see the influence of different store request whereas the distance to the nanostores is 0.5 km (set-up 2–4). This is
parameters, costs are calculated per month. due to the fact that the locations of the depots can never be perfectly
located such that the sum of the distances per tier equals the direct
distance from the branch to the nanostores in the direct set-up. The
4.2. Data and input parameters detour factor is set to 1.10 (Justen et al., 2013). Finally, the number of
stops visited by the UCC partners are exactly the same stores that the
Data and input parameters originate from different sources. First of FMCG company visits, and the number of items ordered per store are
all, the costs of the four distribution set-ups are based on the monthly equal. The company’s share in the UCC is 50%. The number of UCCs (U)
sales data of the FMCG company in the megacity. The sales data reveal and XD 1 depots (cd1) is set to 2, while the number of XD 2 depots (cd2;
that the monthly order frequency per store in the megacity varies: 22% set-up 4) is set to 4. This means that the demand per branch is split in
orders monthly, 22% fortnightly, 18% three times per month. 90% of two, and the demand per UCC for set-up UCC+XD is again split into
the nanostores included, order between one and five times. The order two. The decision on how many UCCs and cross-docks to use for the
quantity per order is a major cost driver. More volume are more costs, model is pragmatic. Inserting more depots in the network increases
but due to economies of scale the cost per item will decrease. 45% of depot costs. It will, however, decrease the distances covered. All input
the orders contain between 0 and 25 items. This shows the small size of parameters are given in Appendix A of Supplementary material.
the nanostore channel. About 85% of the orders contain 100 items or
less and the average order quantity is 58 items, with a standard de-
viation of 93 items. Average monthly order size equals 144 items. In 5. Results
addition to available (sales) data, ideally, one would try to find supply
chain cost data from different sources, combine them, and use regres- In this section the results of the analysis as described in the previous
sion analysis to determine the most impactful predictors. One could section are shown. This is followed by sensitivity analyses to see the
then fill in different cases (i.e., cities) and see the effects of different influence of different store request and city parameters. Fig. 3 shows the
parameters under different circumstances. However, as 3PL companies total costs per set-up. One can see that the direct set-up has the lowest
are exceptionally non-transparent in their cost structure and price set- cost, specifically due to the absence of depot costs (for both rent and
ting, not all these data points are available. Supply chain costs are handling). Furthermore, the wage of the drivers are the biggest cost
therefore collected through a field visit in the megacity and validated driver for the transport part; three to four times the size of the transport
via interviews with supply chain experts from the company. distance cost (vehicle and fuel). Moreover, when comparing the trans-
Different input parameters are used for the case study. First, the size port costs of set-ups XD and UCC, which is non-shared versus shared
of the area served by one branch is 50 km2 and the number of nanos- respectively, the wage of the driver is almost halved due to the con-
tores served is 5000. The average demand is 150 items with a monthly solidation. Also, the depot rent costs are less expensive because the
replenishment frequency of 3. Large trucks (i1) with a capacity of 500 depot is shared in the UCC scenario. Depot handling increases about
cases are used for the non-final tiers; branch to XD/UCC. For the final 25% from set-up XD to set-up UCC due to the extra case picking
tiers to the nanstores, small trucks (i2) with a capacity of 250 cases are (consolidation) in the UCC. The main conclusion is that the extra costs
used. In the sensitivity analyses motorbikes (i3) and bicycles (i4) are for the depots, being both rent and handling, are greather than the
129
B. Kin et al. Case Studies on Transport Policy 6 (2018) 125–132
Fig. 4. Costs per item for varying distances for all set-ups.
130
B. Kin et al. Case Studies on Transport Policy 6 (2018) 125–132
131
B. Kin et al. Case Studies on Transport Policy 6 (2018) 125–132
132