Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2020 / Article

Research Article | Open Access

Volume 2020 |Article ID 5263689 | https://doi.org/10.1155/2020/5263689

Gege Yang, Yin Huang, Ying Fu, Biao Huang, Sishi Sheng, Lisha Mao, Shumin Huang, Yan Xu, Jia Le, Yun Ouyang, Qian Yin, "Parcel Locker Location Based on a Bilevel Programming Model", Mathematical Problems in Engineering, vol. 2020, Article ID 5263689, 12 pages, 2020. https://doi.org/10.1155/2020/5263689

Parcel Locker Location Based on a Bilevel Programming Model

Academic Editor: Neale R. Smith
Received25 Feb 2020
Accepted16 Jul 2020
Published19 Aug 2020

Abstract

In order to improve delivery network efficiency and to solve consumer satisfaction problems, parcel locker location optimisation scheme is proposed based on the delivery demand under the e-commerce environment. In this paper, a bilevel programming (BLP) model is established to identify the optimal location for parcel lockers by considering benefits of consumers and logistics planning departments. The upper-level model is to determine the optimal location by minimising the planners’ cost, and the lower one gives an equilibrium demand distribution by minimising the consumers’ pick-up cost. On the special form of constraints, a bilevel genetic algorithm is proposed based on GIS data and a genetic algorithm. Finally, a numerical example is employed to demonstrate the application of the method, which indicates that the model can solve the problem of parcel locker location.

1. Introduction

In recent years, the e-commerce market has developed by leaps and bounds, with products ranging from high-value durable goods to low-value consumer goods. In 2019, retail e-commerce sales worldwide amounted to 3.53 trillion US dollars and e-retail revenues are projected to grow to 6.54 trillion US dollars in 2022 [1]. The continuous growth of this market leads to a dramatic upsurge in direct-to-consumer deliveries. We should pay more attention to the problems of the last mile delivery in the supply chain. As an emerging express delivery mode, the parcel locker has become an effective way of solving the “last mile” issue in the express delivery industry [2]; however, there are many problems arising in the layout planning of parcel storage facilities, so it is necessary to explore and optimise the layout of parcel lockers.

Many scholars have studied self-service parcel lockers. Punakivi et al. [3] proposed two main modes of unattended reception box and delivery boxes and found that an unattended reception box allowed greater cost savings. Shi et al. [4] proposed the use of automatic logistic terminal equipment in a campus express delivery system and verified the implementation feasibility of automatic logistics terminal equipment through qualitative and quantitative analyses. The present research mostly focused on the development status of smart express locker mode, promotion of the mode, and development of countermeasures to problems, while little research focused on parcel locker location. Li and Lu [5] established a model that works out the quantity and optimal layout of the intelligent self-service locker on a campus based on clustering analysis, in which 0-1 integer programming model and other methods were considered. Liu [6] pointed out that the self-service terminal belongs to a special distribution node, and the location of the self-service terminal is essentially a discrete multidistribution node location problem. The parcel locker can be regarded as a type of special self-service terminal. Therefore, the parcel locker location (in the present work) is also equivalent to a discrete facility location problem.

Discrete facility location problems (FLPs) constitute a major area of interest for researchers and practitioners in operations research (OR). Aikens [7] has given some basic location models, which included the simple facility location model, the capacitated facility location model, the dynamic and stochastic capacitated facility location models, and so on. All the objective functions of these models were to minimise transportation costs and fixed investment costs. Holmberg [8] constructed the exact solution method for the simple facility location problem in which the transportation costs are nonlinear. Barahona and Jensen [9] proposed an integer programming model for the plant location, which considered not only the fixed costs and transportation costs but also the inventory costs, which had been solved by the Dantzig–Wolfe (D-W) decomposition method. Owen and Daskin [10] considered the dynamic nature of facility location problem and the stochastic nature of consumer demand and developed simple dynamic and stochastic location models. Zhou et al. [11] explored the balanced allocation of consumers to multiple distribution centres using a genetic algorithm approach. Although Miller et al. [12] studied the location problem with equilibrium-constrained models and algorithms, they were only single-level models, which could not consider benefits to both planners and consumers.

In a single-level model, the two variables are required to be solved simultaneously, while in practice, the location and demand distribution decisions are decided by two different decision-makers. Consumer demand, as distributed among parcel lockers, when determined by planners, is unreasonable: in fact, consumers always choose parcel lockers based on their own habits, and this kind of behaviour is very stochastic. In addition, the planner can only estimate the location of parcel lockers based on consumer demand, and at the same time, different location patterns will affect the distribution of consumer demand. The location problems of logistics parcel lockers can be represented as a Leader-Follower or Stackelberg game where the decision managers are the leaders, and the consumers are the followers who choose the parcel lockers freely; however, bilevel programming (BLP) can reflect the interaction among the decision levels in the location of parcel lockers and can solve the contradiction between the goals pursued by enterprises and consumers. It can also clearly reflect the real situation on both the supply and demand sides, making the location model a closer fit to reality. Therefore, it is suitable to represent the location problems with BLP models. Although the facility location problem has been studied widely, little attention has been paid to the location model problem using a BLP model [13].

BLP problems are generally difficult to solve due to the nonconvex nature of the search space resulting from the complex interaction of the leader and follower problem. Various algorithms have been developed based on classical optimisation approaches such as variable elimination method based on Kuhn-Tucker approach [1416] and algorithms based on the penalty function approach [1719]. The literature suggests that most of the traditional solutions are problem-dependent, are relying on knowledge of the search space, and are not sufficiently robust methods to solve real-life problems [20]. Heuristic approaches are now generating interest in the research community as an alternative to solve the BLP problems. Anandalingam et al. [21] developed a Simulated Annealing Based Bilevel programming Algorithm (SABBA), Mathieu et al. [20] developed a Genetic Algorithm Based Bilevel programming Algorithm (GABBA), Gendreau et al. [22] developed a hybrid Tabu Search ascent algorithm, and Yin [23] proposed an approach based on a genetic algorithm. Most of the computational results of the heuristic approaches reported in the literature are still not satisfactory when compared to exact methods such as the Kuhn-Tucker approach or the penalty method and they are also reported to be computationally expensive [24]. In this paper, a bilevel genetic algorithm (BIGA) is proposed for solving BLP problems within a single framework. The motivation is to develop robust solutions for real-life industrial problems.

In the current work, we focus on the usage of parcel lockers (or shared reception boxes) as a solution to the last mile logistics problem. A parcel locker is a group of lockers, sited in apartment blocks, workplaces, railway stations, and so on. As the lockers have electronic locks with variable opening codes, they can be used by different consumers, at their convenience. Our work is the first attempt to develop a quantitative approach based on GIS data to determine their optimal locations, aimed at solving real-life hierarchical facility location problems.

2. Problem Analysis and Modelling

2.1. Problem Description

We focus on the location problem of parcel lockers based on BLP. In the upper level, a company (leader) aims to minimise its total cost which includes the cost of opening new facilities and the operation costs considering the preferences of the consumers (followers) to be served by a specific facility. In the lower level, the consumers optimise their preferences with respect to the facilities from which they will be served [25]. The influence of distance on consumers’ pick-up service satisfaction is taken into account in this study. Preferences of the consumers are defined based on a predefined sorted list as described as follows.

2.2. Hypotheses

(1)The locations of regional distribution centres, parcel lockers, and consumers are known(2)The number of regional distribution centres, the locations of the candidate parcel lockers, and the demand of each customer point are known(3)All regional distribution centres and parcel lockers have maximum processing capacity(4)Each consumer can only go to a fixed parcel locker for self-service(5)Each parcel can only be sent to a fixed parcel locker, which is nearest to customer points

2.3. Mathematical Model
2.3.1. Notation

K = {K |k = 1,2,3, ..., m} is the set of regional distribution centres.I = {I |i = 1,2,3, ..., n} is a candidate set of the parcel locker i.J = {J |j = 1,2,3, ..., o} is the set of consumers j. indicates the number of products delivered from a regional distribution centre to a parcel locker. indicates the number of products collected by consumers from the parcel locker. indicates distance between a regional distribution centre and a parcel locker. indicates distance between a parcel locker and a consumer. indicates the speed of the vehicle. indicates freight from a regional distribution centre to a parcel locker. indicates operation costs per unit parcel locker. indicates construction costs per unit parcel locker. indicates investment budget of parcel locker. indicates maximum processing capacity of the regional distribution centre. indicates maximum processing capacity of a parcel locker. indicates demand of consumer j. indicates penalty costs that companies need to pay. indicates penalty costs function per parcel. indicates an arbitrarily large positive constant. indicates travel cost per unit of consumer

The parameter settings in the model are summarised in Table 1.


ParameterValueUnit

m3
n21
o58
cki0.005Yuan/(PCSm)
ci5Yuan/PCS
Cijper0.01Yuan/(PCSm)
mk10000PCS/year
ni1000PCS/year
fi7500Yuan/(setyear)
B500000Yuan/year
fd10Yuan

Herein, the upper level of the BLP is designed to meet the demands of consumers at various locations with the minimum cost. The lower level represents consumer willingness to use different parcel lockers, and its objective is to minimise the travel cost of each consumer. In addition, we assume that the competition between new and old parcel lockers is not considered.

2.4. Upper-Level Model of the BLP Location Problem

From the perspective of enterprise, the upper-model factors mainly include the construction cost, operation cost, transportation cost, and the penalty cost caused by repetitive delivery due to parcels delayed in parcel lockers. The specific analysis is as follows.

2.4.1. Construction Cost

The construction cost refers to the purchase cost, labour cost, and land lease cost of the parcel lockers. Such costs will change by location, but the selected area in this scheme is not much large, so it is regarded as a fixed value. In addition, the construction cost also includes the depreciation cost and maintenance cost of parcel lockers, which are all fixed costs, meaning that they will not change due to their operational status. The expression is as follows:

2.4.2. Operation Cost

For logistics enterprises, the operating cost of parcel lockers consists of the usage fee and maintenance cost (including parcel lockers repairing and cleaning). It depends mainly on the number of cells used by express-delivery staff. The expression is as follows:

2.4.3. Transportation Cost

Due to the self-service nature of parcel lockers, consumers need to complete the picking process themselves. Therefore, the transportation cost is only incurred from regional distribution centres to parcel lockers. Transportation cost can be determined by parcel quantity, distance, and transportation cost per unit (including labour cost and fuel cost). The expression is as follows:

2.4.4. Penalty Cost

Penalty cost refers to the cost that the express company needs to bear when the maximum capacity of the parcel locker fails to meet consumer demand . fd represents unit penalty cost per parcel. For example, if all the parcel lockers are full, the courier has to wait and deliver the parcels for the second time. The expression is as follows:

is written as

The upper-level programming is as follows:

Constraint (7) ensures that at least one parcel locker is built, and no more than the number of candidates can be established. Constraint (8) ensures that the construction cost of parcel lockers sticks to budget from regional distribution centres. Constraint (9) is the capacity constraint, which can ensure that all the parcels delivered from the regional distribution centre k to parcel locker i will not exceed the capacity of centre k. Constraint (10) is the capacity constraint, which ensures that all parcels delivered from the regional distribution centre k to parcel locker i will not exceed the capacity of parcel locker i. Equation (11) represents the fact that the parcels taken from parcel locker i by consumer j should be equal to the demand of consumer j. Constraint (12) is a capacity constraint, which ensures that all the parcels taken from parcel locker i will not exceed the capacity of parcel locker i. Equation (13) represents the amount of the parcels delivered from the regional distribution centre k to parcel locker i. The amount should be equal to the sum of parcels that consumer j takes from parcel lockers. Constraint (14) prohibits the delivery from a regional distribution centre to any proposed parcel locker that is not actually constructed. Since M is an arbitrarily large positive constant, if zi = 0, then cannot be positive; but if zi = 1, then can be as large as expected. Constraint (15) prohibits the demand on any proposed parcel locker that is not actually constructed. Since M is an arbitrarily large positive constant, if zi = 0, then xij cannot be positive; but if zi = 1, then can be as large as expected.

2.5. Lower-Level Model of the BLP Location Problem

The lower-level problem represents customer choice behaviours and the demand distributed among parcel lockers; that is to say, each customer assigns their demand through the parcel lockers to minimise their total cost.

The model mainly considers consumers’ travel costs. Parameter describes travel cost per unit for consumers to pick up parcels. The expression is as follows:

The lower-level model is given as follows:

The lower-level problem represents customer choice behaviours; that is to say, we suppose that each customer chooses a convenient and nearest parcel locker to minimise their total travel cost.

3. Algorithm Analysis

In general, it is difficult to solve the BLP problem. The reason is that the BLP problem is an NP-hard (nondeterministic polynomial-hard) problem. Ben-Ayed and Blair [26] studied this problem and pointed out that even a very simple bilevel problem is still an NP-hard problem. The nonconvexity is another reason that results in the complexity of the solution algorithm. Even if the upper- and lower-level problems are both convex, the whole bilevel problem is possibly nonconvex, which shows that even if the solution of the bilevel problem can be found, it is usually a local optimum not the global optimum.

Research on algorithms to solve the BLP model can be divided into two main categories: classical optimisation approaches and heuristic approaches [27]. Due to special constraints and low flexibility to BLP in classical approaches, we decide to use heuristic approaches to solve the parcel locker problem. The genetic algorithm aims to create deferent results in order to obtain the optimal solution for the bilevel problem and achieve Stackelberg’s equilibrium.

The step-by-step description of the GA is shown in Figure 1 as follows:Step 1. Initial population: chromosome representation and encoding. Two groups of real number codes are used. The first group of codes is the pairing relationship between parcel lockers and consumers, and the second one is the pairing relationship between regional distribution centres and consumers. We initialise the settings and generate a feasible solution at random.Step 2. Fitness function: in order to reflect the interaction between the upper and lower decision variables accurately and avoid a locally optimal solution, the objective function of the double-level programming model is added as a fitness function.Step3. Elite reservation and comparison: we determine the minimum fitness of each generation and its elite.Step 4. Design selection, crossover and mutation operators: in this study, we use Roulette Wheel Selection: the best individual in each generation is transferred directly to the next generation in the elitism step [28]. The crossover operator is a two-point crossover strategy. The mutation operator adopts the method of two-point mutation and internal replacement of an individual. It randomly selects any two loci of each individual genome and exchanges their genes to get a new individual.Step 5. Replacement of individuals and individuality testing: remove individuals who do not meet the constraints and generate a new generation of feasible solutions.Step 6. Iteration: continue to iterate until the maximum number of iterations is reached.Step 7. Stopping criteria and getting optimal solution: optimal solution. Record the elite individual of each generation and select the smallest fitness value of fitness function as the approximate optimal solution of the model.

4. Case Study

We use a numerical example to illustrate the applications of the proposed model and the solution algorithm.

4.1. Research Region Setting

The typical research region setting is based on the North of Tianxin District in Changsha, Hunan Province, China (Figure 2). The geographic overview map of Tianxin District is drawn using a Geographic Information System (GIS) package, as shown in Figure 2.

Given the small service radius of parcel lockers, the analysis focuses on the northern part of Tianxin District. Demand is simulated on the basis of the number of buildings and the local population. The parcel lockers directly serve customers to meet their personal demand; such customer points are scattered with low aggregation. Buildings are generally taken as aggregation points. The most common service object of express delivery is online shopping customers, whose demand for parcel lockers is huge. According to the relevant survey, online shopping customers mainly belong to the group aged 18–45 years, and there is a trend of aging of the cohort. They are mainly students, white-collar workers, or civil servants, with a college degree or above. We crawl and vectorise the POI (point of interest) data such as urban roads, residential quarters, shopping malls, office buildings, and colleges and universities in Tianxin District from the Gaode Map API (open-source code available from https://lbs.amap.com/, see also Tables 2 and 3). We determine the candidate parcel locker layout based on the regional distribution centre and customer points. The network consists of three regional distribution centres (Table 2) and 58 customer points (Table 3). Candidate parcel lockers are listed in Table 4. All data pertaining to the centres and points are derived from the Gaode Map API.


NumberRegional distribution centreLongitudeLatitude

K1Orange Island Bay112.966328.1686
K2Yuan Jialing112.980228.1892
K3Three Xing Street112.964128.1960


NumberTypeDemand point nameLongitudeLatitudeDemand

J1Residential areaCentury building112.972028.1811100
J2Enrui apartment112.972828.1825140
J3Qingshan Temple community112.967628.1817180
J4Tianxin friend houses112.973628.186380
J5Jiaxing apartment112.971328.184460
J6Yu Minli building112.972628.183270
J7Scenery tower112.968328.178450
J8Red Flag cloth factory dormitory112.968628.178590
J9First Normal dormitory112.966428.180360
J10First Normal South College apartment112.967228.180870
J11Youyixiang government dormitory quarters112.968028.181290
J12Qingshan Temple dormitory112.968128.181475
J13First Normal new student housing112.969328.1800110
J14Xu Mingin police dormitory112.969828.181595
J15Bixianli housing112.968228.185940
J16Jurenli housing112.967428.183530
J17Youth apartment112.969628.183760
J18Hongxin building112.969628.186055
J19Guangyu lane elevator dormitory112.967428.182050
J20Theatre dormitory112.967728.182180
J21Ming Ayutthaya112.977028.186435
J22Light hostels112.971128.180555
J23Xitai apartment112.975028.185370
J24Xitailing community112.975928.185745
J25White Sand Apartments112.974728.184155
J26Wujiaping112.971728.185680
J27Changsha Air Defence Office dormitory112.976828.1861120
J28Tianxin Elegant apartment112.973028.1860115
J29Hunan Arts company dormitory112.975928.1843155
J30Swallow community112.972828.1827180
J31Pastry factory dormitory112.973328.184695
J32Changsha Local Taxation Bureau dormitory112.974028.1828178
J33City South Road Street Office quarters112.976128.1850129
J34Swallow Bureau dormitory112.973328.1830156
J35Tianxin government quarters112.973328.182798
J36Quality Supervision Station dormitory112.972928.182264
J37Tianxin individual quarters association112.975128.183555

J38Residential areaZhu Wei Gang district112.968528.1844186

J39OfficeCinda building112.970828.1849120
J40Tax building112.972928.1816100
J41Royal building112.969328.181780
J42Changsha mobile building112.970428.1829180
J43Wending building112.968828.1828100
J44South building112.970728.181990
J45New world112.970028.1865200
J46Hongxin building-north block B112.969528.1867140
J47Hongxin building-south block B112.969628.186280
J48Hongxin building-south block A112.969428.186270
J49Hibiscus house (south-west)112.973628.1865110
J50Hunan Electrical Appliance Factory Office112.972628.1866130
J51Hunan metallurgy112.967228.1844180

J52Shopping mallHong Xinhuimin Shopping Mall112.969528.1868120

J53HospitalChangsha Chinese Medicine Hospital, South Campus112.967828.1871150
J54Changsha Public Health Hospital112.970528.1845120
J55Changsha Sunshine Hospital112.972728.1867100
J56Changsha Tax Bureau112.973928.1838140

J57SchoolFirst Normal Old Campus112.967128.1789270
J58Youyou school112.972828.184090


NumberCandidate nameLongitudeLatitude

I1Red Flag cloth factory dormitory entrance112.969028.1785
I2Changsha City Flower Drum Theatre112.967228.1820
I3Hunan Changsha Theatre112.968028.1819
I4Yu Minli Golden Globe apartment112.973028.1832
I5Enrui apartment112.973328.1829
I6Hibiscus building112.973328.1829
I7Jiaxing apartment112.973328.1864
I8Changsha Air Defence Office dormitory112.971128.1843
I9Hunan Arts Company dormitory112.976728.1862
I10Zhu Wei Gang west entrance112.976028.1842
I11Hongxin building entrance112.968328.1844
I12Youyou school southwest gate112.969728.1865
I13Hunan metallurgical entrance112.972028.1834
I14Changsha First Normal dormitory112.970528.1826
I15Pastry shop112.968828.1828
I16Changsha Chinese Medicine South Hospital112.972928.1816
I17Hunan silk factory dormitory112.969328.1817
I18Tianxin District Youyou Kindergarten112.972628.1866
I19Wen Ding building112.967828.1871
I20Nashinuo National Wine Cellar112.967028.1843
I21Century building south-east door112.966528.1804

Table 3 can also be presented as a hot map (Figure 3): the kernel density in Figure 3 denotes customer demand per square kilometre and increases progressively from cold colours to warm colours.

The candidate location geographic location in Tianxin District is illustrated in Figure 4.

The parcel locker location model is constructed by considering a variety of factors that affect delivery and converting some factors into delivery costs. The target is to control the minimum total cost while meeting delivery service requirements and limits. The genetic algorithm (GA) and MATLAB™ are employed to solve this problem.

4.2. Computational Experiments and Discussion

The genetic algorithm is generally used to obtain the approximate optimal solution, with its convergence related to the initial value. We ran the algorithm many times with a 2.50 GHz Intel Core CPU and 4.00 GB RAM, to acquire the approximate optimal solution by taking different crossover probabilities and mutation probabilities. Table 5 lists the results after running the program 40 times. Eventually, the optimal solution is obtained under crossover probability of 0.9 and mutation probability of 0.005. Table 6 lists the selected locations.


Test numberCrossover probabilityMutation probabilityFinal result (×105)Test numberCrossover probabilityMutation probabilityFinal result (×105)

10.60.012.2388210.80.012.2017
20.60.012.0975220.80.012.1913
30.60.012.2019230.80.012.2795
40.60.012.2169240.80.012.0156
50.60.012.2802250.80.012.1651
60.60.0052.1950260.80.0052.4456
70.60.0052.2639270.80.0052.3619
80.60.0052.3446280.80.0052.3689
90.60.0052.4099290.80.0052.3117
100.60.0052.1588300.80.0052.2822
110.70.012.2695310.90.012.2732
120.70.012.0665320.90.012.2136
130.70.012.3236330.90.012.2320
140.70.012.2103340.90.012.1765
150.70.012.1290350.90.012.3283
160.70.0052.1932360.90.0051.8758
170.70.0052.2673370.90.0051.7875
180.70.0052.3688380.90.0051.8380
190.70.0052.3170390.90.0051.8661
200.70.0052.2907400.90.0051.7826


NumberPreparation of the site nameLongitudeLatitude

I3Hunan Changsha Theatre112.968028.1819
I4Yu Minli Golden Globe apartment112.973028.1832
I5Enrui apartment112.973328.1829
I7Jiaxing apartment112.973328.1864
I8Changsha Air Defence Office dormitory112.971128.1843
I12Youyou school southwest gate112.969728.1865
I14Changsha First Normal dormitory112.970528.1826
I15Pastry shop112.968828.1828
I16Changsha Chinese Medicine South Hospital112.972928.1816
I17Hunan silk factory dormitory112.969328.1817
I18Tianxin District Youyou Kindergarten112.972628.1866
I20Nashinuo National Wine Cellar112.967028.1843

Newly added parcel lockers are mainly found to be located near the dormitory of Hunan silk factory, Enrui apartment, and Youyou Kindergarten in Tianxin District. The locations correspond to those of people who often shop online.

Figures 5 and 6 illustrate the connection among three parties: customer, parcel locker, and regional distribution centre. Figure 5 shows the upper-level assignment relationship, involving regional distribution centres and parcel lockers, while Figure 6 shows the lower-level assignment relationship, involving parcel lockers and customer points.

In addition, Figure 5 demonstrates that multiple distribution centres share a parcel locker. According to the actual situation, the research area is located at the junction of three distribution centres (see Figure 5). Figure 6 shows that the customer and the parcel locker conform to a one-to-one relationship, which conforms to the principle that customers are accustomed to collecting parcels from the nearest parcel locker. The result also validates the correctness of the logic of the location of parcel lockers in the algorithm.

5. Conclusion

In this paper, the location problem of parcel lockers is considered as a solution to the last mile logistics problem based on GIS data and BLP model: choosing the optimal location of parcel lockers facilities to maximise express company profits and minimise the travel cost to customers. On the one hand, it helps us to estimate and calculate customer demand more accurately by distinguishing and dividing different types of point of interest (POI) on the demand side into residential area, office, shopping mall, hospital, and school based on GIS data. On the other hand, the BLP model also balances the contradictory situations on both the supply and demand sides as much as possible. With the help of genetic algorithm and MATLAB™, we finally get an optimal solution in 40 times‘ experiments and find the upper-level assignment relationship between centres and selected lockers, and the lower-level assignment relationship between selected lockers and customers.

The current work has some limitations: the first is the scale of the location problem. We considered three regional distribution centres, 58 customer points, and 21 candidate parcel lockers in total and finally computed 12 selected parcel locker positions. If the spatial scale of the problem was to be increased, the computational burden and run-time become onerous and the assignment relationship in the upper and lower levels will become more complicated. Current run-times are approximately 480 to 520 s per test on average. The exact run-time depends on the spatial scale of the location problem and the computer configuration. The limitation of BLP is such that we need to ensure that the upper level and the lower level obey a Leader-Follower hierarchical relationship, and then we have to equilibrate them so as to achieve a win-win result. The second lies in the static nature of the data used as the dynamic aspects of the problem are ignored, for example, the seasonality of ordering rates, the variability of customer willingness to use the service, and the variability of operational setup prices. The third is that we do not try to determine the optimal mix of different-size lockers. We implicitly assume that all parcel lockers have a fixed and given size.

This opens the door to further research. On the one hand, to deal with the dynamic aspects of the problem, we can cooperate with e-commerce platforms to get more user-demand data. Another possible solution is to couple our optimisation model with a simulation model and to optimise the location problem of parcel lockers within a certain area over a certain time period in a dynamic manner.

Abbreviations

FLP:Facility location problem
OR:Operation research
BLP:Bilevel programming
SABBA:Simulated Annealing Based Bilevel programming Algorithm
GABBA:Genetic Algorithm Based Bilevel Algorithm
BIGA:Bilevel genetic algorithm
GA:Genetic algorithm.

Data Availability

All relevant data are within the paper.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant no. 71804200); Natural Science Foundation of Hunan Province of China (Grant no. 2019JJ50991); Philosophy and Social Science Foundation of Hunan Province (Grant no. 17YBA430); Hunan Key Laboratory of Intelligent Logistics Technology (Grant no. 2019TP1015); Youth Science Foundation Project of Central South University of Forestry and Technology (Grant no. 2017QY001); Foundation of Young Backbone Teachers Training Object of Common Universities in Hunan Province in 2018; and College Student Technological Creativity Fund of Central South University of Forestry and Technology in 2020. The authors appreciate the tireless work of the data collection team.

References

  1. Statista. Global Retail E-Commerce Market Size 2014—2023.2020 https://www.statista.com/statistics/379046/worldwide-retail-e-commerce-sales/.
  2. J. Q. Wang and E. Zou, “Analysis of Application of Smart Express Parcel Cabinets in Online Shopping Endpoint Logistics,” Logistics Technology, vol. 34, no. 5, pp. 58–60, 2015. View at: Google Scholar
  3. M. Punakivi, H. Yrjölä, and J. Holmström, “Solving the last mile issue: reception box or delivery box?” International Journal of Physical Distribution & Logistics Management, vol. 31, no. 6, pp. 427–439, 2001. View at: Publisher Site | Google Scholar
  4. S. Shi, Y. F. Huang, and W. Yan, “Research on automatic Logistic terminal equipment application in campus express,” Computer Simulation, vol. 32, no. 9, pp. 421–424, 2015. View at: Google Scholar
  5. J. Li and S. Lu, “Research and application of site selection and planning of intelligent self-service Locker on campus,” Logistics Engineering and Management, vol. 40, no. 01, pp. 74–77, 2018. View at: Google Scholar
  6. X. T. Liu, Research on the Layout of Pick-Up Points of A Company in Beijing, Beijing Jiaotong University, Beijing, China, 2015.
  7. C. H. Aikens, “Facility location models for distribution planning,” European Journal of Operational Research, vol. 22, no. 3, pp. 263–279, 1985. View at: Publisher Site | Google Scholar
  8. K. Holmberg, “Exact solution methods for uncapacitated location problems with convex transportation costs,” European Journal of Operational Research, vol. 114, no. 1, pp. 127–140, 1999. View at: Publisher Site | Google Scholar
  9. F. Barahona and D. Jensen, “Plant location with minimum inventory,” Mathematical Programming, vol. 83, pp. 101–111, 1998. View at: Publisher Site | Google Scholar
  10. S. H. Owen and M. S. Daskin, “Strategic facility location: a review,” European Journal of Operational Research, vol. 111, no. 3, pp. 423–447, 1998. View at: Publisher Site | Google Scholar
  11. G. Zhou, H. Min, and M. Gen, “The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach,” Computers & Industrial Engineering, vol. 43, no. 1-2, pp. 251–261, 2002. View at: Publisher Site | Google Scholar
  12. T. C. Miller, T. L. Friesz, and R. L. Tobin, “Equilibrium Facility Location on Networks,”, Springer, Berlin Germany, 1996.
  13. H. Sun, Z. Gao, and J. Wu, “A bi-level programming model and solution algorithm for the location of logistics distribution centers,” Applied Mathematical Modelling, vol. 32, no. 4, pp. 610–616, 2008. View at: Publisher Site | Google Scholar
  14. P. Hansen, B. Jaumard, and G. Savard, “New branch-and-bound rules for Linear bilevel programming,” SIAM Journal on Scientific and Statistical Computing, vol. 13, no. 5, pp. 1194–1217, 1992. View at: Publisher Site | Google Scholar
  15. J. J. Judice and A. M. Faustino, “A sequential LCP method for bilevel Linear programming,” Annals of Operations Research, vol. 34, no. 1-4, pp. 89–10, 1992. View at: Publisher Site | Google Scholar
  16. J. F. Bard and J. T. Moore, “A branch and bound algorithm for the bilevel programming problem,” SIAM Journal on Scientific and Statistical Computing, vol. 11, no. 2, pp. 281–292, 1990. View at: Publisher Site | Google Scholar
  17. W. Zhao, “Penalty function method for bi-level multiobjective programming,” Acta Automatica Sinica, vol. 24, no. 3, pp. 331–337, 1998. View at: Google Scholar
  18. K. Shimizu and M. Lu, “A global optimization method for the stackelberg problem with convex functions via problem transformation and concave programming,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 25, no. 12, pp. 1635–1640, 1995. View at: Publisher Site | Google Scholar
  19. D. J. White and G. Anandalingam, “A penalty function approach for solving bi-level linear programs,” Journal of Global Optimization, vol. 3, no. 4, pp. 397–419, 1993. View at: Publisher Site | Google Scholar
  20. R. Mathieu, L. Pittard, and G. Anandalingam, “Genetic algorithm based approach to Bi-level Linear programming,” RAIRO - Operations Research, vol. 28, no. 1, pp. 1–21, 1994. View at: Publisher Site | Google Scholar
  21. G. Anandalingam, “Artificial Intelligence Based Approaches for Hierarchical Optimization: in Impact of Recent Computer Advances in Operations Research,”, North-Holland, New York, NY, USA, 1989.
  22. M. Gendreau, P. Marcotte, and G. Savard, “A hybrid tabu-ascent algorithm for the Linear bilevel programming problem,” Journal of Global Optimization, vol. 8, no. 3, pp. 217–233, 1996. View at: Publisher Site | Google Scholar
  23. Y. Yin, “Genetic-algorithms-based approach for bilevel programming models,” Journal of Transportation Engineering, vol. 126, no. 2, pp. 115–120, 2000. View at: Publisher Site | Google Scholar
  24. J. Bard, “Practical Bilevel Optimization Algorithm and Applications: Nonconvex Optmization and its Applications,”, Kluwer Academics, Dordrecht,Netherlands, 1998.
  25. S. X. Chen and H. J. Lan, “Location of fresh product self-collection cabinet based on Bi-level programming,” Industrial Engineering and Management, vol. 23, no. 6, pp. 57–63, 2018. View at: Google Scholar
  26. O. Ben-Ayed, D. E. Boyce, and C. E. Blair, “A general bilevel linear programming formulation of the network design problem,” Transportation Research Part B: Methodological, vol. 22, no. 4, pp. 311–318, 1988. View at: Publisher Site | Google Scholar
  27. V. Oduguwa and R. Roy, “Bi-level optimisation using genetic algorithm,” in Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS’02), Divnomorskoe, Russia, December 2002. View at: Publisher Site | Google Scholar
  28. G. M. Xia and J. C. Zeng, “A stochastic particle swarm optimization algorithm based on the genetic algorithm of roulette wheel selection,” Computer Engineering and Science, vol. 29, no. 6, pp. 6–11, 2007. View at: Google Scholar

Copyright © 2020 Gege Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views393
Downloads231
Citations

Related articles

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.