Reducing carbon emissions in a closed-loop production routing problem with simultaneous pickups and deliveries under carbon cap-and-trade

Sustainability (Switzerland)

Volumn 9, Issue 12, 2017, Pages

  Fang, Xuanjing ^a   Du, Yanan ^a   Qiu, Yuzhuo ^a,b  

^a NANJING UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

Branch and bound; Carbon cap and trade; Carbon emission; Environmental studies; Production planning and control; Routing

Indexed keywords

ALGORITHM; CARBON EMISSION; EMISSION CONTROL; ENVIRONMENTAL ASSESSMENT; LOGISTICS; NUMERICAL METHOD; PLANNING METHOD; PRODUCTION SYSTEM; REGULATORY APPROACH; ROUTING; SUPPLY CHAIN MANAGEMENT; SUSTAINABLE DEVELOPMENT; TRADE-OFF;

EID: 85035359612     PISSN: None     EISSN: 20711050     Source Type: Journal    
DOI: 10.3390/su9122198     Document Type: Article

References (39)

1. Qiu, Y.; Qiao, J.; Pardalos, P. A branch-and-price algorithm for production routing problems with carbon cap-and-trade. Omega 2017, 68, 49-61
2. Adulyasak, Y.; Cordeau, J.-F.; Jans, R. The production routing problem: A review of formulations and solution algorithms. Comput. Oper. Res. 2015, 55, 141-152
3. Bektas, T.; Laporte, G. The pollution-routing problem. Transp. Res. Part B Meth. 2011, 45, 1232-1250
4. Palak, G.; Ekşioğlub, S.D.; Geunes, J. Analyzing the impacts of carbon regulatory mechanisms on supplier and mode selection decisions: An application to a biofuel supply chain. Int. J. Prod. Econ. 2014, 154, 198-216
5. Savaskan, R.C.; Bhattacharya, S.; Wassenhove, L.N.V. Closed-loop supply chain models with product remanufacturing. Manag. Sci. 2004, 50, 239-252
6. Iassinovskaia, G.; Limbourg, S.; Riane, F. The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains. Int. J. Prod. Econ. 2017, 183, 570-582
7. Chandra, P. A dynamic distribution model with warehouse and customer replenishment requirements. J. Oper. Res. Soc. 1993, 44, 681-692
8. Lei, L.; Liu, S.; Ruszczynski, A.; Park, S. On the integrated production, inventory, and distribution routing problem. IIE Trans. 2006, 38, 955-970
9. Archetti, C.; Bertazzi, L.; Paletta, G.; Speranza, M.G. Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 2011, 38, 1731-1746
10. Adulyasak, Y.; Cordeau, J.-F.; Jans, R. Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J. Comput. 2014, 26, 103-120
11. Adulyasak, Y.; Cordeau, J.-F.; Jans, R. Benders decomposition for production routing under demand uncertainty. Oper. Res. 2015, 63, 851-867
12. Brahimi, N.; Aouam, T. Multi-item production routing problem with backordering: A MILP approach. Int. J. Prod. Res. 2015, 54, 1076-1093
13. Vahdani, B.; Niaki, S.; Aslanzade, S. Production-inventory-routing coordination with capacity and time window constraints for perishable products: Heuristic and meta-heuristic algorithms. J. Clean. Prod. 2017, 161, 598-618
14. Zhang, Q.; Sundaramoorthy, A.; Grossmann, I.E.; Pinto, J.M. Multiscale production routing in multicommodity supply chains with complex production facilities. Comput. Oper. Res. 2017, 79, 207-222
15. Kumar, R.S.; Kondapaneni, K.; Dixit, V.; Goswami, A.; Thakur, L.; Tiwari, M. Multi-objective modeling of production and pollution routing problem with time window: A self-learning particle swarm optimization approach. Comput. Ind. Eng. 2015, 99, 29-40
16. Battarra, M.; Cordeau, J.-F.; Iori, M. Pickup-and-delivery problems for goods transportation. In Vehicle Routing: Problems, Methods, and Applications; Toth, P., Vigo, D., Eds.; MOS/SIAM Series on Optimization; SIAM: Philadelphia, PA, USA, 2014; Volume 18, pp. 161-192
17. Subramanian, A.; Uchoa, E.; Pessoa, A.A.; Ochi, L.S. Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. Optim. Lett. 2013, 7, 1569-1581
18. Cherkesly, M.; Desaulniers, G.; Laporte, G. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Transp. Sci. 2015, 49, 752-766
19. Qu, Y.; Bard, J.F. A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity. Transp. Sci. 2015, 49, 254-270
20. Soysal, M. Closed-loop inventory routing problem for returnable transport items. Transp. Res. Part D Transp. Environ. 2016, 48, 31-45
21. Van Anholt, R.G.; Coelho, L.C.; Laporte, G.; Vis, I.F.A. An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. Transp. Sci. 2016, 50, 1077-1091
22. Bard, J.F.; Nananukul, N. Heuristics for a multiperiod inventory routing problem with production decisions. Comput. Ind. Eng. 2009, 57, 713-723
23. Bard, J.F.; Nananukul, N. A branch-and-price algorithm for an integrated production and inventory routing problem. Comput. Oper. Res. 2010, 37, 2202-2217
24. Chandra, P.; Fisher, M.L. Coordination of production and distribution planning. Eur. J. Oper. Res. 1994, 72, 503-517
25. Fumero, F.; Vercellis, C. Synchronized development of production, inventory, and distribution schedules. Transp. Sci. 1999, 33, 330-340
26. Boudia, M.; Louly, M.; Prins, C. A reactive GRASP and path relinking for a combined production-distribution problem. Comput. Oper. Res. 2007, 34, 3402-3419
27. Boudia, M.; Prins, C. A memetic algorithm with dynamic population management for an integrated production-distribution problem. Eur. J. Oper. Res. 2009, 195, 703-715
28. Bard, J.F.; Nananukul, N. The integrated production-inventory-distribution-routing problem. J. Sched. 2009, 12, 257-280
29. Armentano, V.; Shiguemoto, A.; Lokketangen, A. Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 2011, 38, 1199-1209
30. Adulyasak, Y.; Cordeau, J.-F.; Jans, R. Optimization-based adaptive large neighborhood search for the production routing problem. Transp. Sci. 2014, 48, 20-45
31. Absi, N.; Archetti, C.; Dauzere-Peres, S.; Feillet, D. A two-phase iterative heuristic approach for the production routing problem. Transp. Sci. 2015, 49, 784-795
32. Russell, R.A. Mathematical programming heuristics for the production routing problem. Int. J. Prod. Econ. 2017, 193, 40-49
33. Solyali, O.; Süral, H. A multi-phase heuristic for the production routing problem. Comput. Oper. Res. 2017, 87, 114-124
34. Lysgaard, J.; Letchford, A.N.; Eglese, R.W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 2004, 100, 423-445
35. Kytöjoki, J.; Nuortio, T.; Bräysy O.; Gendreau M. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput. Oper. Res. 2007, 34, 2743-2757
36. Groër, C.; Golden, B.; Wasil, E. A library of local search heuristics for the vehicle routing problem. Math. Program. Comput. 2010, 2, 79-101
37. Helsgaun, K. LKH. 2012. Available online: http://www.akira.ruc.dk/~keld/research/LKH (accessed on 28 November 2017)
38. Lin, S.; Kernighan, B.W. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 1973, 21, 498-516
39. Franceschetti, A.; Honhon, D.; Van Woensel, T.; Bektaş, T.; Laporte, G. The time-dependent pollution-routing problem. Transp. Res. Part B Meth. 2013, 56, 265-293