Collaborative logistics pickup and delivery problem with eco-packages based on time–space network
Introduction
The development of convenient online shopping and the resulting low cost of products have caused the rapid growth of online consumption, thereby generating a sharp increase in pickup demand (PD) and delivery demands (DD) that must be met by logistics facilities (Wang et al., 2018, Peng et al., 2019). In a traditional pickup and delivery network, conventional paper packages made from wood pulp are used as transport carriers to deliver products from suppliers to customers. However, most traditional packages are discarded directly without being recycled, thereby causing a substantial waste of resources. At present, green sustainability concepts and sharing modes are highly regarded. Thus, eco-packages have become the new preference of logistics companies to comply with the requirements of green sustainability and to reduce packaging costs.
In comparison with conventional packages, eco-packages are a type of commodity transport carrier that can be recycled many times. Although the cost of manufacturing a single eco-package is relatively high, multiple recycling greatly reduces the packaging cost and environmental damage because less raw material from wood is cut and manufactured. Statistics from the State Post Bureau of China (SPBC, 2018) indicates that the 2018 “Double 11” Shopping Festival generated a demand for more than one billion packages, resulting in the wastage of over 50,000 tons of raw paper because of using traditional paper packages. By contrast, ShunFeng Express uses recyclable eco-packages, called Feng Boxes. A total of 10 million Feng Boxes can replace approximately 500 million traditional packages, 1.4 billion m of tape, and 2.25 million cu. m. of filling. Moreover, this material effectively solves the problems of high cost, damage, low operation efficiency, and resource waste caused by the non-recyclable nature of traditional packages because each eco-package is relatively well made and can be used more than 100 times (Cruz et al., 2012).
However, an important challenge in fully promoting eco-packages is the efficiency of pickups and deliveries (Hao et al., 2019). The conventional multi-depot vehicle routing with pickups and deliveries (MDVRPPD) for operational cost optimization (Baldacci et al., 2011) is inapplicable to the situation with eco-packages, due to the requirement for collaboration and the time window and TS network constraints in optimizing eco-package pickups and deliveries (Wang, Peng et al., 2018). Moreover, the relatively independent operation mode among logistics facilities causes the eco-packages to undergo a long recycling process because the package can only be recovered by the initial delivery company (Yu et al., 2017). Therefore, optimizing the pickup and delivery network of eco-packages collaboratively is crucial. Collaboration among logistics facilities not only greatly reduces the overall operational costs of the logistics network (Dai and Chen, 2012, Fernández et al., 2018), but also improves the synchronization for the pickups and deliveries of eco-packages effectively; for example, the waiting time is reduced when vehicles collect eco-packages at facilities or deliver eco-packages to customers (Wang, Peng et al., 2018). However, establishing a collaboration mechanism (i.e., how to motivate logistics companies to collaborate) is costly, and compensation from the government and a fair profit allocation are important factors in building an acceptable collaborative alliance (Wang et al., 2017, Wang et al., 2018). To clarify the specific research of this paper, Fig. 1 shows the optimization mode of the collaborative logistics pickup and delivery problem with eco-packages (CLPDPE).
In Fig. 1, the implementation of the eco-packages’ pickups and deliveries is presented by the shared trucks and facilities in a two-echelon collaborative logistics network. For the feasibility and convenience, eco-packages are classified as large eco-packages (L-EPs) and small eco-packages (S-EPs) for pickups and deliveries between first and second echelons. L-EPs/S-EPs are transformed at the delivery satellite or pickup satellite. For example, a L-EP can be split into several S-EPs at the delivery satellite and several S-EPs can be merged into a L-EP at the pickup satellite. At the first echelon, a shared truck carries four L-EPs consisting of multiple S-EPs and departs from the logistics delivery center (LDC) with the state of [1, 1, 1, 1]. The truck then unloads the L-EPs at the delivery satellites with the state of [0, 0, 0, 0] and drives to the pickup satellites in the collaborative alliance to collect large eco-packages. When the shared truck is fully loaded with the state of [1, 1, 1, 1], it returns to the logistics pickup center (LPC) to complete the pickup of L-EPs. At the second echelon, the L-EPs that are delivered to the delivery satellite by the shared truck are split into multiple S-EPs, which are then delivered to customers via a shared vehicle. Similarly, the L-EPs collected by the shared truck at the pickup satellite come from the merger of the S-EPs collected by the shared vehicles from the customers.
Therefore, our research focuses on achieving efficient pickups and deliveries of eco-packages while minimizing cost in the collaborative two-echelon logistics networks. Existing studies have contributed substantially toward the optimization of a multi-echelon logistics network, but exhibited four deficiencies or aspects that need further exploration. First, the optimization of multi-echelon multi-center pickup and delivery problem (MEMCPDP) has been widely investigated. However, the lack of a collaborative mechanism has caused the network optimization to be conducted only within the facility or the enterprise itself rather than across all the logistics facilities. Second, previous studies on MEMCPDP emphasized that network structure optimization, including routing optimization, reduced operational costs but ignored the effect of recycling packaging materials on cost optimization and resource sharing. Third, in previous studies, the optimization objectives mostly focus on economic cost reduction and considered the time cost of waiting insufficiently. Thus, the timeliness of pickup and delivery is not guaranteed. Fourth, heuristic algorithms are widely used to solve the optimization problem of large-scale logistics networks. However, the advantages of combining exact and heuristic algorithms in the optimization of multi-echelon pickup and delivery problems should be further studied on the basis of the time–space (TS) network.
In compared with the previous research and combined with the actual logistics operation process, this study presents the following innovative contributions to theory and practice. First, the collaboration mechanism is introduced into the traditional MEMCPDP to establish the collaborative logistics pickup and delivery problem (CLPDP), which is an improvement from the local optimal networks under independent operations to the global optimal networks by establishing collaborative alliances. Second, in addition to network routing optimization, the recyclable eco-packages that replace traditional paper packages and the additional enhancements from eco-package pickup and delivery decrease costs. Third, the performance of a mixed integer programming model based on the TS networks in terms of satisfying the customers’ requirements for service timeliness while reducing the total network cost and improving resource utilization is examined. Fourth, in cases where the first and second echelon networks simultaneously consider routing optimization, the combination of the time-dependent forwarding dynamic programming algorithm based on the TS network and reference point-based non-dominated sorting algorithm-II (RP-NSGA-II) is used to achieve the Pareto optimal solution search under multi-objective requirements. In addition, the state of trucks/vehicles can be intelligently handled with L-EPs’ or S-EPs’ pickups and deliveries, and the entire logistics network can be iteratively optimized with the help of intelligent algorithms combined with exact and heuristic algorithms. Therefore, studying the CLPDPE is conducive to providing theoretical support for managing the operation of collaborative logistics pickup and delivery network, and then propelling the sustainable development of urban logistics and intelligent transportation systems.
The reminder of this article is structured as follows. The studies related to CLPDP with eco-packages (CLPDPE) based on the TS network are reviewed in Section 2. Then, relevant descriptions and theoretical proofs of the research problems are illustrated in Section 3. Meanwhile, modeling formulation based on the research problem and algorithms for solving the constructed model are described in Section 4 and Section 5, respectively. In addition, the improved Shapley value method for achieving fair allocation of the profits is described in Section 5. Subsequently, a practical case in Chongqing is used to confirm the validity of the proposed model and designed algorithms in Section 6. Finally, conclusions and potential research directions are presented in Section 7.
Section snippets
Literature review
The proposed CLPDPE integrates the concept of green and sustainable logistics into the collaborative optimization framework with multiple echelons and facilities. Therefore, the traditional MDVRPPD, which aims to achieve cost or service time savings by optimizing vehicle routing (Baldacci et al., 2011, Jian et al., 2015, Wang et al., 2020), is the basic framework for studying CLPDPE.
Notations for two-echelon CLPDP
A two-echelon CLPDP (TE-CLPDP) ensures the efficient utilization of logistics resources in a two-echelon pickup and delivery network. For this design to work effectively, coordination between the operations of two echelons is required. For example, the trucking load at each facility in the first echelon is determined by aggregated customer demands in the second echelon. Trucks may be shared and used for transportation in the first echelon, and vehicles may be shared and used for pickup and
Two-stage hybrid solution algorithms
On the one hand, in the TE-CLPDP, whether a facility joins a collaborative alliance in the first echelon determines whether its customers in the second echelon will receive pickup and delivery service by shared vehicles. On the other hand, the pickup and delivery quantity to each satellite facility in the first echelon depends on the total PD and DD from customers in the second echelon. Therefore, optimizing TE-CLPDP is a process of optimizing the two-echelon logistics networks simultaneously.
Implementation and analysis
This section consists of two sub-sections in terms of numerical experiments. The first sub-section compares the computational performance of the proposed RP-NSGA-II in this paper with two other heuristic algorithms. The second sub-section of the numerical experiments is the actual application of our proposed methods. The actual case study aims to clarify the applicability of the procedure based on the real-world data and to prove its practicality and reliability.
Conclusions
This study proposes CLPDPE under TS network representation based on two-echelon multi-center networks. The factors studied in this work include the construction of collaborative mechanisms among multiple facilities and the optimization of eco-package pickup and delivery networks under collaborative alliances. First, traditional paper packages are replaced with recyclable eco-packages. The additional eco-package pickup operation for recycling use and the basic delivery operation constitute a
CRediT authorship contribution statement
Yong Wang: Conceptualization, Methodology, Formal analysis, Investigation, Data curation, Resources, Visualization, Writing - original draft, Writing - review & editing, Supervision, Project administration, Funding acquisition. Shouguo Peng: Software, Validation, Formal analysis, Investigation, Data curation, Resources, Visualization, Writing - original draft, Writing - review & editing. Xiangyang Guan: Conceptualization, Methodology, Formal analysis, Investigation, Data curation, Writing -
Declaration of Competing Interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Acknowledgments
This research is supported by National Natural Science Foundation of China (Project No. 71871035, 41977337, 71971036), Humanity and Social Science Youth Foundation of Ministry of Education of China (18YJC630189), Key Science and Technology Research Project of Chongqing Municipal Education Commission (KJZD-K202000702), Key Project of Human Social Science of Chongqing Municipal Education Commission (No. 20SKGH079), Social Science Foundation of Chongqing of China (2019YBGL054), Natural Science
References (64)
- et al.
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
European Journal of Operational Research
(2015) - et al.
Resource sharing and payoff allocation in a three-stage system: Integrating network DEA with the Shapley value method
Omega-International Journal of Management Science
(2019) - et al.
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
European Journal of Operational Research
(2016) - et al.
The multi-depot vehicle routing problem with inter-depot routes
European Journal of Operational Research
(2007) - et al.
Supplier-initiated outsourcing: A methodology to exploit synergy in transportation
European Journal of Operational Research
(2010) - et al.
Profit allocation mechanisms for carrier collaboration in pickup and delivery service
Computers & Industrial Engineering
(2012) - et al.
The shared customer collaboration vehicle routing problem
European Journal of Operational Research
(2018) - et al.
Real-time control of express pickup and delivery processes in a dynamic environment
Transportation Research Part B: Methodological
(2014) - et al.
Cooperation in markovian queueing models
European Journal of Operational Research
(2008) - et al.
A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows
Applied Soft Computing
(2010)
What affect consumers’ willingness to pay for green packaging? Evidence from China
Resources, Conservation and Recycling
An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
Computers & Operations Research
Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
Computers and Operations Research
Design and development of a hybrid ant colony-variable neighborhood search algorithm for a multi-depot green vehicle routing problem
Transportation Research Part D: Transport and Environment
Vertical integration with endogenous contract leadership: Stability and fair profit allocation
European Journal of Operational Research
A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem-A case study on supply chain model
Applied Mathematical Modelling
Continuous approximation for demand, balancing in solving large-scale one commodity pickup and delivery problems
Transportation Research Part B: Methodological
The two-echelon distribution system considering the real-time transshipment capacity varying
Transportation Research Part B: Methodological
Benefit analysis of shared depot resources for multi-depot vehicle routing problem with fuel consumption
Transportation Research Part D: Transport and Environment
An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives
Journal of Cleaner Production
Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
European Journal of Operational Research
Cooperative game theory approach to allocating benefits of horizontal cooperation
European Journal of Operational Research.
Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state-space-time network representations
Transportation Research Part B: Methodological
MOAMP-Tabu search and NSGA-II for a real bi-objective scheduling-routing problem
Knowledge-Based Systems
A hybrid particle swarm optimization for the selective pickup and delivery problem with transfers
Engineering Applications of Artificial Intelligence
A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
Computers and Operations Research
Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste location-routing problem considering incompatible waste types
Journal of Cleaner Production
The dynamic shortest path problem with time-dependent stochastic disruptions
Transportation Research Part C: Emerging Technologies
Heterogeneous vehicle pickup and delivery problems: Formulation and exact solution
Transportation Research Part E: Logistics and Transportation Review
Profit maximizing hub location problems
Omega-International Journal of Management Science
Estimating the most likely space-time paths, dwell times and path uncertainties from vehicle trajectory data: A time geographic method
Transportation Research Part C: Emerging Technologies
A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem
Transportation Research Part E: Logistics and Transportation Review
Cited by (26)
A time space network optimization model for integrated fresh fruit harvest and distribution considering maturity
2024, Computers and Industrial EngineeringA simulation-optimization system for recycling logistics network of recyclable express packaging
2024, Computers and Industrial EngineeringEnabling joint distribution with blockchain technology in last-mile logistics
2024, Computers and Industrial EngineeringMulti-echelon sustainable reverse logistics network design with incentive mechanism for eco-packages
2023, Journal of Cleaner ProductionA two-stage optimization model for road-rail transshipment procurement and truckload synergetic routing
2023, Advanced Engineering Informatics