Green logistics location-routing problem with eco-packages

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.

[1]  Harvey J. Miller,et al.  Accessibility with time and resource constraints: Computing hyper-prisms for sustainable transportation planning , 2019, Comput. Environ. Urban Syst..

[2]  Bahar Yetis Kara,et al.  The green location-routing problem , 2019, Comput. Oper. Res..

[3]  T. Gocken,et al.  Comparison of Different Clustering Algorithms via Genetic Algorithm for VRPTW , 2019 .

[4]  Hande Yaman,et al.  Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach , 2017, Transp. Sci..

[5]  Behnam Vahdani,et al.  Robust gasoline closed loop supply chain design with redistricting, service sharing and intra-district service transfer , 2019, Transportation Research Part E: Logistics and Transportation Review.

[6]  Pan Shang,et al.  Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery: A Path Finding Engine for Scheduled Transportation Systems , 2018, Urban Rail Transit.

[7]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[8]  Frederico G. Guimarães,et al.  A multi-objective model for the green capacitated location-routing problem considering environmental impact , 2017, Comput. Ind. Eng..

[9]  Zhen Yang,et al.  A Bi-Objective Reverse Logistics Network Design Under the Emission Trading Scheme , 2019, IEEE Access.

[10]  Geert-Jan van Houtum,et al.  Resource Pooling and Cost Allocation Among Independent Service Providers , 2015, Oper. Res..

[11]  Stefan Nickel,et al.  Multiperiod Location-Routing with Decoupled Time Scales , 2012, Eur. J. Oper. Res..

[12]  Pedro Simões,et al.  Economic cost recovery in the recycling of packaging waste: the case of Portugal , 2012 .

[13]  Teodor Gabriel Crainic,et al.  Lower and upper bounds for the two-echelon capacitated location-routing problem , 2012, Comput. Oper. Res..

[14]  Hassan Mina,et al.  An Integrated Hybrid Approach for Circular supplier selection and Closed loop Supply Chain Network Design under Uncertainty , 2020, Journal of Cleaner Production.

[15]  Tom Van Woensel,et al.  The dynamic shortest path problem with time-dependent stochastic disruptions , 2018, Transportation Research Part C: Emerging Technologies.

[16]  Michael Drexl,et al.  Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints , 2012, Transp. Sci..

[17]  Jiuh-Biing Sheu,et al.  A fuzzy-based customer classification method for demand-responsive logistical distribution operations , 2003, Fuzzy Sets Syst..

[18]  Thierry Kulcar,et al.  Optimizing solid waste collection in Brussels , 1996 .

[19]  Martin W. P. Savelsbergh,et al.  The Continuous-Time Service Network Design Problem , 2017, Oper. Res..

[20]  Yanfeng Ouyang,et al.  Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems , 2018 .

[21]  Martin W. P. Savelsbergh,et al.  A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem , 2018, CPAIOR.

[22]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[23]  Madjid Tavana,et al.  Application of the NSGA-II algorithm to a multi-period inventory-redundancy allocation problem in a series-parallel system , 2017, Reliab. Eng. Syst. Saf..

[24]  Mahdi Alinaghian,et al.  Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search , 2018 .

[25]  Yanwei Zhao,et al.  A Hyperheuristic Approach for Location-Routing Problem of Cold Chain Logistics considering Fuel Consumption , 2020, Comput. Intell. Neurosci..

[26]  Masoud Rabbani,et al.  Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste location-routing problem considering incompatible waste types , 2018 .

[27]  Seyed Hamid Reza Pasandideh,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 , 2018, Comput. Chem. Eng..

[28]  Yong Wang,et al.  Economic and environmental evaluations in the two-echelon collaborative multiple centers vehicle routing optimization , 2018, Journal of Cleaner Production.

[29]  S. M. Zain,et al.  Comparative study on recycling behaviours between regular recyclers and non regular recyclers in Malaysia. , 2019, Journal of environmental management.

[30]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[31]  Irandokht Parviziomran,et al.  Reusable packaging in supply chains: A review of environmental and economic impacts, logistics system designs, and operations management , 2020 .

[32]  Marta Cabral,et al.  Packaging waste recycling in Europe: is the industry paying for it? , 2014, Waste management.

[33]  Jiujun Cheng,et al.  Ant colony optimization with clustering for solving the dynamic location routing problem , 2016, Appl. Math. Comput..

[34]  Okan Örsan Özener,et al.  Humanitarian relief supplies distribution: an application of inventory routing problem , 2019, Ann. Oper. Res..

[35]  Samsung Lim,et al.  Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management , 2018, Ann. Oper. Res..

[36]  Richard W. Eglese,et al.  A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups , 2018, Comput. Oper. Res..

[37]  Gilles Pesant,et al.  Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis , 2012, Transp. Sci..

[38]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[39]  Majid Salari,et al.  Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network , 2019, Eur. J. Oper. Res..

[40]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[41]  Yong Liu,et al.  Two-echelon location-routing optimization with time windows based on customer clustering , 2018, Expert Syst. Appl..

[42]  Yong Wang,et al.  Profit distribution in collaborative multiple centers vehicle routing problem , 2017 .

[43]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[44]  Junhua Chen,et al.  A cumulative service state representation for the pickup and delivery problem with transfers , 2019, Transportation Research Part B: Methodological.

[45]  Susan Selke,et al.  Social aspect of sustainable packaging , 2010 .

[46]  Xuesong Zhou,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 , 2015, ArXiv.

[47]  Gilbert Laporte,et al.  A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem , 2003, Eur. J. Oper. Res..

[48]  Xiaolei Ma,et al.  A fuzzy-based customer clustering approach with hierarchical structure for logistics network optimization , 2014, Expert Syst. Appl..

[49]  Gilbert Laporte,et al.  Vehicle Routing and Location Routing with Intermediate Stops: A Review , 2017, Transp. Sci..

[50]  Said Salhi,et al.  The effect of ignoring routes when locating depots , 1989 .

[51]  Gilbert Laporte,et al.  The Pollution-Routing Problem , 2011 .

[52]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

[53]  B. Gong,et al.  Sustainable recycle network of heterogeneous pharmaceuticals with governmental subsidies and service-levels of third-party logistics by bi-level programming approach , 2020 .

[54]  Yong Wang,et al.  Cooperation and profit allocation in two-echelon logistics joint distribution network optimization , 2017, Appl. Soft Comput..

[55]  Reza Tavakkoli-Moghaddam,et al.  A Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem , 2018 .

[56]  Gilbert Laporte,et al.  An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines , 2016, Transp. Sci..

[57]  Yasmin A. Rios-Solis,et al.  Multiperiod Bus Timetabling , 2016, Transp. Sci..

[58]  Harvey J. Miller,et al.  Estimating the most likely space–time paths, dwell times and path uncertainties from vehicle trajectory data: A time geographic method , 2016 .

[59]  Justo Puerto,et al.  Cooperation in Markovian queueing models , 2008, Eur. J. Oper. Res..

[60]  Hande Yaman,et al.  Compromising system and user interests in shelter location and evacuation planning , 2015 .

[61]  Stephan M. Wagner,et al.  Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution , 2020 .

[62]  Weijun Xie,et al.  Reliable Location-Routing Design Under Probabilistic Facility Disruptions , 2016, Transp. Sci..

[63]  Lixing Yang,et al.  Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations , 2017 .

[64]  Masoud Rabbani,et al.  Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem , 2017 .

[65]  Yang Yu,et al.  Compensation and profit distribution for cooperative green pickup and delivery problem , 2018, Transportation Research Part B: Methodological.

[66]  Gilbert Laporte,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .

[67]  G. Laporte,et al.  Maximizing user convenience and postal service efficiency in post box location , 1986 .

[68]  Kannan Govindan,et al.  Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food , 2014 .

[69]  Manuel Iori,et al.  Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries , 2017, Oper. Res..

[70]  Hani S. Mahmassani,et al.  Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .

[71]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[72]  Maximilian Schiffer,et al.  Strategic planning of electric logistics fleet networks: A robust location-routing approach , 2017, Omega.

[73]  Lixing Yang,et al.  Collaborative optimization for metro train scheduling and train connections combined with passenger flow control strategy , 2020 .

[74]  Maximilian Schiffer,et al.  An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities , 2018, Transp. Sci..

[75]  Xuesong Zhou,et al.  Optimizing resource recharging location-routing plans: A resource-space-time network modeling framework for railway locomotive refueling applications , 2019, Comput. Ind. Eng..

[76]  Chung-Lun Li,et al.  Integrated train timetabling and locomotive assignment , 2018, Transportation Research Part B: Methodological.

[77]  Harvey J. Miller,et al.  Modelling accessibility using space-time prism concepts within geographical information systems , 1991, Int. J. Geogr. Inf. Sci..