Formulations for an inventory routing problem

International Transactions in Operational Research

Volumn 21, Issue 3, 2014, Pages 353-374

  Archetti, Claudia ^a   Bianchessi, Nicola ^a   Irnich, Stefan ^b   Speranza, M Grazia ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

Branch and cut algorithm; Integer programming; Routing problems; Supply chain management

Indexed keywords

BENCHMARKING; COMBINATORIAL OPTIMIZATION; SUPPLY CHAIN MANAGEMENT;

BRANCH-AND-CUT ALGORITHMS; CAPACITATED VEHICLES; DISCRETE TIME; INVENTORY ROUTING PROBLEMS; ROUTING PROBLEMS; TRANSPORTATION COST; VALID INEQUALITY;

INTEGER PROGRAMMING;

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

References (22)

1. Adulyasak, Y., Cordeau, J.-F., Jans, R., 2013a. Adaptive large neighborhood search for the production routing problem. Transportation Science. doi: 10.1287/trsc.1120.0443.
2. Adulyasak, Y., Cordeau, J.-F., Jans, R., 2013b. Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS Journal on Computing. doi:10.1287/ijoc.2013.0550.
3. Andersson, H., Christiansen, M., Fagerholt, K., 2010a. Transportation planning and inventory management in the LNG supply chain. In Bjørndal, E., Bjørndal, M., Pardalos, P.M., Rönnqvist, M. (eds) Energy, Natural Resources and Environmental Economics. Springer, New York, pp. 223-248.
4. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A., 2010b. Industrial aspects and literature survey: combined inventory management and routing. Computers and Operations Research 37, 1515-1536.
5. Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G., 2012. A hybrid heuristic for an inventory-routing problem. INFORMS Journal on Computing 24, 101-116.
6. 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.
7. Avella, P., Boccia, M., Wolsey, L., 2013. Single item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances. CORE Discussion Papers 2013045, Center for Operations Research and Econometrics (CORE), Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
8. Bertazzi, L., Paletta, G., Speranza, M.G., 2002. Deterministic order-up-to level policies in an inventory routing problem. Transportation Science 36, 119-132.
9. Bertazzi, L., Speranza, M.G., Savelsbergh, M.W.P., 2008. Inventory routing. In Golden, B., Raghavan, R., Wasil, E. (eds) The Vehicle Routing Problem Latest Advances and New Challenges, Operations Research/Computer Science Interfaces Series 43. Springer-Verlag, Berlin, pp. 49-72.
10. Campbell, A., Wilson, J., 2014. Forty years of periodic vehicle routing. Networks 63, 2-15.
11. Christiansen, M., 1999. Decomposition of a combined inventory and time constrained ship routing problem. Transportation Science 33, 3-16.
12. Coelho, L.C., Cordeau, J.-F., Laporte, G., 2012. Consistency in multi-vehicle inventory-routing. Transportation Research Part C 24, 270-287.
13. Coelho, L., Cordeau, J.-F., Laporte, G., 2013. Thirty years of inventory routing. Transportation Science. doi:10.1287/trsc.2013.0472.
14. Coelho, L.C., Laporte, G., 2013. The exact solution of several classes of inventory-routing problems. Computers and Operations Research 40, 2, 558-565.
15. Cordeau, J.-F., Laporte, G., Savelsbergh, M., Vigo, D., 2009. Vehicle routing. In Laporte, G., Barnhart, C. (eds) Handbooks in Operations Research and Management Science: Transportation, the Vehicle Routing Problem, Latest Advances and New Challenges, Operations Research/Computer Science Interfaces Series 43. North-Holland, Amsterdam, pp. 367-428.
16. Dauzère-Pérès, S., Nordli, A., Olstad, A., Haugen, K., Koester, U., Olav, M.P., Teistklub, G., Reistad, A., 2007. Omya Hustadmarmor optimizes its supply chain for delivering calcium carbonate slurry to European paper manufacturers. Interfaces 37, 39-51.
17. Mercer, A., Tao, X., 1996. Alternative inventory and distribution policies of a food manufacturer. Journal of the Operational Research Society 47, 755-765.
18. Miller, C.E., Tucker, A., Zemlin, R., 1960. Integer programming formulation of travelling salesman problems. Journal of the ACM 3, 326-329.
19. Padberg, M., Rinaldi, G., 1991. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33, 60-100.
20. Pochet, Y., Wolsey, L., 2006. Production Planning by Mixed Integer Programming. Springer Series in Operations Research and Financial Engineering. Springer, New York.
21. Ralphs, T., Kopman, L., Pulleyblank, W., Trotter, L., 2003. On the capacitated vehicle routing problem. Mathematical Programmming 94, 343-359.
22. Solyali 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, 335-345.