Exact Solution of the Multi-trip Inventory Routing Problem using a Pseudo-polynomial Model

Nuno Braga, Cláudio Alves, Rita Macedo

Abstract

In this paper, we address an inventory routing problem where a vehicle can perform more than one trip in a working day. This problem was denominated multi-trip vehicle routing problem. In this problem a set of customers with demand for the planning horizon must be satisfied by a supplier. The supplier, with a set of vehicles, delivers the demand using pre-calculated valid routes that define the schedule of the delivery of goods on the planning horizon. The problem is solved with a pseudo-polynomial network flow model that is solved exactly in a set of instances adapted from the literature. An extensive set of computational experiments on these instances were conducted varying a set of parameters of the model. The results obtained with this model show that it is possible to solve instances up to 50 customers and with 15 periods in a reasonable computational time.

References

  1. Al-Khayyal, F. and Hwang, S.-J. (2007). Inventory constrained maritime routing and scheduling for multicommodity liquid bulk, part i: Applications and model. European Journal of Operational Research, 176:106-130.
  2. Alonso, F., Alvarez, J. M., and Beasley, E. J. (2008). A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of the Operational Research Society, 59:963-76.
  3. Archetti, C., Bertazzi, L., Hertz, A., and Speranza, M. G. (2011). A hybrid heuristic for an inventory routing problem. INFORMS Journal on Computing, 24:101- 16.
  4. Archetti, C. and Speranza, M. G. (2016). The inventory routing problem: the value of integration. International Transactions in Operational Research, 23:393- 407.
  5. Azi, N., Gendreau, M., and Potvin, J.-Y. (2007). An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research, 178:755-66.
  6. Azi, N., Gendreau, M., and Potvin, J.-Y. (2010). An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research, 202:756-63.
  7. Bertazzi, L. and Speranza, M. G. (2013). Inventory routing problems with multiple customers. EURO Journal on Transportation and Logistics, 2:255-75.
  8. Brando, J. C. S. and Mercer, A. (1998). The multi-trip vehicle routing problem. Journal of the Operational Research Society, 49:799-805.
  9. Coelho, L. C., Cordeau, J.-F., and Laporte, G. (2014). Thirty years of inventory routing. Transportation Science, 48:1-19.
  10. Coelho, L. C. and Laporte, G. (2013). A branch-and-cut algorithm for the multi-product multi-vehicle inventoryrouting problem. International Journal of Production Research, 51:7156-69.
  11. Cordeau, J.-F., Lagan, D., Musmanno, R., and Vocaturo, F. (2015). A decomposition-based heuristic for the multiple-product inventory-routing problem. Computers & Operations Research, 55:153-66.
  12. S¸en, A. and Blbl, K. (Universidade Bilgi, Istambul, Turquia, 2008). A survey on multi trip vehicle routing problem.
  13. Dauzère-Pérès, S., Nordli, A., Olstad, A., Haugen, K., Koester, U., Per Olav, M., Teistklub, G., and Reistad, A. (2007). Omya hustadmarmor optimizes its supply chain for delivering calcium carbonate slurry to european paper manufacturers. Interfaces, 37:39-51.
  14. Grnhaug, R., Christiansen, M., Desaulniers, G., and Desrosiers, J. (2010). A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Science, 44:400-415.
  15. Hanczar, P. (2012). A fuel distribution problem application of new multi-item inventory routing formulation. Procedia - Social and Behavioral Sciences, 54:726-735.
  16. Hemmati, A., Stlhane, M., Hvattum, L. M., and Andersson, H. (2015). An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping. Computers & Operations Research, 64:274-82.
  17. Herer, Y. T. and Levy, R. (1997). Raising the competitive edge in manufacturingthe metered inventory routing problem, an integrative heuristic algorithm. International Journal of Production Economics, 51:69-81.
  18. Macedo, R., Alves, C., Valrio de Carvalho, J., Clautiaux, F., and Hanafi, S. (2011). Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. European Journal of Operational Research, 214:536-45.
  19. Miller, D. M. (1987). An interactive, computer-aided ship scheduling system. European Journal of Operational Research, 32:363-379.
  20. Moin, N., Salhi, S., and Aziz, N. (2010). An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. International Journal of Production Economics, 133:334-343.
  21. Olivera, A. and Viera, O. (2007). Adaptive memory programming for the vehicle routing problem with multiple trips. Computers & Operations Research, 34:28- 47.
  22. Persson, J. A. and Göthe-Lundgren, M. (2005). Shipment planning at oil refineries using column generation and valid inequalities. European Journal of Operational Research, 163:631-652.
  23. Petch, R. J. and Salhi, S. (2003). A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics, 133:69-92.
  24. Salhi, S. and Petch, R. J. (2007). A ga based heuristic for the vehicle routing problem with multiple trips. Journal of Mathematical Modelling and Algorithms, 6:591-613.
  25. Song, J. H. and Furman, K. C. (2013). A maritime inventory routing problem: Practical approach. Computers & Operations Research, 40:657-665.
  26. Taillard, xc, ric, D., Laporte, G., and Gendreau, M. (1996). Vehicle routeing with multiple use of vehicles. The Journal of the Operational Research Society, 47:1065-70.
  27. Yu, Y. G., Chen, H. X., and Chu, F. (2008). A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research, 189:1022-40.
  28. Zhong, Y. and Aghezzaf, E.-H. (2012). Modeling and solving the multi-period inventory routing problem with constant demand rates. Ghent University, Department of Industrial management.
Download


Paper Citation


in Harvard Style

Braga N., Alves C. and Macedo R. (2017). Exact Solution of the Multi-trip Inventory Routing Problem using a Pseudo-polynomial Model . In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 250-257. DOI: 10.5220/0006118502500257


in Bibtex Style

@conference{icores17,
author={Nuno Braga and Cláudio Alves and Rita Macedo},
title={Exact Solution of the Multi-trip Inventory Routing Problem using a Pseudo-polynomial Model},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={250-257},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006118502500257},
isbn={978-989-758-218-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Exact Solution of the Multi-trip Inventory Routing Problem using a Pseudo-polynomial Model
SN - 978-989-758-218-9
AU - Braga N.
AU - Alves C.
AU - Macedo R.
PY - 2017
SP - 250
EP - 257
DO - 10.5220/0006118502500257