New mathematical model for the bi-objective inventory routing problem with a step cost function: A multi-objective particle swarm optimization solution approach

Applied Mathematical Modelling

Volumn 49, Issue , 2017, Pages 302-318

  Dabiri, Nooraddin ^a   J Tarokh, Mohammad ^b   Alinaghian, Mahdi ^c  

^a GOLESTAN UNIVERSITY   (Iran)

^b K N TOOSI UNIVERSITY OF TECHNOLOGY   (Iran)

^c ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Augmented constraint method; Distribution system; Inventory routing problem; Multi objective particle swarm optimization; Step cost function

Indexed keywords

COST FUNCTIONS; COSTS; FUNCTIONS; INVENTORY CONTROL; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); TRANSPORTATION; VEHICLE ROUTING;

CONSTRAINT METHODS; DISTRIBUTION SYSTEMS; INVENTORY ROUTING PROBLEMS; MULTI OBJECTIVE PARTICLE SWARM OPTIMIZATION; STEP COST FUNCTIONS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 85020666007     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2017.03.022     Document Type: Article

References (79)

1. TLMCLMFisher, M., Chapter 1 vehicle routing. Ball, M.O., Nemhauser, GL, (eds.) Handbooks in Operations Research and Management Science, 8, 1995, Elsevier, 1–33.
2. Dantzig, G.B., Ramser, J.H., The Truck dispatching problem. Manag. Sci. 6:1 (1959), 80–91.
3. Naji-Azimi, Zahra, Majid, Salari, A complementary tool to enhance the effectiveness of existing methods for heterogeneous fixed fleet vehicle routing problem. Appl. Math. Model. 37:6 (2013), 4316–4324.
4. Bae, H., Moon, I., Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles. Appl. Math. Model. 40:13 (2016), 6536–6549.
5. Pop, P.C., Kara, I., Marc, A.H., New mathematical models of the generalized vehicle routing problem and extensions. Appl. Math. Model. 36:1 (2012), 97–107.
6. Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.P., A classification scheme for vehicle routing and scheduling problems. Eur. J. Oper. Res. 46:3 (1990), 322–332.
7. Laporte, G., The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59:3 (1992), 345–358.
8. Eksioglu, B., Vural, A.V., Reisman, A., The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57:4 (2009), 1472–1483.
9. Na, B., Jun, Y., Kim, B.I., Some extensions to the sweep algorithm. Int. J. Adv. Manuf. Technol. 56:9 (2011), 1057–1067.
10. Ben-Daya, M., Darwish, M., Ertogral, K., The joint economic lot sizing problem: review and extensions. Eur. J. Oper. Res. 185 (2008), 726–742.
11. Ben-Daya, M., Al-Nassar, A., Integrated multi-stage inventory production system in a three-layer supply chain. Prod. Plann. Control: Manag. Oper. 19:2 (2008), 97–104.
12. Federgruen, A., Zipkin, P., Combined vehicle routing and inventory allocation problem. Oper. Res. 32:5 (1984), 1019–1037.
13. Burns, L.D., Hall, R.W., Blumenfeld, D.E., Daganzo, C.F., Distribution strategies that minimize transportation and inventory costs. Oper. Res. 33 (1985), 469–490.
14. Kim, J.U., Kim, Y.D., A Lagrangian relaxation approach to multi-period inventory /distribution planning. J. Oper. Res. Soc. 51 (2000), 364–370.
15. Gallego, G., Simchi-Levi, D., On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems. Manag. Sci. 36:2 (1990), 240–243.
16. Reiman, M.I., Rubio, R., Wein, L.M., Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transp. Sci. 33:4 (1999), 361–380.
17. Barnes-Schuster, D., Bassok, Y., Direct shipping and the dynamic single-depot/multi-retailer inventory system. Eur. J. Oper. Res. 101:3 (1997), 509–518 doi:0.1016/S0377-2217(96)00188-9.
18. Anily, S., Federgruen, A., Two-echelon distribution system with vehicle routing cost and central warehouse. Oper. Res. 41 (1993), 37–47.
19. Anily, S., Federgruen, A., A class of Euclidean routing problems with general route cost functions. Math. Oper. Res. 15 (1990), 268–285.
20. Dror, M., Ball, M., Golden, B., A computational comparison of algorithms for the inventory routing problem. Ann. Oper. Res. 4:1 (1985), 1–23.
21. Dror, M., Ball, M., Inventory/routing: reduction from an annual to short-period problem. Naval Res. Logist. 34:6 (1987), 891–905.
22. Liu, S.C., Lin, C.C., A heuristic method for the combined location routing and inventory problem. Int. J. Adv. Manuf. Technol. 26:4 (2005), 372–381.
23. Golden, B., Assad, A., Dahl, R., Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Syst. 7:2–3 (1984), 181–190.
24. Bard, J.F., Huang, L., Jaillet, P., Dror, M., A decomposition approach to the inventory routing problem with satellite facilities. Transp. Sci. 32:2 (1998), 189–203, 10.1287/trsc.32.2.189.
25. Jaillet, P., Bard, J.F., Huang, L., Dror, M., Delivery cost approximations for inventory routing problems in a rolling horizon framework. Transp. Sci. 36:3 (2002), 292–300.
26. Dabiri, N., Tarokh, M.J., Setak, M., A constructive heuristic for a multi product inventory routing problem. Transp. Res., 2(1), 2012, 11.
27. TLMCLMFedergruen, A., Simchi-Levi, D, Chapter 4 Analysis of vehicle routing and inventory-routing problems. Ball, M.O., Nemhauser, G.L., (eds.) Handbooks in Operations Research and Management Science, 8, 1995, Elsevier, 297–373.
28. Baita, F., Ukovich, W., Pesenti, R., Favaretto, D., Dynamic routing-and-inventory problems: a review. Transp. Res. Part A: Policy Pract. 32A:8 (1998), 585–598.
29. Sarmiento, A.M., Nagi, R., A review of integrated analysis of production–distribution systems. IIE Trans. 31:11 (1999), 1061–1074, 10.1023/a:1007623508610.
30. Moin, N.H., Salhi, S., Inventory routing problems: a logistical overview. J. Oper. Res. Soc. 58:9 (2007), 1185–1194.
31. 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.
32. Azuma, R.M., Coelho, G.P., Von Zuben, F.J., Evolutionary multi-objective optimization for the vendor-managed inventory routing problem. 2011 IEEE Congress on Evolutionary Computation (CEC), 2011, IEEE, 1457–1464.
33. Campbell, A.M., Savelsbergh, M.W.P., A decomposition approach for the inventory-routing problem. Transp. Sci. 38:4 (2004), 488–502, 10.1287/trsc.1030.0054.
34. Anily, S., Bramel, J., An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. Discr. Appl. Math. 145:1 (2004), 22–39.
35. Bell, W.J., Dalberto, L.M., Fisher, M.L., Greenfield, A.J., Jaikumar, R., Kedia, P., Mack, R.G., Prutzman, P.J., Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13:6 (1983), 4–23, 10.1287/inte.13.6.4.
36. Campbell, A.M., Clarke, L., Savelsbergh, M.W.P., Inventory routing in practice,. Toth, P., Vigo, D., (eds.) The Vehicle Routing Problem, 2002, SIAM, Philadelphia, 309–330.
37. Christiansen, M., Decomposition of a combined inventory and time constrained ship routing problem. Transp. Sci. 33:1 (1999), 3–16.
38. Persson, J.A., Göthe-Lundgren, M., Shipment planning at oil refineries using column generation and valid inequalities. Eur. J. Oper. Res. 163:3 (2005), 631–652.
39. Al-Khayyal, F., Hwang, S-J, Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: applications and model. Eur. J. Oper. Res. 176:1 (2007), 106–130.
40. Dauzère-Pérès, S., Nordli, A., Olstad, A., Haugen, K., Koester, U., Myrstad, P.O., Teistklub, G., Reistad, A., Omya Hustadmarmor optimizes its supply chain for delivering calcium carbonate slurry to European paper manufacturers. Interfaces 37:1 (2007), 39–51.
41. Alegre, J., Laguna, M., Pacheco, J., Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Eur. J. Oper. Res. 179:3 (2007), 736–746.
42. Blumenfeld, D.E., Burns, L.D., Diltz, J.D., Daganzo, C.F., Analyzing trade-offs between transportation, inventory and production costs on freight networks. Transp. Res. Part B: Methodol. 19:5 (1985), 361–380.
43. Gaur, V., Fisher, M.L., A periodic inventory routing problem at a supermarket chain. Oper. Res. 52:6 (2004), 813–822.
44. Custodio, A., Oliveira, R., Redesigning distribution operations: a case study on integrating inventory management and vehicle routes design. Int. J. Logist. 9:2 (2006), 169–187.
45. Hemmelmayr, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P., Delivery strategies for blood products supplies. OR Spectrum 31:4 (2009), 707–725.
46. Zografos, K.G., Vasilakis, G.M., Giannouli, G.M., A unified framework for developing DSS for hazardous materials risk management. J. Hazard. Mater. 71:1 (2000), 503–552.
47. List, G.F., Mirchandani, P.B., Turnquist, K.M., Zografos, G., Modeling and analysis for hazardous materials transportation: risk analysis, routing/scheduling and facility location. Transp. Sci. 25:2 (1991), 100–114.
48. Ashtakala, B., Eno, L.A., Minimum risk route model for hazardous materials. J. Transp. Eng. 122:5 (1996), 45–56.
49. Kara, B.Y., Verter, V., Designing a Road network for hazardous materials transportation. Transp. Sci. 38:2 (2004), 188–196.
50. Niakan, F., Rahimi, M., Document A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach. Transp. Res. Part E: Logist. Transp. Rev. 80:1 (2015), 74–94.
51. Nolz, P.C., Absi, N., Feillet, D., A stochastic inventory routing problem for infectious medical waste collection. Networks 63:1 (2014), 82–95.
52. Wu, D.D., Olson, D.L., Birge, J.R., Introduction to special issue on enterprise risk management in operations. Int. J. Prod. Econ. 134:1 (2011), 1–2.
53. Wu, D.D., Olson, D.L., Computational simulation and risk analysis: an introduction of state of the art research. Math. Comput. Model. 58:9–10 (2013), 1581–1587.
54. Olson, D.L., Wu, D., Risk management models for supply chain: a scenario analysis of outsourcing to China. Supply Chain Manag. 16:6 (2011), 401–408.
55. Mavrotas, G., Diakoulaki, D., Florios, K., Georgiou, P., A mathematical programming framework for energy planning in services' sector buildings under uncertainty in load demand: the case of a hospital in Athens. Energy Policy 36:7 (2008), 2415–2429.
56. Mavrotas, G., Effective implementation of the ε-constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213:2 (2009), 455–465.
57. Hammache, A., Benali, M., Aubé, F., Multi-objective self-adaptive algorithm for highly constrained problems: novel method and applications. Appl. Energy 87:8 (2010), 2467–2478.
58. Wu, D.D., Luo, C., Wang, H., Birge, J.R., Bi‐level programming merger evaluation and application to banking operations. Prod. Oper. Manag. 25:3 (2016), 498–515.
59. Wu, D.D., Bilevel programming data envelopment analysis with constrained resource. Eur. J. Oper. Res. 207:2 (2010), 856–864.
60. Haimes, Y., Lasdon, L., Wismer, D., On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst., Man, Cybern. 1:3 (1971), 296–297.
61. Miettinen, K., Nonlinear multiobjective optimization. International Series in Operations Research & Management Science, 12, 1998, Springer.
62. Ehrgott, M., Ryan, D.M., Constructing robust crew schedules with bicriteria optimization. J. Multi-Crit. Decis. Anal. 11:3 (2002), 139–150, 10.1002/mcda.321.
63. Xidonas, P., Mavrotas, G., Psarras, J., Equity portfolio construction and selection using multiobjective mathematical programming. J. Global Opt. 47:2 (2010), 185–209.
64. Aghaei, J., Amjady, N., Shayanfar, H.A., Multi-objective electricity market clearing considering dynamic security by lexicographic optimization and augmented epsilon constraint method. Appl. Soft Comput. 4:11 (2011), 3846–3858.
65. Mavalizadeh, H., Ahmadi, A., Hybrid expansion planning considering security and emission by augmented epsilon-constraint method. Int. J. Electr. Power Energy Syst. 1:61 (2014), 90–100.
66. Eberhart, R., Kennedy J A new optimizer using particle swarm theory. 6th International Symposium on Micro Machine and Human Science, 1995, IEEE, 39–43.
67. Kennedy, J., Eberhart, R., Particle swarm optimization. International Conference on Neural Networks, 1995, IEEE Service Center, 1942–1948.
68. Murata, T., Itai, R., Multi-objective vehicle routing problems using two-fold EMO algorithms to enhance solution similarity on non-dominated solutions. Coello Coello, C.A., Hernandez Aguirre, A., Zitzler, E., (eds.) Third International Conference on Evolutionary Multi-Criterion Optimization, 2005, 885–896 EMO 2005.
69. Jozefowiez, N., Semet, F., Talbi, E.G., Target aiming Pareto search and its application to the vehicle routing problem with route balancing. J. Heurist. 13:5 (2007), 455–469.
70. Jozefowiez, N., Semet, F., Talbi, E.G., An evolutionary algorithm for the vehicle routing problem with route balancing. Eur. J. Oper. Res. 195:3 (2009), 761–769.
71. Janson, S., Merkle, D., Middendorf, M., Parallel ant colony algorithms. Parallel Metaheuristics, 2005, John Wiley & Sons, Inc., 171–201, 10.1002/0471739383.ch8.
72. Krami, N., El-Sharkawi, M.A., Akherraz, M., Pareto multiobjective optimization technique for reactive power planning. IEEE Power and Energy Society 2008 General Meeting: Conversion and Delivery of Electrical Energy in the 21st Century, Pittsburgh, PA, 2008, PES.
73. Fieldsend, J.E., Multi-objective particle swarm optimization methods. Technical Report 419 Department of Computer Science, 2004, University of Exeter.
74. Reyes-Sierra, M., Coello, C.A.C., Multi-objective particle swarm optimizers: a survey of the state-of-the-art. Int. J. Comput. Intell. Res. 2:3 (2006), 287–308.
75. Ai, T.J., Kachitvichyanukul, V., Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput. Ind. Eng. 56:1 (2009), 380–387.
76. Croes, G.A., A method for solving traveling-salesman problems. Oper. Res. 6:6 (1958), 791–812.
77. Jaszkiewicz, A., Multiple Objective Metaheuristic Algorithms for Combinatorial Optimization. Habilitation thesis, 2001, Poznan University of Technology, Poznan.
78. Zitzler, E., Thiele, L., Multiobjective optimization using evolutionary algorithms—a comparative case study,. International Conference on Parallel Problem Solving from Nature, Berlin Heidelberg, 1998, Springer, 292–301.
79. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T., A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. International Conference on Parallel Problem Solving From Nature, Berlin Heidelberg, 2000, Springer, 849–858.