Iterated local search and simulated annealing algorithms for the inventory routing problem

International Transactions in Operational Research

Volumn 25, Issue 6, 2018, Pages 1785-1809

  Alvarez, Aldair ^a   Munari, Pedro ^a   Morabito, Reinaldo ^a  

^a FEDERAL UNIVERSITY OF SÃO CARLOS   (Brazil)

Author keywords

inventory routing problem; iterated local search; logistic ratio; metaheuristics; simulated annealing

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; LOCAL SEARCH (OPTIMIZATION); ROUTING ALGORITHMS; SALES; SIMULATED ANNEALING; VEHICLE ROUTING;

COMPUTATIONAL EXPERIMENT; HIGH-QUALITY SOLUTIONS; INTEGER PROGRAMMING MODELS; INVENTORY ROUTING PROBLEMS; ITERATED LOCAL SEARCH; META HEURISTIC ALGORITHM; META HEURISTICS; SIMULATED ANNEALING ALGORITHMS;

PROBLEM SOLVING;

EID: 85046798544     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/itor.12547     Document Type: Article

References (47)

1. Abdelmaguid, T.F., Dessouky, M.M., Ordóñez, F., 2009. Heuristic approaches for the inventory-routing problem with backlogging. Computers & Industrial Engineering 56, 4, 1519–1534.
2. Adulyasak, Y., Cordeau, J.F., Jans, R., 2014a. Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS Journal on Computing 26, 1, 103–120.
3. Adulyasak, Y., Cordeau, J.F., Jans, R., 2014b. Optimization-based adaptive large neighborhood search for the production routing problem. Transportation Science 48, 1, 20–45.
4. Alvarez, A., Munari, P., 2016. Metaheuristic approaches for the vehicle routing problem with time windows and multiple deliverymen. Journal of Management & Production (Gestão e Produção) 23, 2, 279–293.
5. Alvarez, A., Munari, P., 2017. An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen. Computers & Operations Research 83, 1–12.
6. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A., 2010. Industrial aspects and literature survey: combined inventory management and routing. Computers & Operations Research 37, 9, 1515–1536.
7. Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G., 2012. A hybrid heuristic for an inventory routing problem. INFORMS Journal on Computing 24, 1, 101–116.
8. Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G., 2007. A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science 41, 3, 382–391.
9. Archetti, C., Bianchessi, N., Irnich, S., Speranza, M.G., 2014. Formulations for an inventory routing problem. International Transactions in Operational Research 21, 3, 353–374.
10. Archetti, C., Desaulniers, G., Speranza, M.G., 2017. Minimizing the logistic ratio in the inventory routing problem. EURO Journal on Transportation and Logistics, 6, 289–306.
11. Archetti, C., Speranza, M.G., 2016. The inventory routing problem: the value of integration. International Transactions in Operational Research 23, 3, 393–407.
12. Bell, W.J., Dalberto, L.M., Fisher, M.L., Greenfield, A.J., Jaikumar, R., Kedia, P., Mack, R.G., Prutzman, P.J., 1983. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13, 6, 4–23.
13. Benoist, T., Gardi, F., Jeanjean, A., Estellon, B., 2011. Randomized local search for real-life inventory routing. Transportation Science 45, 3, 381–398.
14. Brandão de Oliveira, H., Vasconcelos, G., 2010. A hybrid search method for the vehicle routing problem with time windows. Annals of Operations Research 180, 1, 125–144.
15. Bräysy, O., Gendreau, M., 2005. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science 39, 104–118.
16. Campbell, A.M., Savelsbergh, M., 2004. A decomposition approach for the inventory-routing problem. Transportation Science 38, 4, 488–502.
17. Coelho, L.C., Cordeau, J.F., Laporte, G., 2012. Consistency in multi-vehicle inventory-routing. Transportation Research Part C: Emerging Technologies 24, 270–287.
18. Coelho, L.C., Cordeau, J.F., Laporte, G., 2014. Thirty years of inventory routing. Transportation Science 48, 1, 1–19.
19. Coelho, L.C., Laporte, G., 2013a. A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. International Journal of Production Research 51, 23, 7156–7169.
20. Coelho, L.C., Laporte, G., 2013b. The exact solution of several classes of inventory-routing problems. Computers & Operations Research 40, 2, 558–565.
21. Coelho, L.C., Laporte, G., 2014. Improved solutions for inventory-routing problems through valid inequalities and input ordering. International Journal of Production Economics 155, 391–397.
22. Cordeau, J.F., Laganà, D., Musmanno, R., Vocaturo, F., 2014. A decomposition-based heuristic for the multiple-product inventory-routing problem. Computers & Operations Research 55, 2, 153–166.
23. Danna, E., Le Pape, C., 2005. Branch-and-price heuristics: a case study on the vehicle routing problem with time windows. In Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation. Springer, Berlin, pp. 99–129.
24. Deng, Y., Bard, J.F., 2011. A reactive GRASP with path relinking for capacitated clustering. Journal of Heuristics 17, 2, 119–152.
25. Desaulniers, G., Rakke, J.G., Coelho, L.C., 2016. A branch-price-and-cut algorithm for the inventory-routing problem. Transportation Science 50, 3, 1060–1076.
26. Dror, M., Ball, M., 1987. Inventory/routing: reduction from an annual to a short-period problem. Naval Research Logistics (NRL) 34, 891–905.
27. Dror, M., Ball, M., Golden, B., 1985. A computational comparison of algorithms for the inventory routing problem. Annals of Operations Research 4, 1, 1–23.
28. Galvão, R.D., Chiyoshi, F.Y., Morabito, R., 2005. Towards unified formulations and extensions of two classical probabilistic location models. Computers & Operations Research 32, 1, 15–33.
29. Hutter, F., Hoos, H.H., Leyton-Brown, K., Stützle, T., 2009. ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36, 1, 267–306.
30. Le, T., Diabat, A., Richard, J.P., Yih, Y., 2013. A column generation-based heuristic algorithm for an inventory routing problem with perishable goods. Optimization Letters 7, 7, 1481–1502.
31. Lin, S.W., Yu, V.F., 2015. A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows. Applied Soft Computing 37, 632–642.
32. Lourenço, H., Martin, O., Stützle, T., 2003. Iterated local search. In Glover, F., Kochenberger, G.A. (eds) Handbook of Metaheuristics. Springer, Berlin, pp. 321–353.
33. Mladenovic, N., Hansen, P., 1997. Variable neighborhood search. Computers & Operations Research 24, 1097–1100.
34. Palhazi Cuervo, D., Goos, P., Sörensen, K., Arráiz, E., 2014. An iterated local search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research 237, 2, 454–464.
35. Penna, P., Subramanian, A., Ochi, L.S., 2013. An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics 19, 201–232.
36. Santos, E., Ochi, L., Simonetti, L., González, P., 2016. A hybrid heuristic based on iterated local search for multivehicle inventory routing problem. Electronic Notes in Discrete Mathematics 52, 197–204.
37. Savelsbergh, M., Song, J.H., 2007. Inventory routing with continuous moves. Computers & Operations Research 34, 6, 1744–1763.
38. Savelsbergh, M., Song, J.H., 2008. An optimization algorithm for the inventory routing problem with continuous moves. Computers & Operations Research 35, 7, 2266–2282.
39. Shaabani, H., Kamalabadi, I.N., 2016. An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem. Computers & Industrial Engineering 99, 189–201.
40. Shiguemoto, A.L., Armentano, V.A., 2010. A tabu search procedure for coordinating production, inventory and distribution routing problems. International Transactions in Operational Research 17, 2, 179–195.
41. Silva, M.M., Subramanian, A., Ochi, L.S., 2015. An iterated local search heuristic for the split delivery vehicle routing problem. Computers & Operations Research 53, 234–249.
42. Singh, T., Arbogast, J.E., Neagu, N., 2015. An incremental approach using local-search heuristic for inventory routing problem in industrial gases. Computers and Chemical Engineering 80, 199–210.
43. Solyalı, O., Süral, H., 2011. A branch-and-cut algorithm using a strong formulation and an a priori tour-based heuristic for an inventory-routing problem. Transportation Science 45, 3, 335–345.
44. Subramanian, A., Drummond, L.M., Bentes, C., Ochi, L.S., Farias, R., 2010. A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research 37, 11, 1899–1911.
45. Vasco, R.A., Morabito, R., 2016. The dynamic vehicle allocation problem with application in trucking companies in Brazil. Computers & Operations Research 76, 118–133.
46. Wilcoxon, F., 1945. Individual comparisons by ranking methods. Biometrics Bulletin 1, 6, 80–83.
47. Yu, V.F., Lin, S.W., 2014. Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery. Applied Soft Computing Journal 24, 284–290.