A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment

Computers and Industrial Engineering

Volumn 104, Issue , 2017, Pages 124-133

  Azadeh, A ^a   Elahi, S ^a   Farahani, M Hosseinabadi ^b   Nasirian, B ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Genetic algorithm; Inventory routing problem; Mathematical programming; Perishable products; Taguchi design; Transshipment

Indexed keywords

GENETIC ALGORITHMS; MATHEMATICAL PROGRAMMING; PRODUCT DESIGN; ROUTING ALGORITHMS; VEHICLE ROUTING; WAREHOUSES;

ALGORITHM PARAMETERS; ENVIRONMENTAL ISSUES; EXPONENTIAL RATES; INVENTORY DECISIONS; INVENTORY ROUTING PROBLEMS; PERISHABLE PRODUCT; TAGUCHI DESIGN; TRANSSHIPMENT;

PROBLEM SOLVING;

EID: 85008384464     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2016.12.019     Document Type: Article

References (53)

1. Abdelmaguid, T.F., Dessouky, M.M., Ordóñez, F., Heuristic approaches for the inventory-routing problem with backlogging. Computers & Industrial Engineering 56:4 (2009), 1519–1534.
2. Abdul Rahim, M.K.I., Zhong, Y., Aghezzaf, E.H., Aouam, T., Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates. International Journal of Production Research, 2014, 1–13 (ahead-of-print).
3. Adelman, D., A price-directed approach to stochastic inventory/routing. Operations Research 52:4 (2004), 499–514.
4. Adulyasak, Y., Cordeau, J.F., Jans, R., Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS Journal on Computing 26:1 (2013), 103–120.
5. Al-Khayyal, F., Hwang, S.J., Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: Applications and model. European Journal of Operational Research 176:1 (2007), 106–130.
6. Anily, S., Bramel, J., An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. Discrete Applied Mathematics 145:1 (2004), 22–39.
7. Arbib, C., Pacciarelli, D., Smriglio, S., A three-dimensional matching model for perishable production scheduling. Discrete Applied Mathematics 92:1 (1999), 1–15.
8. Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G., A hybrid heuristic for an inventory routing problem. INFORMS Journal on Computing 24:1 (2012), 101–116.
9. Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G., A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science 41:3 (2007), 382–391.
10. Belenguer, J.M., Martinez, M.C., Mota, E., A lower bound for the split delivery vehicle routing problem. Operations Research 48:5 (2000), 801–810.
11. Boudia, M., Louly, M.A.O., Prins, C., Fast heuristics for a combined production planning and vehicle routing problem. Production Planning and Control 19:2 (2008), 85–96.
12. Campbell, A., Clarke, L., Savelsbergh, M.W.P., Inventory routing in practice: The vehicle routing problem. Toth, P., Vigo, D., (eds.) SIAM monographs on discrete mathematics and applications, Vol. 9, 2002, 309–330.
13. Campbell, A.M., Savelsbergh, M.W., A decomposition approach for the inventory-routing problem. Transportation Science 38:4 (2004), 488–502.
14. Chen, H.K., Hsueh, C.F., Chang, M.S., Production scheduling and vehicle routing with time windows for perishable food products. Computers & Operations Research 36:7 (2009), 2311–2319.
15. Chen, Y.M., Lin, C.T., A coordinated approach to hedge the risks in stochastic inventory-routing problem. Computers & Industrial Engineering 56:3 (2009), 1095–1112.
16. Chen, L.M., Sapra, A., Joint inventory and pricing decisions for perishable products with two-period lifetime. Naval Research Logistics (NRL) 60:5 (2013), 343–366.
17. Chiu, H.N., Lee, Y.S., Chang, J.H., Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment. Production Planning & Control 17:5 (2006), 480–493.
18. Coelho, L.C., Cordeau, J.F., Laporte, G., The inventory-routing problem with transshipment. Computers & Operations Research 39:11 (2012), 2537–2548.
19. Coelho, L.C., Laporte, G., The exact solution of several classes of inventory-routing problems. Computers & Operations Research 40:2 (2013), 558–565.
20. Coelho, L.C., Laporte, G., A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. International Journal of Production Research 51:23–24 (2013), 7156–7169.
21. Dror, M., Ball, M., Inventory/routing: Reduction from an annual to a short-period problem. Naval Research Logistics (NRL) 34:6 (1987), 891–905.
22. Dror, M., Laporte, G., Trudeau, P., Vehicle routing with split deliveries. Discrete Applied Mathematics 50:3 (1994), 239–254.
23. Dror, M., Trudeau, P., Savings by split delivery routing. Transportation Science, 1989, 41–145.
24. Geismar, H.N., Laporte, G., Lei, L., Sriskandarajah, C., The integrated production and transportation scheduling problem for a product with a short lifespan. INFORMS Journal on Computing 20:1 (2008), 21–33.
25. Gen, M., Cheng, R., Genetic algorithms and engineering optimization, Vol. 7, 2000, John Wiley & Sons.
26. Gen, M., Cheng, R., Lin, L., Network models and optimization: Multiobjective genetic algorithm approach. 2008, Springer Science & Business Media.
27. Gen, M., Syarif, A., Hybrid genetic algorithm for multi-time period production/distribution planning. Computers & Industrial Engineering 48:4 (2005), 799–809.
28. Haughton, M., Tackling complexities of cyclic inventory routing under conditions of limited modelling and computing capacity. International Journal of Logistics Research and Applications 17:3 (2014), 216–231.
29. Ho, S.C., Haugland, D., A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research 31:12 (2004), 1947–1964.
30. Holland, J.H., Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. 1975, University of Michigan Press, Ann Arbor, MI.
31. Hsu, C.I., Hung, S.F., Li, H.C., Vehicle routing problem with time-windows for perishable food delivery. Journal of Food Engineering 80:2 (2007), 465–475.
32. Huang, S.H., Lin, P.C., A modified ant colony optimization algorithm for multi- item inventory routing problems with demand uncertainty. Transportation Research Part E: Logistics and Transportation Review 46:5 (2010), 598–611.
33. Jemai, Z., Rekik, Y., Kalaï, R., Inventory routing problems in a context of vendor-managed inventory system with consignment stock and transshipment. Production Planning & Control 24:8–9 (2013), 671–683.
34. Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W., The stochastic inventory routing problem with direct deliveries. Transportation Science 36:1 (2002), 94–118.
35. Lee, C.G., Epelman, M.A., White, C.C. III, Bozer, Y.A., A shortest path approach to the multiple-vehicle routing problem with split pick-ups. Transportation Research Part B: Methodological 40:4 (2006), 265–284.
36. Lin, L., Gen, M., Auto-tuning strategy for evolutionary algorithms: Balancing between exploration and exploitation. Soft Computing 13:2 (2009), 157–168.
37. Lu, C.C., Vincent, F.Y., Data envelopment analysis for evaluating the efficiency of genetic algorithms on solving the vehicle routing problem with soft time windows. Computers & Industrial Engineering 63:2 (2012), 520–529.
38. Mehdizadeh, E., Tavakkoli-Moghaddam, R., Yazdani, M., A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times. Applied Mathematical Modelling 39:22 (2015), 6845–6859.
39. MirzapourAl-e-hashem, S.M.J., Rekik, Y., Multi-product multi-period Inventory Routing Problem with a transshipment option: A green approach. International Journal of Production Economics, 2013.
40. Moin, N.H., Salhi, S., Aziz, N.A.B., An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. International Journal of Production Economics 133:1 (2011), 334–343.
41. Naderi, B., Zandieh, M., Balagh, A.K.G., Roshanaei, V., An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems with Applications 36:6 (2009), 9625–9633.
42. Nourmohammadi, A., Zandieh, M., Assembly line balancing by a new multi-objective differential evolution algorithm based on TOPSIS. International Journal of Production Research 49:10 (2011), 2833–2855.
43. Ozsoydan, F.B., Sipahioglu, A., Heuristic solution approaches for the cumulative capacitated vehicle routing problem. Optimization 62:10 (2013), 1321–1340.
44. Rhee, W.T., Probabilistic analysis of a capacitated vehicle routing problem—I. Optimization 27:1–2 (1993), 79–87.
45. Seifbarghy, M., Samadi, Z., A tabu search-based heuristic for a new capacitated cyclic inventory routing problem. International Journal of Mathematics in Operational Research 6:4 (2014), 491–504.
46. Shukla, N., Tiwari, M.K., Ceglarek, D., Genetic-algorithms-based algorithm portfolio for inventory routing problem with stochastic demand. International Journal of Production Research 51:1 (2013), 118–137.
47. Siswanto, N., Essam, D., Sarker, R., Solving the ship inventory routing and scheduling problem with undedicated compartments. Computers & Industrial Engineering 61:2 (2011), 289–299.
48. Tasan, A.S., Gen, M., A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering 62:3 (2012), 755–761.
49. Toriello, A., Nemhauser, G., Savelsbergh, M., Decomposing inventory routing problems with approximate value functions. Naval Research Logistics (NRL) 57:8 (2010), 718–727.
50. Tsai, J.T., Ho, W.H., Liu, T.K., Chou, J.H., Improved immune algorithm for global numerical optimization and job-shop scheduling problems. Applied Mathematics and Computation 194:2 (2007), 406–424.
51. Yang, W.H., Mathur, K., Ballou, R.H., Stochastic vehicle routing problem with restocking. Transportation Science 34:1 (2000), 99–112.
52. Yu, Y., Chen, H., Chu, F., A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research 189:3 (2008), 1022–1040.
53. Yu, B., Ma, N., Cai, W., Li, T., Yuan, X., Yao, B., Improved ant colony optimization for the dynamic multi-depot vehicle routing problem. International Journal of Logistics Research and Applications 16:2 (2013), 144–157.