Matheuristics for inventory routing problems

Hybrid Algorithms for Service, Computing and Manufacturing Systems: Routing and Scheduling Solutions

Volumn , Issue , 2011, Pages 1-14

  Bertazzi, Luca ^a   Speranza, M Grazia ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84899196065     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-61350-086-6.ch001     Document Type: Chapter

References (21)

1. Abdelmaguid, T. F., & Dessouky, M. M. (2006). A genetic algorithm approach to the integrated inventory-distribution problem. International Journal of Production Research, 44, 4445-4464. doi:10.1080/00207540600597138
2. Abdelmaguid, T. F., Dessouky, M. M., & Ordónez, F., (2009). Heuristic approaches for the inventoryrouting problem with backlogging. Computers & Industrial Engineering, 56, 1519-1534. doi:10.1016/j.cie.2008.09.032
3. Archetti, C., Bertazzi, L., Hertz, A., & Speranza, M. G. (2010). (to appear). A hybrid heuristic for an inventory-routing problem. INFORMS Journal on Computing.
4. 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, 382-391. doi:10.1287/trsc.1060.0188
5. Bertazzi, L., Paletta, G., & Speranza, M. G. (2002). Deterministic order-up-to level policies in an inventory routing problem. Transportation Science, 36, 119-132. doi:10.1287/trsc.36.1.119.573
6. Bertazzi, L., Speranza, M. G., & Savelsbergh, M. W. P. (2008). Inventory routing. In Golden, B., Raghavan, R., & Wasil, E. (Eds.), Vehicle routing: Latest advances and new challenges (pp. 49-72). New York: Springer. doi:10.1007/978-0-387-77778-8_3
7. Bertazzi, L., Speranza, M. G., & Ukovich, W. (1997). Minimization of logistic costs with given frequencies. Transportation Research, 31B, 327-340.
8. Campbell, A. M., Clarke, L., Kleywegt, A., & Savelsbergh, M. W. P. (1998). The inventory routing problem. In Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, 95-113, Boston: Kluwer.
9. Campbell, A. M., & Savelsbergh, M. W. P. (2004). A decomposition approach for the inventoryrouting problem. Transportation Science, 38, 488-502. doi:10.1287/trsc.1030.0054
10. Christiansen, M. (1999). Decomposition of a combined inventory and time constrained ship routing problem. Transportation Science, 33, 3-16. doi:10.1287/trsc.33.1.3
11. Cordeau, J.-F., Laporte, G., Savelsbergh, M. W. P., & Vigo, D. (2007). Vehicle routing. In Barnhart, C., Laporte, G. (eds.) Handbooks in Operations Research and Management Science: Transportation, 14, 367-428.
12. Federgruen, A., & Simchi-Levi, D. (1995). Analysis of vehicle routing and inventory-routing problems. In Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operations Research and Management Science, 8, 297-373, North-Holland.
13. Fischetti, M., Salazar-González, J. J., & Toth, P. (1998). Solving the Orienteering Problem through Branch-and-Cut. INFORMS Journal on Computing, 10, 133-148. doi:10.1287/ijoc.10.2.133
14. Gendreau, M., Laporte, G., & Semet, F. (1998). A Branch-and-Cut Algorithm for the Undirected Selective Traveling Salesman Problem. Networks, 32, 263-273. doi:10.1002/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q
15. Herer, Y., & Roundy, R. (1997). Heuristic for one-warehouse multiretailer distribution problem with performance bounds. Operations Research, 45, 102-115. doi:10.1287/opre.45.1.102
16. Jaillet, P., Bard, J., Huang, L., & Dror, M. (2002). Delivery costs approximations for inventory routing problems in rolling horizon framework. Transportation Science, 36, 292-300. doi:10.1287/trsc.36.3.292.7829
17. Moin, N. H., & Salhi, S. (2007). Inventory routing problems: a logistical overview. The Journal of the Operational Research Society, 58, 1185-1194. doi:10.1057/palgrave.jors.2602264
18. Qiu-Hong Zhao, Q.-H., Wang, S.-Y., & Lai, K. K. (2007). A partition approach to the inventory/routing problem. European Journal of Operational Research, 177, 786-802. doi:10.1016/j.ejor.2005.11.030
19. Savelsbergh, M. W. P., & Song, J.-H. (2008). An optimization algorithm for inventory routing with continuous moves. Computers & Operations Research, 35, 2266-2282. doi:10.1016/j.cor.2006.10.020
20. Viswanathan, S., & Mathur, K. (1997). Integrating routing and inventory decisions in one warehouse multiretailer multiproduct distribution system. Management Science, 43, 294-312. doi:10.1287/mnsc.43.3.294
21. Yu, Y., Chen, H., & Chu, F. (2008). A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research, 189, 1022-1040. doi:10.1016/j.ejor.2007.02.061