A Variable MIP Neighborhood Descent algorithm for managing inventory and distribution of cash in automated teller machines

Computers and Operations Research

Volumn 85, Issue , 2017, Pages 22-31

  Larrain, Homero ^a   Coelho, Leandro C ^b   Cataldo, Alejandro ^a  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

Automated teller machines; Cash industry; Neighborhood search; Optimization

Indexed keywords

INTEGER PROGRAMMING; OPTIMIZATION; SENSITIVITY ANALYSIS;

AUTOMATED TELLER MACHINES; BENCHMARK SOLUTIONS; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL EXPERIMENT; INVENTORY ROUTING PROBLEMS; MATHEMATICAL FORMULATION; MIXED INTEGER PROGRAMMING MODEL; NEIGHBORHOOD SEARCH;

PROBLEM SOLVING;

EID: 85016304909     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2017.03.010     Document Type: Article

References (29)

1. Abdelmaguid, T.F., Dessouky, M.M., A genetic algorithm approach to the integrated inventory-distribution problem. Int. J. Prod. Res. 44:21 (2006), 4445–4464.
2. Aghezzaf, E.-H., Raa, B., van Landeghem, H., Modeling inventory routing problems in supply chains of high consumption products. Eur. J. Oper. Res. 169:3 (2006), 1048–1063.
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. 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. 50:3 (2016), 1077–1091.
5. Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G., A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24:1 (2012), 101–116.
6. Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G., A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41:3 (2007), 382–391.
7. Archetti, C., Bertazzi, L., Paletta, G., Speranza, M.G., Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 12:38 (2011), 1731–1746.
8. Bertacco, L., Fischetti, M., Lodi, A., A feasibility pump heuristic for general mixed-integer problems. Discrete Optim. 4:1 (2007), 63–76.
9. Bertazzi, L., Bosco, A., Guerriero, F., Laganà, D., A stochastic inventory routing problem with stock-out. Transp. Res. Part C: Emerging Technol. 27:1 (2013), 89–107.
10. Bertazzi, L., Paletta, G., Speranza, M.G., Deterministic order-up-to level policies in an inventory routing problem. Transp. Sci. 36:1 (2002), 119–132.
11. Berthold, T., RENS: The optimal routing. Math. Program. Comput. 6:1 (2014), 33–54.
12. Coelho, L.C., Cordeau, J.-F., Laporte, G., The inventory-routing problem with transshipment. Comput. Oper. Res. 39:11 (2012), 2537–2548.
13. Coelho, L.C., Cordeau, J.-F., Laporte, G., Heuristics for dynamic and stochastic inventory-routing. Comput Oper. Res. 52:Part A (2014), 55–67.
14. Coelho, L.C., Cordeau, J.-F., Laporte, G., Thirty years of inventory-routing. Transp. Sci. 48:1 (2014), 1–19.
15. Coelho, L.C., Laporte, G., A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int. J. Prod. Res. 51:23–24 (2013), 7156–7169.
16. Coelho, L.C., Laporte, G., The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40:2 (2013), 558–565.
17. Coelho, L.C., Laporte, G., Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int. J. Prod. Econ. 155:1 (2014), 391–397.
18. Danna, E., Rothberg, E., Le Pape, C., Exploring relaxation induced neighborhoods to improve mip solutions. Math. Program. 102:1 (2005), 71–90.
19. Dantzig, G., Fulkerson, R., Johnson, S., Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2:4 (1954), 393–410.
20. De Franceschi, R., Fischetti, M., Toth, P., A new ILP-based refinement heuristic for vehicle routing problems. Math. Program. 105:2–3 (2006), 471–499.
21. Desaulniers, G., Rakke, J.G., Coelho, L.C., A branch-price-and-cut algorithm for the inventory-routing problem. Transp. Sci. 50:3 (2016), 1060–1076.
22. Dillenberger, C., Escudero, L.F., Wollensak, A., Zhang, W., On practical resource allocation for production planning and scheduling with period overlapping setups. Eur. J. Oper. Res. 75:2 (1994), 275–286.
23. Fischetti, M., Glover, F., Lodi, A., The feasibility pump. Math. Program. 104:1 (2005), 91–104.
24. Fischetti, M., Lodi, A., Local branching. Math. Program. 98:1–3 (2003), 23–47.
25. Guzelsoy, M., Nemhauser, G., Savelsbergh, M.W.P., Restrict-and-relax search for 0-1 mixed-integer programs. EURO J. Comput. Optim. 1:1 (2013), 201–218.
26. Lysgaard, J., Letchford, A.N., Eglese, R.W., A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100:2 (2004), 423–445.
27. Mladenović, N., Hansen, P., Variable neighborhood search. Comput. Oper. Res. 24:11 (1997), 1097–1100.
28. Padberg, M.W., Rinaldi, G., A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33:1 (1991), 60–100.
29. Vidović, M., Popović, D., Ratković, B., Mixed integer and heuristics model for the inventory routing problem in fuel delivery. Int. J. Prod. Econ. 147:Part C (2014), 593–604.