Green logistics location-routing problem with eco-packages

https://doi.org/10.1016/j.tre.2020.102118Get rights and content

Highlights

  • Optimize a location-routing problem with eco-packages in a state-space-time network.

  • Propose a two-phase optimization model for green eco-packages’ pickup and delivery.

  • Design a Lagrangian relaxation-based heuristic algorithm to solve the model.

  • Explore eco-package route sequences in resource sharing pickup and delivery process.

  • Study synchronization and cost-effectiveness in transport and service phases.

Abstract

Optimization of the green logistics location-routing problem with eco-packages involves solving a two-echelon location-routing problem and the pickup and delivery problem with time windows. The first echelon consists of large eco-package transport, which is modeled by a time-discretized transport-concentrated network flow programming in the resource sharing state–space–time (SST) network. The second echelon focuses on small eco-package pickups and deliveries, established by the cost-minimized synchronization-oriented location routing model that minimizes the total generalized cost, which includes internal transportation cost, value of eco-packages, short-term benefits and environmental externalities. In addition, the Gaussian mixture clustering algorithm is utilized to assign customers to their respective service providers in the pickup and delivery process, and a Clarke–Wright saving method-based non-dominated sorting genetic algorithm II is designed to optimize pickup and delivery routes, and improve their cost-effectiveness and degree of synchronization. Different strategy testing results are used in the service phase as input data to calculate the cost of the transport phase, which is solved through a Lagrangian relaxation approach. The 3D SST network representation innovatively captures the eco-package route sequence and state transition constraints over the shortest path in the pickup and delivery at any given moment of the transport phase. A large-scale logistics network in Chengdu, China, is used to demonstrate the proposed model and algorithm, and undertake sensitivity analysis considering the life cycle of green 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)

  • K. Govindan et al.

    An integrated hybrid approach for circular supplier selection and closed loop supply chain network design under uncertainty

    J. Cleaner Prod.

    (2020)
  • T.L. Hu et al.

    A fuzzy-based customer classification method for demand-responsive logistical distribution operations

    Fuzzy Sets Syst.

    (2003)
  • I. Kara et al.

    A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem

    Eur. J. Oper. Res.

    (2004)
  • T. Kulcar

    Optimizing solid waste collection in Brussels

    Eur. J. Oper. Res.

    (1996)
  • C. Lei et al.

    Continuous approximation for demand, balancing in solving large-scale one-commodity pickup and delivery problems

    Transport. Res. Part B: Methodol.

    (2018)
  • W.L. Liu et al.

    Sustainable recycle network of heterogeneous pharmaceuticals with governmental subsidies and service-levels of third-party logistics by bi-level programming approach

    J. Cleaner Prod.

    (2020)
  • R.M. Liu et al.

    Collaborative optimization for metro train scheduling and train connections combined with passenger flow control strategy

    Omega.

    (2020)
  • G.Y. Lu et al.

    Optimizing resource recharging location-routing plans: a resource-space-time network modeling framework for railway locomotive refueling applications

    Comput. Ind. Eng.

    (2019)
  • M. Mahmoudi et al.

    A cumulative service state representation for the pickup and delivery problem with transfers

    Transport. Res. Part B: Methodol.

    (2019)
  • M. Mahmoudi et al.

    Accessibility with time and resource constraints: Computing hyper-prisms for sustainable transportation planning

    Comput. Environ. Urban Syst.

    (2019)
  • M. Mahmoudi et al.

    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.

    (2016)
  • G. Nagy et al.

    Location-routing: issues, models and methods

    Eur. J. Oper. Res.

    (2007)
  • M. Qiu et al.

    A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups

    Comput. Oper. Res.

    (2018)
  • M. Rabbani et al.

    Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste location-routing problem considering incompatible waste types

    J. Cleaner Prod.

    (2018)
  • Z. Rafie-Majd et al.

    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.

    (2018)
  • S. Salhi et al.

    The effect of ignoring routes when locating depots

    Eur. J. Oper. Res.

    (1989)
  • R. Saedinia et al.

    Robust gasoline closed loop supply chain design with redistricting, service sharing and intra-district service transfer

    Transport. Res. Part E: Logist. Transport. Rev.

    (2019)
  • D. Sever et al.

    The dynamic shortest path problem with time-dependent stochastic disruptions

    Transport. Res. Part C: Emerg. Technol.

    (2018)
  • J.J. Tang et al.

    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.

    (2016)
  • K.G. Tiew et al.

    Comparative study on recycling behaviours between regular recyclers and non-regular recyclers in Malaysia

    J. Environ. Manage.

    (2019)
  • E.M. Toro et al.

    A multi-objective model for the green capacitated location-routing problem considering environmental impact

    Comput. Ind. Eng.

    (2017)
  • Y. Wang et al.

    Cooperation and profit allocation in two-echelon logistics joint distribution network optimization

    Appl. Soft Comput.

    (2017)
  • Y. Wang et al.

    A fuzzy-based customer clustering approach with hierarchical structure for logistics network optimization

    Expert Syst. Appl.

    (2014)
  • Y. Wang et al.

    Profit distribution in collaborative multiple centers vehicle routing problem

    J. Cleaner Prod.

    (2017)
  • J. Wang et al.

    Compensation and profit distribution for cooperative green pickup and delivery problem

    Transport. Res. Part B: Methodol.

    (2018)
  • Y. Wang et al.

    Two-echelon location-routing optimization with time windows based on customer clustering

    Expert Syst. Appl.

    (2018)
  • Y. Wang et al.

    Economic and environmental evaluations in the two-echelon collaborative multiple centers vehicle routing optimization

    J. Cleaner Prod.

    (2018)
  • M. Wasner et al.

    An integrated multi-depot hub-location vehicle routing model for network planning of parcel service

    Int. J. Prod. Econ.

    (2004)
  • X.M. Xu et al.

    Integrated train timetabling and locomotive assignment

    Transport. Res. Part B: Methodol.

    (2018)
  • Cited by (129)

    • The multidepot vehicle routing problem with intelligent recycling prices and transportation resource sharing

      2024, Transportation Research Part E: Logistics and Transportation Review
    View all citing articles on Scopus
    View full text