Abstract
Express packaging is consuming a huge amount of materials every year, which pollutes the environment and wastes resources as well. One of solutions is to build an express distribution network for circular packaging to recycle packaging materials. We present a forward and backward network that enables collection depots transport express packages to distribution centers where the wasted packaging materials are collected by recycle bins and sent back to the collection depots. Therefore, the recyclable packaging materials are detected in the collection depots, then the reusable materials are sent to the distribution centers and the others are transported back to material factories for recycling production. A mathematical model as well as a heuristic algorithm is built, based on Lagrangian relaxation and column generation, to optimize the circular packaging network. A case study has been led to test the proposed approach. The experiment results show that our solution can reduce total cost remarkably.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alshamsi A, Diabat A (2015) A reverse logistics network design. J Manuf Syst 37:589–598
Alumur SA, Nickel S, Saldanha-da-Gama F, Verter V (2012) Multi-period reverse logistics network design. Eur J Oper Res 220(1):67–78
Ammons JC, Realff MJ, Newton D (1997) Reverse production system design and operation for carpet recycling. Georgia Institute of Technology, Atlanta. Technical Report
Ayvaz B, Bolat B, Aydin N (2015) Stochastic reverse logistics network design for waste of electrical and electronic equipment. Resour Conserv Recycl 104:391–404
Azi N, Gendreau M, Potvin JY (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178(3):755–766
Bai R, Xue N, Chen J, Roberts GW (2015) A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem. Transp Res B Methodol 79:134–148
Balseiro SR, Loiseau I, Ramonet J (2011) An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Comput Oper Res 38(6):954–966
Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33(1):49–64
Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization, vol 28. Princeton University Press, Princeton
Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35–53
Blanc IL, van Krieken M, Krikke H, Fleuren H (2006) Vehicle routing concepts in the closed-loop container network of ARN—a case study. OR Spectrum 28(1):53–71
Capelle T, Cortés CE, Gendreau M, Rey PA, Rousseau LM (2019) A column generation approach for location-routing problems with pickup and delivery. Eur J Oper Res 272(1):121–131
Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput Oper Res 28(8):803–826
Fang C, Liu X, Pei J, Fan W, Pardalos PM (2016) Optimal production planning in a hybrid manufacturing and recovering system based on the internet of things with closed loop supply chains. Oper Res Int J 16(3):543–577
Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216–229
Guerrero WJ, Prodhon C, Velasco N, Amaya CA (2015) A relax-and-price heuristic for the inventory-location-routing problem. Int Trans Oper Res 22(1):129–148
Guo J, Wang X, Fan S, Gen M (2017) Forward and reverse logistics network and route planning under the environment of low-carbon emissions: a case study of Shanghai fresh food E-commerce enterprises. Comput Ind Eng 106:351–360
John ST, Sridharan R, Kumar PN, Krishnamoorthy M (2018) Multi-period reverse logistics network design for used refrigerators. Appl Math Model 54:311–331
Kumar VNSA, Kumar V, Brady M, Simpson M (2017) Resolving forward-reverse logistics multi-period model: an artificial immune system algorithm based approach. Int J Prod Econ 183(2):458–469
Lozano L, Duque D, Medaglia AL (2015) An exact algorithm for the elementary shortest path problem with resource constraints. Transp Sci 50(1):348–357
Ma H, Li X (2017) Closed-loop supply chain network design for hazardous products with uncertain demands and returns. Appl Soft Comput 68:889–899
Meng Q, Hei X, Wang S, Mao H (2015a) Carrying capacity procurement of rail and shipping services for automobile delivery with uncertain demand. Transp Res E Logist Transp Rev 82:38–54
Meng Q, Wang S, Lee CY (2015b) A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem. Transp Res B Methodol 72:1–19
Min H (1989) A bicriterion reverse distribution model for product recall. Omega-Int J Manag Sci 17(5):483–490
Nagurney A, Toyasaki F (2005) Reverse supply chain management and electronic waste recycling: a multitiered network equilibrium framework for e-cycling. Transp Res E Logist Transp Rev 41(1):1–28
Pati RK, Vrat P, Kumar P (2008) A goal programming model for paper recycling system. Omega-Int J Manag Sci 36(3):405–417
Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155–170
Salomon M, Thierry M, van Nunen J, Van Wassenhove L (1996) Distribution logistics and return flow optimization. Management Report Series, 254
Schleiffer R, Wollenweber J, Sebastian HJ, Golm F, Kapoustina N (2004) Application of genetic algorithms for the design of large-scale reverse logistic networks in Europe’s automotive industry. In: Proceedings of the 37th annual Hawaii international conference on system sciences, 2004. IEEE
Shan W, Peng Z, Liu J, Yao B, Yu B (2020) An exact algorithm for inland container transportation network design. Transp Res B Methodol 135:41–82
Trochu J, Chaabane A, Ouhimmou M (2018) Reverse logistics network redesign under uncertainty for wood waste in the CRD industry. Resour Conserv Recycl 128:32–47
Vidovic M, Dimitrijevic B, Ratkovic B, Simic V (2011) A novel covering approach to positioning ELV collection points. Resour Conserv Recycl 57:1–9
Zachariadis EE, Tarantilis CD, Kiranoudis CT (2017) Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints. Oper Res Int Journal 17(1):115–143
Zehendner E, Feillet D (2014) Benefits of a truck appointment system on the service quality of inland transport modes at a multimodal container terminal. Eur J Oper Res 235(2):461–469
Zhen L, Wang K, Wang S, Qu X (2018) Tug scheduling for hinterland barge transport: a branch-and-price approach. Eur J Oper Res 265(1):119–132
Zheng Y, Shu T, Wang S, Chen S, Lai KK, Gan L (2018) Analysis of product return rate and price competition in two supply chains. Oper Res Int J 18(2):469–496
Acknowledgements
This document is the result of the research projects funded by Natural Science Foundation of China (61273210), National Outstanding Youth Foundation of China (61802428), National Key R&D Program of China Nos. 2018YFC0806900, 2016YFC0800606, and 2016YFC0800310, Natural Science Foundation of Jiangsu Province under Grants Nos. BK20161469, Primary Research and Development Plan of Jiangsu Province under Grants Nos. BE2016904, BE2017616 and BE2018754.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Li, R., He, M., He, H. et al. Heuristic column generation for designing an express circular packaging distribution network. Oper Res Int J 22, 1103–1126 (2022). https://doi.org/10.1007/s12351-020-00570-w
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-020-00570-w