The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

International Journal of Production Economics

Volumn 183, Issue , 2017, Pages 570-582

  Iassinovskaia, Galina ^a   Limbourg, Sabine ^b   Riane, Fouad ^c  

^a LOUVAIN SCHOOL OF MANAGEMENT   (Belgium)

^b UNIVERSITY OF LIÈGE   (Belgium)

^c Mechanical Engineering Industrial Management and Innovation Laboratory Hassan Premier University Ecole Centrale Casablanca   (Morocco)

Author keywords

Closed loop supply chain; Inventory routing problem; Pickups and deliveries; Returnable transport item; Time windows

Indexed keywords

CRASHWORTHINESS; ENVIRONMENTAL IMPACT; ENVIRONMENTAL REGULATIONS; FLEET OPERATIONS; INTEGER PROGRAMMING; PICKUPS; SOFTWARE TESTING; SUPPLY CHAINS;

CLOSED-LOOP SUPPLY CHAIN; INVENTORY ROUTING PROBLEMS; LARGE-SCALE PROBLEM; MIXED INTEGER LINEAR PROGRAM; OPERATIONAL BENEFITS; RETURNABLE TRANSPORT ITEM; SIMULTANEOUS PICKUP AND DELIVERIES; TIME WINDOWS;

VEHICLE ROUTING;

EID: 84977155286     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2016.06.024     Document Type: Article

References (78)

1. Akçalı, E., Çetinkaya, S., Quantitative models for inventory and production planning in closed-loop supply chains. Int. J. Prod. Res. 49:8 (2011), 2373–2407.
2. Andersson, H., Christiansen, M., Fagerholt, K., The maritime pickup and delivery problem with time windows and split loads. INFOR 49:2 (2011), 79–91.
3. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A., Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 37:9 (2010), 1515–1536.
4. Angelelli, E., Mansini, R., 2002. The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Quantitative Approaches to Distribution Logistics and Supply Chain Management. Springer, Berlin-Heidelberg, pp. 249–267.
5. Avci, M., Topaloglu, S., An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Comput. Ind. Eng. 83 (2015), 15–29.
6. Baldacci, R., Bartolini, E., Mingozzi, A., An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59:2 (2011), 414–426.
7. Benavent, E., Landete, M., Mota, E., Tirado, G., The multiple vehicle pickup and delivery problem with {LIFO} constraints. Eur. J. Oper. Res. 243:3 (2015), 752–762.
8. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G., Static pickup and delivery problems: a classification scheme and survey. TOP 15:1 (2007), 1–31.
9. Bertazzi, L., Savelsbergh, M., Speranza, M.G., 2008. Inventory routing. In: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, pp. 49–72.
10. Chen, H.-K., Chou, H.-W., Hsueh, C.-F., Yu, Y.-J., The paired many-to-many pickup and delivery problem: an application. TOP 23:1 (2015), 220–243.
11. Cherkesly, M., Desaulniers, G., Irnich, S., Laporte, G., Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250:3 (2016), 782–793.
12. Cherkesly, M., Desaulniers, G., Laporte, G., A population-based metaheuristic for the pickup and delivery problem with time windows and {LIFO} loading. Comput. Oper. Res. 62 (2015), 23–35.
13. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D., Ship routing and scheduling in the new millennium. Eur. J. Oper. Res. 228:3 (2013), 467–483.
14. Christiansen, M., Nygreen, B., A method for solving ship routing problemswith inventory constraints. Ann. Oper. Res. 81:0 (1998), 357–378.
15. Coelho, L.C., Cordeau, J.-F., Laporte, G., Thirty years of inventory routing. Transp. Sci. 48:1 (2013), 1–19.
16. Coelho, L.C., Laporte, G., Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int. J. Prod. Econ. 155 (2014), 391–397.
17. Corbett, C.J., Van Wassenhove, L.N., The green fee: internalizing and operationalizing environmental issues. Calif. Manag. Rev. 36:1 (1993), 116–135.
18. Dell'Amico, M., Righini, G., Salani, M., A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transp. Sci. 40:2 (2006), 235–247.
19. Demir, E., Bektaş, T., Laporte, G., A comparative analysis of several vehicle emission models for road freight transportation. Transp. Res. Part D: Transp. Environ. 16:5 (2011), 347–357.
20. Dethloff, J., Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR-Spektr. 23:1 (2001), 79–96.
21. Duhaime, R., Riopel, D., Langevin, A., Value analysis and optimization of reusable containers at canada post. Interfaces 31:3 (2001), 3–15.
22. European Parliament and Council, 2005. European Parliament and Council Directive 94/62/EC of 20 December 1994 on packaging and packaging waste. Amended in 2003, 2004, 2005. 〈 http://www.tse.org.tr/docs/direktifler-form/94_62.pdf?sfvrsn=2〉.
23. Garcia-Najera, A., 2012. The vehicle routing problem with backhauls: a multi-objective evolutionary approach. In: Evolutionary Computation in Combinatorial Optimization: Proceedings of 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11–13, 2012. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 255–266.
24. Gendreau, M., Laporte, G., Vigo, D., Heuristics for the traveling salesman problem with pickup and delivery. Comput. Oper. Res. 26:7 (1999), 699–714.
25. Gendreau, M., Nossack, J., Pesch, E., Mathematical formulations for a 1-full-truckload pickup-and-delivery problem. Eur. J. Oper. Res. 242:3 (2015), 1008–1016.
26. GeorgiaTech, 2016. A Library Of Maritime Inventory Routing Problems. 〈 http://mirplib.scl.gatech.edu/publications〉 (accessed: 2016-06-05).
27. Ghiani, G., Laporte, G., Musmanno, R., Introduction to Logistics Systems Planning and Control. 2004, John Wiley & Sons, Chichester, England.
28. Ghilas, V., Demir, E., Woensel, T.V., An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines. Comput. Oper. Res. 72 (2016), 12–30.
29. Goksal, F.P., Karaoglan, I., Altiparmak, F., A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Comput. Ind. Eng. 65:1 (2013), 39–53 (Intelligent Manufacturing Systems).
30. Guide, V.D.R., Production planning and control for remanufacturing: industry practice and research needs. J. Oper. Manag. 18:4 (2000), 467–483.
31. Guide, V.D.R., Harrison, T.P., Van Wassenhove, L.N., The challenge of closed-loop supply chains. Interfaces 33:6 (2003), 3–6.
32. Guide, V.D.R., Jayaraman, V., Srivastava, R., Production planning and control for remanufacturing: a state-of-the-art survey. Robot. Comput.-Integr. Manuf. 15:3 (1999), 221–230.
33. Guide, V.D.R., Van Wassenhove, L.N., Business Aspects of Closed-loop Supply Chains, vol. 2, 2003, Carnegie Mellon University Press, Pittsburgh, PA.
34. Guide, V.D.R., Van Wassenhove, L.N., The evolution of closed-loop supply chain research. Oper. Res. 57:1 (2009), 10–18.
35. Gungor, A., Gupta, S.M., Issues in environmentally conscious manufacturing and product recovery: a survey. Comput. Ind. Eng. 36:4 (1999), 811–853.
36. Hu, Z.-H., Sheu, J.-B., Zhao, L., Lu, C.-C., A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods. Transp. Res. Part C: Emerg. Technol. 55 (2015), 273–297 (Engineering and Applied Sciences Optimization (OPT-i)—Professor Matthew G. Karlaftis Memorial Issue).
37. IC-RTI, 2003. Reusable Transport Items (RTI)—Organizational Recommendations. 〈 http://ecr-all.org/wp-content/uploads/pub_2003_RTI_organisational_recommendations.pdf〉.
38. Kärkkäinen, M., Ala-Risku, T., Herold, M., 2004. Managing the rotation of reusable transport packaging–a multiple case study. In: Thirteenth International Working Seminar on Production Economics, Igls, Austria.
39. Karlaftis, M.G., Kepaptsoglou, K., Sambracos, E., Containership routing with time deadlines and simultaneous deliveries and pick-ups. Transp. Res. Part E: Logist. Transp. Rev. 45:1 (2009), 210–221.
40. Kassem, S., Chen, M., Solving reverse logistics vehicle routing problems with time windows. Int. J. Adv. Manuf. Technol. 68:1–4 (2013), 57–68.
41. Kim, T., Glock, C.H., Kwon, Y., A closed-loop supply chain for deteriorating products under stochastic container return times. Omega 43 (2014), 30–40.
42. Kroon, L., Vrijens, G., Returnable containers: an example of reverse logistics. Int. J. Phys. Distrib. Logist. Manag. 25:2 (1995), 56–68.
43. Lammers, W., Lange, V., Luzyna, D., 1993. Ökologischer vergleich eines einweg- und mehrweg- transport- verpackungssystems: Endbericht. Frauenhofer Institut für Materialfluss and Logistik, Dortmund.
44. Li, Y., Chen, H., Prins, C., Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur. J. Oper. Res. 252:1 (2016), 27–38.
45. Li, Y., Lim, A., Oon, W.-C., Qin, H., Tu, D., The tree representation for the pickup and delivery traveling salesman problem with {LIFO} loading. Eur. J. Oper. Res. 212:3 (2011), 482–496.
46. Limbourg, S., Martin, A., Paquay, C., 2016. Optimal returnable transport items management. In: World Conference on Transport Research WCTR 2016, Shanghai.
47. Liu, R., Xie, X., Augusto, V., Rodriguez, C., Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur. J. Oper. Res. 230:3 (2013), 475–486.
48. Mason, A., Shaw, A., Al-Shamma'a, A., Peer-to-peer inventory management of returnable transport items: a design science approach. Comput. Ind. 63:3 (2012), 265–274.
49. Masson, R., Ropke, S., Lehuédé, F., Péton, O., A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes. Eur. J. Oper. Res. 236:3 (2014), 849–862 (Vehicle Routing and Distribution Logistics).
50. Mihi Ramírez, A., Product return and logistics knowledge: influence on performance of the firm. Transp. Res. Part E: Logist. Transp. Rev. 48:5 (2012), 1137–1151.
51. Min, H., The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transp. Res. Part A: Gen. 23:5 (1989), 377–386.
52. Montané, F.A.T., Galvão, R.D., A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput. Oper. Res. 33:3 (2006), 595–619.
53. Nagy, G., Salhi, S., Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur. J. Oper. Res. 162:1 (2005), 126–141.
54. Nananukul, N., Clustering model and algorithm for production inventory and distribution problem. Appl. Math. Model. 37:24 (2013), 9846–9857.
55. New Zealand Business Council for Sustainable Development, 2003. Business guide to a sustainable supply chain—a practical guide. 〈 http://www.sbc.org.nz/supplychain/SupplyChain.pdf〉.
56. Pang, K.-W., Xu, Z., Li, C.-L., Ship routing problem with berthing time clash avoidance constraints. Int. J. Prod. Econ. 131:2 (2011), 752–762.
57. Parragh, S.N., Doerner, K., Hartl, R.F., A survey on pickup and delivery models part I: transportation between customers and depot. J. Betriebswirtschaft 58 (2008), 21–51.
58. Pelikán, J., Fábry, J., Heuristics for routes generation in pickup and delivery problem. Cent. Eur. J. Oper. Res. 20:3 (2012), 463–472.
59. Petersen, H.L., Ropke, S., 2011. The pickup and delivery problem with cross-docking opportunity. In: Computational Logistics: Proceedings of Second International Conference, ICCL 2011, Hamburg, Germany, September 19–22, 2011. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 101–113.
60. Pollaris, H., Braekers, K., Caris, A., Janssens, G.K., Limbourg, S., 2014. Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. EURO J. Transp. Logist., 1–25.
61. Psaraftis, H.N., A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases. Eur. J. Oper. Res. 215:3 (2011), 572–580.
62. Qu, Y., Bard, J.F., the heterogeneous pickup and delivery problem with configurable vehicle capacity. Transp. Res. Part C: Emerg. Technol. 32 (2013), 1–20.
63. Rais, A., Alvelos, F., Carvalho, M., New mixed integer-programming model for the pickup-and-delivery problem with transshipment. Eur. J. Oper. Res. 235:3 (2014), 530–539.
64. Ríos-Mercado, R.Z., López-Pérez, J.F., Castrillón-Escobar, A., 2013. A GRASP for a multi-depot multi-commodity pickup and delivery problem with time windows and heterogeneous fleet in the bottled beverage industry. In: Computational Logistics: Proceedings. of 4th International Conference, ICCL 2013, Copenhagen, Denmark, September 25–27, 2013. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 143–157.
65. Rosenau, W.V., Twede, D., Mazzeo, M.A., Singh, S.P., Returnable/reusable logistical packaging: a capital budgeting investment decision framework. J. Bus. Logist. 17:2 (1996), 139–165.
66. Şahin, M., Çavuşlar, G., Öncan, T., Şahin, G., Aksu, D.T., An efficient heuristic for the multi-vehicle one-to-one pickup and delivery problem with split loads. Transp. Res. Part C: Emerg. Technol. 27 (2013), 169–188 (Selected papers from the Seventh Triennial Symposium on Transportation Analysis (TRISTAN VII)).
67. Sarkis, J., Greening the Supply Chain. 2006, Springer, London.
68. Sifa, Z., Jiandong, C., Xiaomin, L., Keqiang, L., Urban pickup and delivery problem considering time-dependent fuzzy velocity. Comput. Ind. Eng. 60:4 (2011), 821–829.
69. Souza, G.C., Closed-loop supply chains: a critical review, and future research. Decis. Sci. 44:1 (2013), 7–38.
70. Subramanian, A., Uchoa, E., Pessoa, A.A., Ochi, L.S., Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 39:5 (2011), 338–341.
71. Sustainable Packaging Coalition, 2011. Definition of sustainable packaging. 〈 http://sustainablepackaging.org/uploads/Documents/Definition%20of%20Sustainable%20Packaging.pdf〉.
72. Tarantilis, C.D., Anagnostopoulou, A.K., Repoussis, P.P., Adaptive path relinking for vehicle routing and scheduling problems with product returns. Transp. Sci. 47:3 (2013), 356–379.
73. Ting, C.-K., Liao, X.-L., The selective pickup and delivery problem: formulation and a memetic algorithm. Int. J. Prod. Econ. 141:1 (2013), 199–211 (Meta-heuristics for manufacturing scheduling and logistics problems).
74. Toth, P., Vigo, D., 2001. The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia.
75. Van Anholt, R.G., Coelho, L.C., Laporte, G., Vis, I.F., 2013. An Inventory-routing Problem with Pickups and Deliveries arising in the Replenishment of Automated Teller Machines.
76. Venkateshan, P., Mathur, K., An efficient column-generation-based algorithm for solving a pickup-and-delivery problem. Comput. Oper. Res. 38:12 (2011), 1647–1655.
77. Wang, H.-F., Chen, Y.-Y., A coevolutionary algorithm for the flexible delivery and pickup problem with time windows. Int. J. Prod. Econ. 141:1 (2013), 4–13 (Meta-heuristics for manufacturing scheduling and logistics problems).
78. Zerhouni, H., Gayon, J.-P., Frein, Y., Influence of dependency between demands and returns in a reverse logistics system. Int. J. Prod. Econ. 143:1 (2013), 62–71.