Next Article in Journal
A Crowdsourcing Approach for Sustainable Last Mile Delivery
Next Article in Special Issue
Analysis of Evolution Mechanism and Optimal Reward-Penalty Mechanism for Collection Strategies in Reverse Supply Chains: The Case of Waste Mobile Phones in China
Previous Article in Journal
Urban Wasteful Transport and Its Estimation Methods
Previous Article in Special Issue
Bayesian Methods for Reliability Demonstration Test for Finite Population Using Lot and Sequential Sampling
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Pricing and Collaboration in Last Mile Delivery Services

1
Department of Industrial Management Engineering, Korea University, 145 Anam-ro, Seongbuk-gu, Seoul 02841, Korea
2
School of Industrial Management Engineering, Korea University, 145 Anam-ro, Seongbuk-gu, Seoul 02841, Korea
*
Author to whom correspondence should be addressed.
Sustainability 2018, 10(12), 4560; https://0-doi-org.brum.beds.ac.uk/10.3390/su10124560
Submission received: 20 October 2018 / Revised: 25 November 2018 / Accepted: 29 November 2018 / Published: 3 December 2018

Abstract

:
Recently, last mile delivery has emerged as an essential process that greatly affects the opportunity of obtaining delivery service market share due to the rapid increase in the business-to-consumer (B2C) service market. Express delivery companies are investing to expand the capacity of hub terminals to handle increasing delivery volume. As for securing massive delivery quantity by investment, companies must examine the profitability between increasing delivery quantity and price. This study proposes two strategies for a company’s decision making regarding the adjustment of market density and price by developing a pricing and collaboration model based on the delivery time of the last mile process. A last mile delivery time function of market density is first derived from genetic algorithm (GA)-based simulation results of traveling salesman problem regarding the market density. The pricing model develops a procedure to determine the optimal price, maximizing the profit based on last mile delivery time function. In addition, a collaboration model, where a multi-objective integer programming problem is developed, is proposed to sustain long-term survival for small and medium-sized companies. In this paper, sensitivity analysis demonstrates the effect of delivery environment on the optimal price and profit. Also, a numerical example presents four different scenarios of the collaboration model to determine the applicability and efficiency of the model. These two proposed models present managerial insights for express delivery companies.

1. Introduction

A rapid increase in indirect purchases is accelerating a steep surge of express delivery service market. This incremental result is mainly due to an increasing consumption through online-based transactions such as internet shopping, mobile shopping and TV home shopping, which has naturally led to a growth of express delivery services. Figure 1 shows the recent trend for the courier market in Korea. It is observed that the courier amount has continuously been growing year by year. On the other hand, the unit price has been dropping due to the greater competition among courier service providers [1]. At the end of the day, the express delivery companies with low market share are not likely to survive in competitive market and cannot help avoiding collaboration for increasing their market shares company. More than 80% of market is occupied by only five companies and especially, about 67% is by three companies and a big on covers 45% of entire market [1].
Based on a recent article by Business Insider their shares of delivery costs are reported to be 4%, 37%, 6% and 53%, respectively [2].
Many researches related to the express delivery companies focused on cost minimization by varying network distances. Therefore, since the transport networks managed by express delivery companies already reflect delivery environment, it can be said that express delivery companies are using the optimal route. In addition, hub location problem, which is dealt with express delivery related researches, is also reflected well in the real world. Thus, cost reduction through relocation of the hub terminal is not easy since express delivery companies’ hub terminals are already located in near optimal locations. Therefore, profit maximization through cost reduction from other processes is needed instead of cost minimization through changing already existing networks.
As delivery supply is increasing immensely every year, the express delivery companies are planning enormous investments in expansion of hub terminals to handle increased delivery amount. However, as expanded hub terminals deal with increased supply, securing massive delivery quantity raises another problem. In order to obtain increasing delivery quantity, price reduction can be one solution, but there needs to be a fundamental solution if the investment is on large scale to secure delivery supply that will guarantee the company’s profitability.
This study emphasizes delivery amounts as market density in perspective of delivery service company and proposes a pricing model to confirm profitability in consideration of the market density. Also the variation of maximum profit in regards of price changes through the analysis of the pricing model is suggested. In addition, this paper suggests the collaboration model as a solution to increase competitiveness and to secure delivery quantity to small and medium-sized companies, to whom massive investment is difficult. This model is a strategy for small and medium-sized companies to win competitiveness against major companies. Also through collaboration, participating companies can reduce cost and increase profit through collaboration and decrease the CO2 emission quantity generated through transportation simultaneously. With respect to these two solutions, we suggest managerial insight on market density and pricing with sensitivity analysis and numerical example.
The rest of the paper consists of the following: Section 2 introduces the previous studies related to pricing and collaboration of express delivery companies. Section 3 describes the definition of pricing and collaboration of express delivery companies. Section 4 demonstrates two types of mathematical models. Section 5 shows two numerical examples. Section 6 suggests managerial insights gained by analyzing the results from Section 5. Lastly, Section 7 provides the conclusion and further research prospects.

2. Literature Review

2.1. Last Mile Delivery

While many analytical studies related to express delivery services have been undertaken, the literature dealing with the market density and price decision in the last mile delivery services is scarce. Boyer et al. evaluated the effects of customer density and delivery window patterns in the last mile delivery process [3]. They performed a simulation where customer density and delivery window length were considered as variables and analyzed the effect on the last mile route efficiency. Gevaers et al. developed a last mile typology and instrument to simulate the total last mile costs. The transportation cost was derived through considering the transportation time and distance [4]. Kim et al. analyzed the impact of increasing demand on the parcel distribution network structure in terms of minimizing transportation and sortation costs [5]. Alibeyg et al. developed the net profit model that maximizes profit due to the routing commodities, which mainly focused on network design to maximize the net profit [6]. Zhou et al. suggested a location-routing problem with simultaneous home delivery and customer pickup [7]. Hu et al. proposed a vehicle routing problem with hard time windows under demand and travel time uncertainty [8]. The object of the model is to minimize the number of vehicle routes and total travel distance. Xuefeng et al. suggested a multi-objective location-routing problem with simultaneous pick-up and delivery [9]. Zhou et al. proposed a bi-level multi-sized terminal location-routing problem with simultaneous home delivery and customer pickup [10]. Regarding market density or demand for delivery services, Felisberto et al. introduced recipient pricing in the postal sector and tested with Swiss post data by considering the area and the amount of congestion [11]. Cebecauer et al. used Open Street Map data to model the demand points which approximate the geographical location of customers, and the road network, which is used to access or distribute services. They considered all inhabitants as customers, using population grids, and compared two different demand models by estimating the optimal structure of a public service system due to the differences between population grids [12].

2.2. Pricing Decision

Numerous studies have been undertaken in various industry fields related to the price-demand model. Mills introduced a single-period newsboy model with a linear demand function [13]. Polatoglu considered simultaneous pricing and procurement decisions associated with a single-period pure inventory model under deterministic or probabilistic demand [14]. Abad investigated a dynamic pricing and lot-sizing problem with a more general demand function [15]. Hong and Lee proposed model that the price and guaranteed lead time decision of a supplier offering guaranteed lead time for product including a lateness penalty [16]. The expected demand is suggested in a function of the price, guaranteed lead time and lateness penalty. Hong and Lee also proposed an optimal time-based consolidation policy with price sensitive demand [17]. They considered a single-item inventory system where shipments are consolidated to reduce the transportation and developed a mathematical model to obtain the optimal price, replenishment quantity and dispatch cycle to maximize the total profit. Ahmadi-Javid et al. considered a profit-maximization location-routing problem with price-sensitive demands [18]. The problem determined the location of facilities, the allocation of vehicles and customers to established facilities and the pricing and routing decisions in order to maximize the total profit.

2.3. Collaboration

Related research on collaboration have been studied in various industry fields have been studied. Cruijssen et al. measured the dependence of the synergy on a number of characteristics of the distribution problem under consideration and found that significant cost savings are achieved [19]. Lozano et al. suggested a linear model to study the cost savings through forming the transportation [20]. They solved an optimization model for different collaboration scenarios. Kimms and Kozeletskyi suggested a cost allocation scheme for a horizontal cooperation among traveling salesmen providing expected costs for the coalition members [21]. They calculated cost allocation by using the core concept. Wang et al. suggested a collaborative multiple centers vehicle routing problem with simultaneous delivery and pickup to minimize operating cost and the total number of vehicles in the network [22]. They proposed a hybrid heuristic algorithm combining k-means and non-dominating sorting genetic algorithm (GA). Cheung et al. proposed an integer programming model for collaborative service network design by sharing service centers [23]. Ferdinand et al. suggested a collaboration model considering pick-up and routing problem of line-haul vehicles for maximizing the profits of participating companies [24].
In this paper, the travel time was computed through considering market density in unit delivery area and developed the function of last mile delivery time regarding market density (LMF) by solving the travelling salesman problem (TSP) by using GA. Most of the studies dealing with price and cost in last mile delivery and express delivery considered minimizing the cost through optimizing the network design. They also converted transportation time into cost with coefficient values. Instead, we suggest LMF converts market density into demand and computes travel time. The relationship between delivery service and market density was studied before by [3], however, they only performed a simulation experiment and did not suggest any models. We propose LMF and the pricing model which considered market density and travel time simultaneously. The profitability in last mile delivery is computed in the pricing model by considering the changes in the market density and travel time. The pricing model decides the optimal price to maximize the profit which was used in various industries for a long time. As our study focuses on the price decision in last mile delivery, we calculate the travel time by considering the market density and converting it into a linear demand function [15]. By applying the LMF into the pricing model, more realistic-pricing model for the last mile delivery process was proposed, and observed the effect of the market density in the travel cost, optimal price and profit from last mile delivery. In addition we propose the collaboration model for last mile delivery companies. Participating companies share terminals in separate delivery regions and consider which terminal to share. The incremental profit is calculated. The total profit from collaboration is computed by using max–min criteria.

3. Problem Statement

In the era of time-based competition, today’s customers begin to demand responsiveness as an integral part of a service. As consumers increasingly turn to e-commerce for all their shopping needs, a quick response service becomes a critical mission for logistic companies and retail partners across the world. Express delivery companies have made several types of efforts for speedy fulfilment, most of which are focused on a delivery service network, terminal productivity and vehicle routing and scheduling, etc. Recently, last mile delivery as the final step of the delivery process, has emerged as a hot issue in fast delivery. As described earlier by Business Insider, the share of last mile is 53%, the highest of the elements of delivery cost [2]. In addition, last mile can be a key to customer satisfaction since it becomes the contact point at which the parcel finally arrives at the buyer’s door.
The objective of this study is to emphasize the impact of market density on price decision and forming the strategic alliance. First, we propose the delivery time-market density model. Secondly based on the time-market density model, two kinds of strategies to survive in the express delivery market are suggested; adjusting the price to maximize the profit, and reducing the transportation cost by forming a collaboration. In general, an express delivery service network consists of customer, service centers and consolidation terminals. Customers can be classified into three sub-regions: residential; industrial; commercial areas, where customers either ship or receive ordered parcel items. The service centers are used as a transshipment and temporary storage facility connecting customers to a consolidation terminal. At the consolidation terminal, customer orders are consolidated into larger shipments, mixed and then loaded onto delivery trucks for local deliveries [25]. This study mainly focuses on the last mile of the final step of the shipment process, which is depicted in Figure 2.
This study is divided into three sub-problems: First, an approximate function of last mile delivery time regarding market density (LMF) is derived using GA-based simulation results of traveling salesman problem with randomly generated customers. Next, according to LMF, a procedure is carried out for searching an optimal price for maximizing profit. Lastly, a collaborative delivery system is suggested for extending market share. For these purpose we make the following underlying assumptions throughout the paper:
(1)
Annual delivery service demand is evenly distributed and depends on the delivery service price.
(2)
Market share of each express delivery service company is the same in all service areas regardless of regional characteristics, which affects last mile delivery time.
(3)
Moving truck/worker and transaction to recipient, transaction time is ignored.
(4)
Although delivery costs comprise collection, sorting, line-haul and last mile costs, other costs excluding last mile cost are constant regardless of service price.
(5)
Most last mile delivery services are operated in one shift per day. However, delivery services in some companies are performed in two or three shifts in a day.
(6)
Daily working time for each express delivery company is the same.

4. Model Design

This section describes two methodologies to increase competitiveness of delivery companies; the first one is to increase their profit by controlling delivery service price and the second one is to introduce a collaborative delivery system for occupying stable market share. Prior to developing the system methodologies, a change of last mile delivery time related to market share is investigated.

4.1. Last Mile Delivery Time Function with Respect to Market Density

In order to observe a trend of last mile delivery time related to market share, actual delivery data was collected from three regions of a Korean express delivery company, which are shown in Figure 3. The company operates three shifts in a day and has around 40% market share in express delivery service market in Korea. It can be observed that the last mile delivery time depends on the attributes of service areas. If we can derive a relation equation of last mile delivery time versus market density, last mile delivery time for each service region can be found under the assumption that market share and attributes of regions are given.
For this purpose, a simulation for gathering last mile delivery data according to density has been carried out. The data is obtained by solving the TSP. The procedure for deriving a last mile delivery function of market density is described as follows:
(Step 1)
Generate random demand points within unit square. At this time, we assume that the market density is 10% if 10 demand points are generated.
(Step 2)
Solve TSP by a GA-based heuristic assuming that the position of service center is located at (0, 0) and then calculate the average moving time. For every market density, 100 experiments are done.
(Step 3)
By continuously increasing demand points by 10 up to 100(%) demand points, the average traveling time is calculated. It is performed under the assumption that all generated demand can be served by only a truck.
(Step 4)
If we denote market density as an independent variable, we can find an approximate LMF.
(Step 5)
Define a time shape as an average last mile delivery time to a LMF value with the same market share. Then we can estimate a trend of last mile delivery time according to the change of market share.
With average delivery time related to market density from the results of the GA heuristic in Table 1, the LMF, depicted in Figure 4, can be expressed as:
f ( π )   =   0.00005 π 2 0.8347 π + 0.3764
where π denotes market density and a coefficient of determination, R 2 is 0.9896.
If data collection and analysis for some service regions is performed, we can calculate the time shapes for the service regions, which enables us to estimate the trend in unit last mile delivery time according to market share.

4.2. Pricing Model

In this section, the pricing model for an express delivery service considering the average last mile delivery time according to market share of the company is developed. The objective of the model is to maximize the profit of express delivery company by adjusting the unit delivery price. Reducing the price can expand market share and increase possible customer density, which can provide unit delivery cost, especially last mile delivery cost. Prior to developing the profit model, the following notations are introduced.
Notations for Pricing Model
p Unit delivery price
c Unit last mile delivery cost
D ( p ) Delivery demand function, which is defined as a b p , where a > 0 and b > 0
N Total delivery demand in certain region
t Average last mile delivery time per delivery service
T Daily working time
dDaily delivery amount
wDaily cost for last mile delivery worker, i.e., daily worker income
K Other delivery cost excluding last mile delivery cost
Model Design
In order to establish the profit model, unit last mile delivery cost is firstly derived with the relationship between daily delivery amount and last mile delivery time per delivery service. The daily delivery amount during working time can be represented as:
d   =   T t
with daily delivery amount, daily delivery worker cost becomes:
w   =   c × d
Assuming that w is constant regardless of service areas, unit last mile delivery cost, c is obtained by:
c   =   w d   =   w × t T
This means that last mile delivery cost for each service region depends on average last mile delivery time, which is expressed as a function of market density. From now on, market share is derived with unit delivery price. If total delivery demand, N and the demand for a company in any region, D ( p ) are given, the density for the company is defined as D ( p ) N . According to Abad et al.’s linear demand function [15], the demand function in this paper is referred as a linear demand rate function of price, D ( p )   =   a b p , where a > 0 and b > 0 . With D ( p ) and (1), unit last mile delivery cost, c can be represented as a function of unit delivery price, c ( p ) , which is:
c ( p )   =   w × ( 0.00005 ) ( a b p N ) 2 0.8347 ( a b p N ) + 0.3764 T
Therefore, the pricing model is defined as:
Max   Z ( p )   =   ( p c ( p ) ) D ( p ) K
where   0 <   p   < a b
In the objective Function (6) K means other delivery service cost excluding last mile delivery cost such as collection, terminal operating and line-haul costs, etc. and is assumed to be independent of p. Since Z ( p ) is a polynomial function of p, we can find an optimal solution considering the constraint (7). The optimal price for profit maximization is found in the pricing model. In order to obtain an optimal solution, we evaluate the optimal price to maximize the profit through differentiation. Since the objective function is a cubic function, we obtain two different optimal prices. Also, since the delivery demand follows a function of D ( p )   =   a b p , the delivery demand needs to be larger than 0. Thus, the optimal price should be within the range of 0 < p < a b . We seek the existing optimal price within the corresponding range and derive maximum profit relative to the optimal price. The calculation of the optimal price and profit is explained precisely in the Appendix A.

4.3. Collaboration Model

In this section, the collaboration model for express delivery service to expand market share of the company is proposed. While the pricing model is recommended for most companies regardless of their market shares, the collaboration model is mainly applied to small and medium-sized delivery companies.
A mathematical model for collaborative last mile delivery is developed to maximize the incremental profit of each participating express delivery company by saving last mile delivery cost. Suppose there is a county with n service regions, which are served with m express delivery companies. Each company has a relatively small delivery amount, which incurs a higher last mile delivery cost compared to the companies with lager market share. Collaborative delivery is proposed to expand their service density, and ultimately to decrease last mile deliver cost. The collaboration implements as follows:
(a)
In most service regions, only a single company can do a last mile delivery service.
(b)
The delivery amounts of the other companies are all assigned to the selected company after collaboration.
The following notations are introduced to establish a multi-objective integer programming model for collaborative last mile delivery:
Notations for Collaboration Model
I Set of express delivery companies, I = {1,2,…,m}
J Set of service regions in which service centers are to be merged, J = {1,2,…,n}
c i j Unit delivery cost of company i in the service region j, i I, j J
t i j Unit delivery time of company i in service region j, i I, j J
d i j Daily delivery amount of company i within the merging region j, i I, j J
D j Total delivery amount of collaborating companies in service region j, j J
c j 1 Unit delivery cost after alliance in the service region j, i I, j J
c j 2 Unit mandated delivery cost after alliance in the service region j, i I, j J
t s j Time shape of service region j representing regional attribute, j J
x i j Binary variable such that xij = 1, if company i is responsible for service region j after alliance, xij = 0 otherwise, i I, j J
L i Lower bound for number of service regions of company
U i Upper bound for number of service regions
Model Formulation
Since last mile delivery time of company i for a service region j is obtained by multiplying time shape t s j and the value from (1), therefore, we can derive last mile delivery cost, c i j for each company from (1) and (4).
After applying a collaborative last mile delivery service, the incremental profit of company i through an alliance can be divided into three portions. First, if company i is responsible for service region j , the incremental profit for its own demand becomes ( c i j c j 1 ) d i j x i j . In addition, the company can get the profit, ( c j 2 c j 1 ) × ( D j x i j d i j ) for the demands of the other companies. On the other hand, even if company i does not have a right to do a delivery service in the service region j , its incremental profit for its own demand is ( c i j c j 2 ) × d i j ( 1 x i j ) . Then by summing the three portions of incremental profits of company i , the objective function for company i can be derived as follows (8):
Max             g i ( x )   =   j [ ( c j 2 c j 1 ) ( D j + d i j ) x i j + { c i j + c j 1 2 c j 2 } d i j ]
Therefore, the collaboration model can be formulated as multi-objective integer programming model with m objective functions:
Max           g 1 ( x )   =   j [ ( c j 2 c j 1 ) ( D j + d 1 j ) x 1 j + { c 1 j + c j 1 2 c j 2 } d 1 j ] Max           g m ( x )   =   j [ ( c j 2 c j 1 ) ( D j + d m j ) x m j + { c m j + c j 1 2 c j 2 } d m j ]
Subject to,
i I x i j   =   1 ,                                                                         j J
L i j J x i j U i ,                                                 i I
x i j { 0 , 1 } ,                                                                         i I ,   j J
The objective Function (9) represents the sum of incremental profit obtained through collaboration. Constraint (10) assures that only one service center can be selected for the last mile delivery service in each service region. Constraint (11) implies that the number of service regions should belong to the controlled range. Finally, Constraint (12) represents a binary variable as decision variables showing which company is responsible for each service region. Since in the mathematical model there are m objective functions representing the net profit increases of m companies, there exists a trade-off relationship with each other.
The proposed collaboration model is a multi-objective assignment problem where the objective is to maximize the incremental profit by forming a collaboration. Under the assumption that only one terminal is used in one region, we calculated reduced cost and incremental profit for participating companies by using max–min criteria. Also, we evaluated the determination of which company’s terminal in the region will be used.
The maximum profit of the objective function is derived in usage of max–min criteria. This collaboration methodology is used to reduce the rate of imbalance rate of distribution of the total profit from collaboration to compromise the optimal solution in the win–win situation of each company.

5. Numerical Example

Two illustrative examples are provided to explain the appropriateness of the pricing and collaboration model. We performed sensitivity analysis for the pricing model considering parameter values in the model. Also, we calculated incremental profit by using collaboration model in 4 different scenarios

5.1. Pricing Model

The following parameters are used in the first case. a   =   200 , b   =   30 , K   =   1   and N = 800. We assume that daily total working hours are T [ 9 , 10 , 11 ] . We examined how difference in labor cost and working time affects optimal price and profit.
From Table 2 and Figure 5, the optimal price increases as the labor cost increases. As for an express company, when the labor cost increases, it has to increase the price in order to secure the least profit. When daily working time is short, the optimal price increase.
Figure 6 shows the variation of the profit when labor cost and daily working time differ. When labor cost increases, the profit decreases. A company can see the certain point where the profit may not occur from the delivery when labor cost reaches a certain point. Difference in daily working time affects the decreasing rate of profit as labor cost increases. This shows that a company cannot increase labor cost infinitely, and it can calculate the standard for the labor cost.
We then performed another case where a = 200, b = 30, K = 1 and w = 150. We assume that daily total working hours are T [9,10,11]. Table 3 explains the difference in optimal price and profit when total delivery demand in certain delivery region changes.
Figure 7 shows the difference in rate of optimal price when total delivery demand changes. The increase in total delivery demand in a region is equal to the decrease in the market density. Therefore, the price increases when the market density decreases. The effect of the total working time to the optimal price showed similar results as the first case. When total working time increases, the optimal price increases.
Figure 8 shows the variation of the profit when total delivery demand changes. Increased total delivery demand results in the reduction of market density, and directly affects the profit. The effect of the difference in the total working time showed similar results as in the first case. In the second case, when demand parameter is a = 300 and b = 30, the total working time must exceed 9 h per day because, as shown in Figure 8, the profit does not occur from the delivery.

5.2. Collaboration Model

We assumed that there are three express service companies, and we calculated the incremental profit from four different collaboration scenarios where the market density for each company differs: (1) 5%, 10% and 15%, (2) 5%, 5% and 20%, (3) 9%, 10% and 11%, (4) 5%, 12% and 13%. An area is selected for a collaborative last mile delivery service with express service companies. The area is divided into 10 service regions according to regional attributes, which are shown with the demand of each company in Table 4, Table 5 and Table 6. The tables respectively show last mile delivery time and unit last mile delivery cost for each company according to the regional attributes. Time shape values for each region are obtained by using the last mile delivery time function of market density and actual average delivery time. Assuming that each delivery service worker’s income is constant regardless of the number of units, the delivery costs are calculated. We also assumed that daily working hours are eight hours, and transaction time per delivery order is two minutes. C1 and C2, shown in the last two columns in Table 6, represent the delivery cost after collaboration and mandated delivery costs. In the first case, by considering current market shares of each company, the lower bound and upper bound of selected service regions are defined as 1 and 3 for company A, 3 and 5 for company B, and 5 and 7 for company C. Applying Chung et al.’s procedure to the collaboration model with Table 4, Table 5 and Table 6, we can obtain the optimal solution based on max-min criterion using Excel Solver, which is shown in Table 7. We applied the same procedure for the rest of the scenarios and compared the results [23].

5.2.1. Collaboration Scenario 1: Market Density of Participating Companies (5%, 10% and 15%)

In regions 9 and 10, company A is selected for the last mile delivery service. Company B covers the regions 2, 4, and 5, and company C is responsible for the regions 1, 6, 7, and 8. The number of service regions for each company is 2, 3, and 5, respectively. The values of objective function of companies A, B, and C are g A = 303.5, g B = 384.1, and g C = 439.5.

5.2.2. Collaboration Scenario 2: Market Density of Participating Companies (5%, 5% and 20%)

The second scenario included the collaboration among two small-sized companies and one major company.
As shown in Table 8, we calculated the costs when collaboration is formed among the companies with market density of 9%, 10%, and 11%. Table 9 shows companies A and B only cover two regions each, while company C covers a total of six regions. The profit for companies A, B, and C are g A = 91.3, g B = 91.3, and g C = 285.7.

5.2.3. Collaboration Scenario 3: Market Density of Participating Companies (9%, 10% and 11%)

The third scenario included the collaboration among three medium-sized companies. Table 10 shows the cost reduction when collaboration is formed and the market density increases. From Table 11, it can be found that five regions are covered by company A, three by company B, and two by company C. The profit for companies A, B, and C are g A = 373.9, g B = 383.6, and g C = 373.9.

5.2.4. Collaboration Scenario 4: Market Density of Participating Companies (5%, 12% and 13%)

The last scenario considers collaboration among one company with low market density and two medium-sized companies. In Table 12, the reduced costs were calculated in each region after collaboration. Table 13 shows that company A covers 3 regions, company B covers 4 regions, and company C covers 3 regions. The profit for companies A, B, and C are g A = 347.0, g B = 424.4, and g C = 367.5.

6. Discussion

6.1. Customer Service Quality

According to the LMF suggested in this paper, the change in travel time with the variation of market density can be confirmed. In other words, an increase in market density reduces the travel time, and this can eventually lead to a reduction of delivery time of the delivery service drivers.
Boyer studied how customer density and delivery window pattern affect the efficiency of last mile delivery [4]. However, a model was not proposed in this study. Instead, the study showed how customer density and delivery window patterns change last mile delivery time through simulation. In this paper, demand points in delivery area are randomly generated through GA, and this generating process was carried out 100 times for each of the experiments to obtain LMF, which is the approach that reflects a more realistic delivery process.
This signifies that the delivery carriers can handle more quantity within their total working time and increase customer service satisfaction at the same time. However, a decrease in market density means an increase in travel time and decrease in delivery quantity, which may lead to lower customer service quality.
In the previous studies, the travel time was generally calculated through delivery network design and was converted to cost values. The optimization for delivery network design has been studied for a long time. In this paper, however, we developed a last mile delivery function to calculate the travel time while considering the market density. There are studies that consider the effect of the market density in last mile delivery service, but these studies only performed simulation to achieve managerial insights. In this paper, we propose LMF and a pricing model, which can be considered as the more realistic last mile delivery pricing model.

6.2. Pricing Model

Since travel cost is obtained through LMF, it is possible to examine the effect of market density on price and profit, which satisfies the establishment of the pricing model in this paper. In addition, since the existence of the optimal solution in the pricing model is proven through differentiation, the solution approach is appropriate.
From the results of the sensitivity analysis in Section 5, we examined how the optimal price and profit change when the labor cost, daily working time, and total delivery demand in certain regions differ.
Nowadays, conflict between company and delivery workers is becoming aggravated. Delivery workers are demanding more labor costs and shorter working time while a company tries to adjust these elements to earn more profit. Other than labor cost and total working time, the variation of total delivery demand in a region affects the optimal price and profit. The numerical example in Section 5 shows that when the market density decreases, the price increases and the profit decreases. In addition to the effect of labor cost and working time, a company can use the proposed pricing model as the guideline for making better investment decision to expand the capacity of terminal facilities.

6.3. Collaboration Model

Small and medium-sized express delivery companies, who have a hard time investing, may use the proposed collaboration model to decide whether to collaborate with other companies and with which companies to collaborate.
For the collaboration model, max–min criteria is used to solve the objective function regarding incremental profit of participating companies. Although max–min criteria may result in smaller total collaboration pie, since the difference in profit allocation among the participating companies is the smallest with max–min criteria, it is the method that can raise the satisfaction of companies that participate in collaboration.
The proposed model showed that profit occurs when a terminal and delivery volume is shared through collaboration. In addition, we suggested four different types of collaboration, which considers the difference in market density of participating companies. In Section 5, the profit from collaboration showed difference depending on the market density of participating companies. Therefore, with the results from the numerical example, a company can make the right decision to find right cooperator to achieve the maximum profit.
Also, through collaboration, companies can reduce travel cost and other costs such as terminal operation cost. Most small and medium-sized companies do not earn enough profit due to big investments in building new terminals or developing new services. Therefore, the proposed collaboration model is a win–win and sustainable solution for small and medium-sized companies in the long term. In addition, collaboration among companies can solve environmental problems by reducing carbon emissions during delivery.

7. Conclusions

While the express delivery service market has been steadily increased according to rapid increase in business-to-consumer (B2C) demand, delivery service companies have to overcome more severe competition in the market. In order to survive in the competitive delivery service environment, they have made many efforts to establish several strategies such as service network optimization, efficient flow management, increased terminal productivity, etc. Nowadays, a quick response has been recognized as an index for representing customer satisfaction levels. It makes the express delivery service companies apply themselves to the last mile delivery process in a delivery service.
This study suggested pricing as well as collaboration models for increasing the competitiveness of delivery companies, based on the time-market density model. In the pricing model, a procedure for finding an optimal price to expand delivery service market was introduced. A last mile delivery time function of market density was also derived with GA-based simulation results of the traveling salesman problem with randomly generated customers. In addition, a collaboration model was proposed as another strategy against the difficult market situation to mediate service price. A multi-objective integer programming problem was developed and solved based on the max–min criterion. The applicability and efficiency of two proposed models were demonstrated through an illustrative numerical example. It will be beneficial to conduct case studies with real data collected from express delivery service companies.
The solution procedures for proposed models have limitations. In the pricing model, we mainly focused on the travel cost. By using LMF, a more realistic last mile delivery cost was calculated. However, we considered costs other than travel cost as constant value. In the real world, as market density differs other costs such as terminal operation costs can be affected. Including the total process of express delivery into the proposed model can make the suggested pricing model more realistic.
The suggested collaboration model considered incremental profit which assumed that collaboration always secures profit for participating companies. However, as shown in Section 5, in some cases, based on the market density of participating companies, collaboration does not always guarantee the satisfaction of companies. In this paper, we used max–min criteria to calculate the profit for participating companies. Max–min criteria have limitations because this is a method of calculating the minimum profit of a whole collaboration while reducing the imbalance of profit between participating companies. Other methodologies used game theory studies for more reasonable distribution of total profit to increase the satisfaction of participating companies.
In future studies, several types of demand functions of price will be considered in pricing model. In addition, we can apply our suggested time-density model and pricing model to other express delivery research to modify it, considering the expected profit from forming different types of hub network. Also, collaborations model will be developed and compared with each other under various criteria such as max-sum. Furthermore, development of fair allocation methods of coalition profit will be included in order to sustain long-term collaboration.

Author Contributions

C.L. came up with the research ideas and initiated the research project as a corresponding author. S.Y.K. developed the mathematical models and wrote the paper. S.W.C. performed simulation and analyzed the results. All authors have proofread and approved the final manuscript.

Funding

This research was supported by the Framework of International Cooperation Program managed by the National Research Foundation of Korea (NRF-2016K2A9A2A11938449).

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

In this section, the procedure for finding an optimal price to maximize the profit is explained. From (5) and (6) Z ( p ) can be represented as:
Z ( p )   =   ( p w × ( 0.00005 ) ( a b p N ) 2 0.8347 ( a b p N ) + 0.3764 T ) ( a b p ) K
For simplicity of notation, the constant term K in (A1) is ignored. For finding an optimal price to maximize Z ( p ) , its 1st-order derivative, Z   ( p ) is given by:
Z ( p )   =   ( w ( ( 0.8347 ) b N ( 0.0001 ) b ( a b p ) N 2 ) T 1 ) ( a b p ) b ( x w ( ( 0.00005 ) ( a b p ) 2 N 2 ( 0.8347 ) ( a b p ) N + 0.3764 ) T )
By Z ( p )   =   0 , two solutions, p 1 and p 2 are obtained as:
p 1   =   1 3 b 2 w ( 20000 N 2 T 16694 N b w + 3 a b w 10000 N 4 N 2 T 2 6.6776 N T b w + 0.0006 a T b w + 2.78667052 b 2 w 2 )
p 2   = 1 3 b 2 w ( 20000 N 2 T 16694 N b w + 3 a b w + 10000 N 4 N 2 T 2 6.6776 N T b w + 0.0006 a T b w + 2.78667052 b 2 w 2 )
Note that the co-efficient of p in (A1) is positive since the parameter values N ,   T ,   a ,   b ,   w >   0, the smaller solution p 1 can be the candidate for the optimal price.
By solving Z ( p )   =   0 , we can get three solutions:
a b ,   1 b 2 w ( 10000 N 2 T 8347 N b w + a b w 10000 N N 2 T 2 1.6694 N T b w + 0.0002 a T b w + 0.69664881 b 2 w 2 ) ,
1 b 2 w ( 10000 N 2 T 8347 N b w + a b w + 10000 N N 2 T 2 1.6694 N T b w + 0.0002 a T b w + 0.69664881 b 2 w 2 )
Since all the parameter values are positive and the price must be a positive value, it is found that:
a b > 1 b 2 w ( 10000 N 2 T 8347 N b w + a b w 10000 N N 2 T 2 1.6694 N T b w + 0.0002 a T b w + 0.69664881 b 2 w 2 ) .
This proves that p 1 is the optimal price.

References

  1. Bae, M. Recent Trend in Korean Parcel Delivery Service Market. Available online: http://nlic.go.kr/nlic/knowInTotalDt.action?fldQuestionSeq=383&command=VIEW (accessed on 24 May 2016).
  2. Dolan, S. The Challenges of Last Mile Logistics & Delivery Technology Solutions. Available online: https://www.businessinsider.com/last-mile-delivery-shipping-explained (accessed on 10 May 2018).
  3. Boyer, K.K.; Prud’homme, A.M.; Chung, W. The last mile challenge: evaluating the effects of customer density and delivery window patterns. J. Bus. Logist. 2009, 30, 185–200. [Google Scholar] [CrossRef]
  4. Gevaers, R.; Voorde, E.; Vanelslander, T. Cost modelling and simulation of last-mile characteristics in an innovative B2C supply chain environment with implications on urban areas and cities. Procedia Soc. Behav. Sci. 2014, 125, 398–411. [Google Scholar] [CrossRef]
  5. Kim, S.; Lim, H.; Park, M. Analyzing the cost efficiency of parcel distribution networks with changes in demand. Int. J. Urban Sci. 2014, 18, 416–429. [Google Scholar] [CrossRef]
  6. Alibeyg, A.; Contreas, I.; Fernandez, E. Hub network design problems with profits. Transport. Res E-Log. 2016, 96, 49–59. [Google Scholar] [CrossRef]
  7. Zhou, L.; Wang, X.; Ni, L.; Lin, Y. Location-routing problem with simultaneous home delivery and customer’s pickup for city distribution of online shopping purchases. Sustainability 2016, 8, 828. [Google Scholar] [CrossRef]
  8. Hu, C.; Lu, J.; Lui, X.; Zhang, G. Robust vehicle routing problem with hard time windows under demand and travel time uncertainty. Comput. Oper. Res. 2018, 94, 139–153. [Google Scholar] [CrossRef]
  9. Xuefeng, W.; Fang, Y.; Dawei, L. Multi-objective location-routing problem with simultaneous pickup and delivery for urban distribution. J. Intell. Fuzzy Syst. 2018, 35, 1–14. [Google Scholar]
  10. Zhou, L.; Lin, Y.; Wang, X.; Zhou, FL. Model and algorithm for bilevel multisized terminal location-routing problem for the last mile delivery. Int. Trans. Oper. Res. 2019, 26, 131–156. [Google Scholar] [CrossRef]
  11. Felisberto, C.; Finger et, M.; Friedli, B.; Krahenbuhl, D.; Trinkner, U. Progress toward Liberalization of the Postal and Delivery Sector, 1st ed.; Springer Science + Business Media, Inc.: New York, NY, USA, 2006; pp. 249–264. [Google Scholar]
  12. Cebecauer, M.; Rosina, K.; Buzna, L. Effects of demand estimates on the evaluation and optimality of service centre locations. Int. J. Geogr. Inf. Sci. 2015, 30, 765–784. [Google Scholar] [CrossRef]
  13. Mills, E.S. Uncertainty and price theory. Q. J. Econ. 1959, 73, 117–130. [Google Scholar] [CrossRef]
  14. Polatoglu, L.H. Optimal order quantity and pricing decisions in single period inventory systems. Int. J. Prod. Econ. 1991, 23, 175–185. [Google Scholar] [CrossRef]
  15. Abad, P.H. Optimal pricing and lot-sizing under conditions of perishability and partial backordering. Manag. Sci. 1996, 42, 1093–1104. [Google Scholar] [CrossRef]
  16. Hong, K.S.; Lee, C. Optimal pricing and guaranteed lead time with lateness penalties. Int. J. Ind. Eng. 2013, 20, 153–162. [Google Scholar]
  17. Hong, K.S.; Lee, C. Optimal time-based consolidation policy with price sensitive demand. Int. J. Prod. Econ. 2013, 143, 275–284. [Google Scholar] [CrossRef]
  18. Ahmadi-Javid, A.; Amiri, E.; Meskar, M. A profit-maximization location-routing-pricing problem: A branch-and-price algorithm. Eur. J. Oper. Res. 2018, 271, 866–881. [Google Scholar] [CrossRef]
  19. Cruijssen, F.; Braysy, O.; Dullaert, W.; Salomon, M. Joint route planning under varying market conditions. Int. J. Phys. Distrib. Logist. Manag. 2007, 37, 287–304. [Google Scholar] [CrossRef] [Green Version]
  20. Lozano, S.; Moreno, P.; Adenso-Diaz, B.; Algaba, E. Cooperative game theory approach to allocating benefits of horizontal cooperation. Eur. J. Oper. Res. 2013, 229, 444–452. [Google Scholar] [CrossRef]
  21. Kimms, A.; Kozeletskyi, I. Core-based cost allocation in the cooperative traveling salesman problem. Eur. J. Oper. Res. 2016, 248, 910–916. [Google Scholar] [CrossRef]
  22. Wang, Y.; Zhang, J.; Assogba, K.; Lui, Y.; Xu, M.; Wang, Y. Collaboration and transportation resource sharing in multiple centers vehicle routing optimization with delivery and pickup. Knowl.-Based. Syst. 2018, 160, 296–310. [Google Scholar] [CrossRef]
  23. Chung, K.H.; Rho, J.J.; Ko, C.S. Strategic alliance model with regional monopoly of service centers in express courier services. Int. J. Serv. Ind. Manag. 2009, 5, 774–786. [Google Scholar]
  24. Ferdinand, F.N.; Chung, K.H.; Ko, H.J.; Ko, C.S. A compromised decision making model for implementing a strategic alliance in express courier services. INF. Int. Interdisciplin. J. 2013, 15, 6173–6188. [Google Scholar]
  25. Ko, C.S.; Min, H.; Ko, H.J. Determination of cutoff time for express courier services: A Genetic algorithm approach. Int. Trans. Oper. Res. 2007, 14, 159–177. [Google Scholar] [CrossRef]
Figure 1. Trend for express service market in Korea [1].
Figure 1. Trend for express service market in Korea [1].
Sustainability 10 04560 g001
Figure 2. An example of express delivery service flow.
Figure 2. An example of express delivery service flow.
Sustainability 10 04560 g002
Figure 3. Last mile delivery time pattern in service region during a shift.
Figure 3. Last mile delivery time pattern in service region during a shift.
Sustainability 10 04560 g003
Figure 4. An example of last mile delivery time function of market density.
Figure 4. An example of last mile delivery time function of market density.
Sustainability 10 04560 g004
Figure 5. Variation of the optimal price with w for different values of T (N = 800).
Figure 5. Variation of the optimal price with w for different values of T (N = 800).
Sustainability 10 04560 g005
Figure 6. Variation of the profit with w for different values of T (N = 800).
Figure 6. Variation of the profit with w for different values of T (N = 800).
Sustainability 10 04560 g006
Figure 7. Variation of the optimal price with N for different values of T (w = 150).
Figure 7. Variation of the optimal price with N for different values of T (w = 150).
Sustainability 10 04560 g007
Figure 8. Variation of the profit with N for different values of T (w = 150).
Figure 8. Variation of the profit with N for different values of T (w = 150).
Sustainability 10 04560 g008
Table 1. Average last mile delivery time from the genetic algorithm (GA) results.
Table 1. Average last mile delivery time from the genetic algorithm (GA) results.
Market Density0.10.20.30.50.7
Delivery time per box0.31290.21370.15830.08590.0331
Table 2. The optimal price and the profit with w for different values of T (N = 800).
Table 2. The optimal price and the profit with w for different values of T (N = 800).
wOptimal PriceProfit
T = 9T = 10T = 11T = 9T = 10T = 11
1506.25555.704655.328541.42588713.7284929.78912
1556.4668265.8581835.447527−0.447779.09554723.92256
1606.6947246.0213435.572731-5.23641218.55562
1656.9412226.1950665.70465-2.22622413.72849
1707.2086956.380415.843841-0.1501789.485806
1757.4999376.5785845.990921-−0.894745.877254
1807.8182666.7909676.146581--2.958326
1858.1676457.0191436.311595--0.791176
1908.5528517.2649436.486831--−0.55434
1958.9796917.5304916.67327--−0.99942
Table 3. The optimal price and the profit with N for different values of T (w = 150).
Table 3. The optimal price and the profit with N for different values of T (w = 150).
NOptimal PriceProfit
T = 9T = 10T = 11T = 9T = 10T = 11
8006.25555.704655.328541.42588713.7284929.78912
8506.2802895.7522575.3846971.27963112.9996328.49699
9006.2999425.7907855.4307991.16367812.4097627.4362
9506.3159055.8226065.4693261.06949411.9225826.54974
10006.3291295.849335.5020020.99147511.5134325.79788
10506.3402625.8720925.5300670.92578811.1649525.15214
11006.3497655.8917115.5544320.86972310.8645724.59153
11506.357975.9087975.5757830.8213110.6029924.10025
12006.3651275.923815.5946470.77908310.3731323.6662
Table 4. Data for companies A, B, and C.
Table 4. Data for companies A, B, and C.
Service RegionLast Mile Delivery Demand Amount
ABC
14590135
24386128
34283125
44182123
54079119
63775112
73672108
83570105
93467101
10336699
Table 5. Last mile delivery time according to regional attribute.
Table 5. Last mile delivery time according to regional attribute.
Service RegionTime ShapeMarket Density
0.050.10.150.250.3
114.44.844.303.792.882.48
217.35.815.164.553.462.98
319.26.465.735.063.853.31
420.26.786.025.314.043.48
522.17.436.595.814.423.81
625.98.727.746.835.194.47
728.89.698.607.585.774.97
830.710.339.178.096.155.30
933.611.3010.038.856.735.80
1035.511.9510.619.357.116.13
Table 6. Unit delivery cost according to regional attribute.
Table 6. Unit delivery cost according to regional attribute.
Service RegionUnit Delivery CostUnit Delivery Cost after Collaboration
ABCC2 (25%)C1 (30%)
11.431.311.211.020.93
21.631.491.361.141.04
31.761.611.471.221.11
41.831.671.521.261.14
51.961.791.631.341.21
62.232.031.841.501.35
72.432.212.001.621.45
82.572.332.101.701.52
92.772.512.261.821.62
102.912.632.371.901.69
Table 7. Optimal solution for max–min criterion (A = 5%, B = 10%, C = 15%).
Table 7. Optimal solution for max–min criterion (A = 5%, B = 10%, C = 15%).
Region12345678910
x A j 0000000011
x B j 0101100000
x C j 1010011100
Table 8. Data for company A, B, and C (A = 5%, B = 5%, C = 20%) and unit delivery cost according to regional attribute.
Table 8. Data for company A, B, and C (A = 5%, B = 5%, C = 20%) and unit delivery cost according to regional attribute.
Regiond1d2d3D (=d1 + d2 + d3)cc1cc2cc3C2C1
5%5%20%5%5%20%25%30%
145451802701.431.431.111.020.93
243431712571.631.631.251.141.04
342421662491.761.761.341.221.11
441411632451.831.831.381.261.14
540401592381.961.961.481.341.21
637371502252.232.231.661.501.35
736361442162.432.431.801.621.45
835351402102.572.571.891.701.52
934341352022.772.772.031.821.62
1033331321972.912.912.121.901.69
Table 9. Optimal solution for max–min criterion (A = 9%, B = 10%, C = 11%).
Table 9. Optimal solution for max–min criterion (A = 9%, B = 10%, C = 11%).
Region12345678910
x A j 0000000110
x B j 0000001001
x C j 1111110000
Table 10. Data for companies A, B, and C (A = 9%, B = 10%, C = 11%) and unit delivery cost according to regional attribute.
Table 10. Data for companies A, B, and C (A = 9%, B = 10%, C = 11%) and unit delivery cost according to regional attribute.
Regiond1d2d3D (=d1 + d2 + d3)cc1cc2cc3C2C1
9%10%11%9%10%11%25%30%
18190992701.331.311.291.020.93
27786942571.521.491.471.141.04
37583912491.641.611.581.221.11
47482902451.701.671.641.261.14
57179872381.821.791.761.341.21
66775822252.072.031.991.501.35
76572792162.252.212.161.621.45
86370772102.372.332.281.701.52
96167742022.562.512.461.821.62
105966721972.682.632.571.901.69
Table 11. Optimal solution for max–min criterion (A = 9%, B = 10%, C = 11%).
Table 11. Optimal solution for max–min criterion (A = 9%, B = 10%, C = 11%).
Region12345678910
x A j 1010011100
x B j 0101100000
x C j 0000000110
Table 12. Data for companies A, B, and C (A = 5%, B = 12%, C = 13%) and unit delivery cost according to regional attribute.
Table 12. Data for companies A, B, and C (A = 5%, B = 12%, C = 13%) and unit delivery cost according to regional attribute.
Regiond1d2d3D (=d1 + d2 + d3)cc1cc2cc3C2C1
5%12%13%5%12%13%25%30%
1451081172701.431.271.251.020.93
2431031112571.631.441.411.141.04
3421001082491.761.551.531.221.11
441981062451.831.611.581.261.14
540951032381.961.721.691.341.21
63790972252.231.951.911.501.35
73686932162.432.122.081.621.45
83584912102.572.242.191.701.52
93481882022.772.412.361.821.62
103379851972.912.522.471.901.69
Table 13. Optimal solution for max–min criterion (A = 5%, B = 12%, C = 13%).
Table 13. Optimal solution for max–min criterion (A = 5%, B = 12%, C = 13%).
Region12345678910
x A j 0011100000
x B j 1100011000
x C j 0011100000

Share and Cite

MDPI and ACS Style

Ko, S.Y.; Cho, S.W.; Lee, C. Pricing and Collaboration in Last Mile Delivery Services. Sustainability 2018, 10, 4560. https://0-doi-org.brum.beds.ac.uk/10.3390/su10124560

AMA Style

Ko SY, Cho SW, Lee C. Pricing and Collaboration in Last Mile Delivery Services. Sustainability. 2018; 10(12):4560. https://0-doi-org.brum.beds.ac.uk/10.3390/su10124560

Chicago/Turabian Style

Ko, Seung Yoon, Sung Won Cho, and Chulung Lee. 2018. "Pricing and Collaboration in Last Mile Delivery Services" Sustainability 10, no. 12: 4560. https://0-doi-org.brum.beds.ac.uk/10.3390/su10124560

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop