Transportation Research Part E: Logistics and Transportation Review
Green logistics location-routing problem with eco-packages
Introduction
The convenience of online shopping platforms and the continuous growth of the world’s commodity consumption rate are essential driving forces for modern logistics operations. The diversification and personalization of customer demands constitute emerging challenges to maintaining green logistics activities, including sustainable package delivery and pickup operations. In addition to meeting daily, diverse customer demands, logistics companies must consider the societal and environmental effect of logistics operations, and support sustainable logistics activities. Statistics show that more than 19 billion corrugated boxes were used for packaging in China in 2017, which means over 50 million tons of raw paper was consumed, resulting in about 70 million trees cut down for paper-making. Such huge resource consumption makes a green logistics strategy in packaging a focus of governments, enterprises, and customers (Liu et al., 2020a). In the life cycle of a conventional standard package, paper materials are used by the merchant for packaging products, transported by the logistics company to the customer, and ultimately discarded in most situations, as shown in Fig. 1. By contrast, in the case of green eco-packages, packaging materials are recycled and used multiple times after the customer takes out the product. On the one hand, green eco-packages are evidently better than conventional standard packages from the key perspective of green-oriented logistics and environmental protection. On the other hand, logistics companies tend to focus more on the cost and benefit of using green eco-packages. Thus, it is critically important to use Table 1 to compare the costs and benefits of the two types of packages. One can refer to Mahmoudi and Parviziomran (2020) to learn more about environmental and economic costs of these packages.
Table 1 compares the cost between a conventional standard package and a green eco-package for decision-making. From the manufacturing cost perspective, a green eco-package costs more than a conventional standard package (Nordin and Selke, 2010). The conventional standard package has no short-term benefit, that is, it has a high environmental externality due to the lack of recycling, whereas the green eco-package presents a relatively high short-term benefit and a low externality due to recycling. As a result, many companies have started to explore green logistics strategies that use green eco-packages to achieve cost savings from reduced waste of resources. In 2017, Suning invested 50,000 green eco-packages that can be recycled more than 1000 times to reduce the use of conventional standard packages by 6.5 million, and the percentage of cost savings exceeded 60%. In addition, the use of eco-packages enables resource sharing in terms of transporting and customer services across different facilities.
The location of the pickup facilities has a significant role on the recycling rate of green eco-package (Tiew et al., 2019). In a multi-echelon logistics network design for conventional package delivery, how to select the pickup facilities from the existing delivery facilities to recycle the green eco-package is a major challenge. Massive delivery and pickup requests are generated daily by online shopping, creating the need for logistics operators to synchronize logistics activities in multi-echelon networks, especially under resource constraints. Furthermore, achieving sustainability in recycling green eco-packages requires a strong focus on the selection of the facilities’ locations along with the design of the routing network.
In this study, we address the challenging problem of simultaneous location-routing decision, reflecting that the usually dispersed distribution of customer nodes over the entire city causes difficulties in reducing the underutilization of resources. We approach this problem as a green logistics location-routing problem with eco-packages (GLLRPE) considering the state, space, and time aspects of operations as well as operational synchronization and resource sharing between facilities. Finally, we propose an optimization framework for large-scale multi-echelon logistics delivery and pickup networks to solve the GLLRPE for logistics operations’ sustainability.
In general, a multi-echelon logistics delivery and pickup network consists of one or more pickup centers (PCs) and delivery centers (DCs), multiple delivery satellites (DSs) and pickup satellites (PSs) at intermediate echelons, and many customers (Govindan et al., 2014, Wang et al., 2017a). In a metropolis, where the sheer number of customers leads to large variations in pickup and delivery requirements, PSs and DSs should be wisely installed to satisfy customers’ actual expectations and keep companies profitable (Wang et al., 2018a). The state of each recycled green eco-package should also be tracked to examine its life cycle such that the logistics operators can decide on its reuse. Green eco-packages can be divided into three categories, namely, initial-, medium-, and critical-grade recoveries in actual operations (Cruz et al., 2012, Da et al., 2014). For example, no pickup services are usually provided for eco-packages exceeding their thresholds of critical-grade recovery owing to the exorbitant recovery cost. Moreover, each customer or logistics facility with a specific geographical location has service time constraints (time) and is subject to a delivery or pickup decision (state), based on the space capacity of the vehicle (space) and recycling times. Hence, the entire network can be referred to as state–space–time (SST) network (Mahmoudi and Zhou, 2016, Xu et al., 2018, Mahmoudi et al., 2019a, Mahmoudi et al., 2019b). In these complicated green logistics networks, large green eco-packages need to be transported from the first-echelon logistics facilities to the second-echelon satellites by semitrailer trucks, and reassigned to multiple small eco-packages for delivery to customers with a high degree of synchronization. Moreover, in SST networks, the theory proves that resource sharing can provide a higher degree of synchronization between multi-echelon logistics facilities than if each facility operates on its own.
Section snippets
Literature review
The GLLRPE is a practical combination of the traditional location routing problem (LRP) and green logistics network optimization problem. Therefore, this study on GLLRPE integrates all requirements of traditional LRP (including time window constraints of customers and satellites), features of pickup and delivery problem (PDP), and expectations for synchronization in the pickup and delivery network.
The rationality in facility locations and vehicle routing is considerably significant to
Problem statement
The term “Green Logistics Location Routing Problem” has been explored by numerous researchers (e.g., Bektas and Laporte, 2011, Toro et al., 2017, Wang et al., 2018b). Several existing articles address this problem to reduce greenhouse gas emission and effectively design backward logistics networks for recycling used products.
On the basis of a multi-echelon multi-depot logistics network, the investigated GLLRPE is divided into two problems, namely, the upper echelon semitrailer truck
Two-phase delivery and pickup programming model
Based on the introduction and complexity of the GLLRPE, the flowchart for the two-phase delivery and pickup programming model is illustrated in Fig. 8.
This study explores the location problem of facilities with routing optimization in the two-echelon logistics network, as shown in Fig. 8. The PSs are selected from the DSs in the mature logistics delivery network. The numbers and locations of satellites selection influence the green eco-packages’ pickup and delivery for the transport and service
Small-scale instances
The centralized transportation process between multiple facilities is involved in the first echelon, and the problem proposed in this study can be seen as a variant of the multi-depot vehicle routing problem with time windows (MDVRPTW). This study randomly generates 20 groups of small-scale instances and solves them through CPLEX and heuristic algorithms to verify the performance of the proposed algorithm in MDVRPTW, as shown in Table 9. Moreover, by integrating the waiting time into the total
Conclusions
This study proposes the GLLRPE under SST network representation and synchronization constraints based on a two-echelon logistics network. Based on the resource sharing SST network, the study of the GLLRPE includes the PS location and the routing optimization of the first-echelon transport and second-echelon services including green eco-package pickups and deliveries. The two-echelon logistics network is separated into transport and service phases based on the factors affecting location strategy
Author Statement
Yong Wang and Xuesong Zhou conceived and designed the conceptualization and methodology; Yong Wang and Shouguo Peng performed the software and validation; Yong Wang, Shouguo Peng, and Xuesong Zhou completed the formal analysis, investigation and data curation; Yong Wang, Monireh Mahmoudi, and Lu Zhen contributed the resources and visualization; Yong Wang, Shouguo Peng, and Monireh Mahmoudi completed the writing-original draft and writing-review & editing. Yong Wang and Xuesong Zhou implemented
Acknowledgments
The authors would like to express our sincere appreciation for the valuable comments made by three anonymous reviewers, which helped us to improve the quality of this paper. The first two authors and the fifth author of this paper are supported by National Natural Science Foundation of China (Project No. 71871035, 71831008, 71671107), Humanity and Social Science Youth Foundation of Ministry of Education of China (No. 18YJC630189), Key Science and Technology Research Project of Chongqing
References (79)
- et al.
Application of the NSGA-II algorithm to a multi-period inventory-redundancy allocation problem in a series-parallel system
Reliab. Eng. Syst. Saf.
(2017) - et al.
Multi-depot multi-compartment vehicle routing problem. solved by a hybrid adaptive large neighborhood search
Omega
(2018) - et al.
Compromising system and user interests in shelter location and evacuation planning
Transport. Res. Part B: Methodol.
(2015) - et al.
The pollution-routing problem
Transport. Res. Part B: Methodol.
(2011) - et al.
Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution
Transport. Res. Part B: Methodol.
(2020) - et al.
Lower and upper bounds for the two-echelon capacitated location-routing problem
Comput. Oper. Res.
(2012) - et al.
The green location-routing problem
Comput. Oper. Res.
(2019) - et al.
Cooperation in markovian queueing models
Eur. J. Oper. Res.
(2008) - et al.
Ant colony optimization with clustering for solving the dynamic location routing problem
Appl. Math. Comput.
(2016) - et al.
Two-echelon multiple vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food
Int. J. Prod. Econ.
(2014)
An integrated hybrid approach for circular supplier selection and closed loop supply chain network design under uncertainty
J. Cleaner Prod.
A fuzzy-based customer classification method for demand-responsive logistical distribution operations
Fuzzy Sets Syst.
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
Eur. J. Oper. Res.
Optimizing solid waste collection in Brussels
Eur. J. Oper. Res.
Continuous approximation for demand, balancing in solving large-scale one-commodity pickup and delivery problems
Transport. Res. Part B: Methodol.
Sustainable recycle network of heterogeneous pharmaceuticals with governmental subsidies and service-levels of third-party logistics by bi-level programming approach
J. Cleaner Prod.
Collaborative optimization for metro train scheduling and train connections combined with passenger flow control strategy
Omega.
Optimizing resource recharging location-routing plans: a resource-space-time network modeling framework for railway locomotive refueling applications
Comput. Ind. Eng.
A cumulative service state representation for the pickup and delivery problem with transfers
Transport. Res. Part B: Methodol.
Accessibility with time and resource constraints: Computing hyper-prisms for sustainable transportation planning
Comput. Environ. Urban Syst.
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
Transport. Res. Part B: Methodol.
Location-routing: issues, models and methods
Eur. J. Oper. Res.
A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
Comput. Oper. Res.
Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste location-routing problem considering incompatible waste types
J. Cleaner Prod.
Modelling and solving the integrated inventory-location-routing problem in a multi-period and multi-perishable product supply chain with uncertainty: Lagrangian relaxation algorithm
Comput. Chem. Eng.
The effect of ignoring routes when locating depots
Eur. J. Oper. Res.
Robust gasoline closed loop supply chain design with redistricting, service sharing and intra-district service transfer
Transport. Res. Part E: Logist. Transport. Rev.
The dynamic shortest path problem with time-dependent stochastic disruptions
Transport. Res. Part C: Emerg. Technol.
Estimating the most likely space-time paths, dwell times and path uncertainties from vehicle trajectory data: a time geographic method
Transport. Res. Part C: Emerg. Technol.
Comparative study on recycling behaviours between regular recyclers and non-regular recyclers in Malaysia
J. Environ. Manage.
A multi-objective model for the green capacitated location-routing problem considering environmental impact
Comput. Ind. Eng.
Cooperation and profit allocation in two-echelon logistics joint distribution network optimization
Appl. Soft Comput.
A fuzzy-based customer clustering approach with hierarchical structure for logistics network optimization
Expert Syst. Appl.
Profit distribution in collaborative multiple centers vehicle routing problem
J. Cleaner Prod.
Compensation and profit distribution for cooperative green pickup and delivery problem
Transport. Res. Part B: Methodol.
Two-echelon location-routing optimization with time windows based on customer clustering
Expert Syst. Appl.
Economic and environmental evaluations in the two-echelon collaborative multiple centers vehicle routing optimization
J. Cleaner Prod.
An integrated multi-depot hub-location vehicle routing model for network planning of parcel service
Int. J. Prod. Econ.
Integrated train timetabling and locomotive assignment
Transport. Res. Part B: Methodol.
Cited by (129)
A multi-objective optimal collaborative gas flow regulation method for non-stationary ventilation network based on improved NSGA-Ⅲ algorithm
2024, Advanced Engineering InformaticsTSEMTA: A tripartite shared evolutionary multi-task algorithm for optimizing many-task vehicle routing problems
2024, Engineering Applications of Artificial IntelligenceAn adaptive large neighborhood search for the multi-depot dynamic vehicle routing problem with time windows
2024, Computers and Industrial EngineeringThe multidepot vehicle routing problem with intelligent recycling prices and transportation resource sharing
2024, Transportation Research Part E: Logistics and Transportation ReviewThe multi-visit drone-assisted pickup and delivery problem with time windows
2024, European Journal of Operational ResearchBinR-LRP: A divide and conquer heuristic for large scale LRP with integrated microscopic agent-based transport simulation
2024, Transportation Research Interdisciplinary Perspectives