Advanced search
Publication Cover
Journal of the Operational Research Society Volume 70, 2019 - Issue 6
Submit an article Journal homepage
388
Views
9
CrossRef citations to date
0
Altmetric
Original Articles

A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection

Romain MontagnéDepartment of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Canada.Correspondence[email protected]
,
Michel GamacheDepartment of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Canada.
&
Michel GendreauDepartment of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Canada.
Pages 986-997 | Received 30 Jun 2017, Accepted 11 May 2018, Published online: 12 Jun 2018

References

  • Aksen, D., Kaya, O., Salman, F. S., & Akça, Y. (2012). Selective and periodic inventory routing problem for waste vegetable oil collection. Optimization Letters, 6(6), 1063–1080.
  • Aksen, D., Kaya, O., Salman, F. S., & Tüncel, Ö. (2014). An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. European Journal of Operational Research, 239(2), 413–426.
  • 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.
  • 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.
  • Beasley, J. E. (1983). Route first--cluster second methods for vehicle routing. Omega, 11(4), 403–408.
  • Bertazzi, L., Paletta, G., & Speranza, M. G. (2002). Deterministic order-up-to level policies in an inventory routing problem. Transportation Science, 36(1), 119–132.
  • Boudia, M., Louly, M. A. O., & Prins, C. (2008). Fast heuristics for a combined production planning and vehicle routing problem. Production Planning and Control, 19(2), 85–96.
  • Campbell, A. M., & Savelsbergh, M. W. (2004). A decomposition approach for the inventory-routing problem. Transportation Science, 38(4), 488–502.
  • Coelho, L. C., Cordeau, J.-F., & Laporte, G. (2013). Thirty years of inventory routing. Transportation Science, 48(1), 1–19.
  • Prins, C., Lacomme, P., & Prodhon, C. (2014). Order-first split-second methods for vehicle routing problems: A review. Transportation Research Part C: Emerging Technologies, 40, 179–200.
  • Ramos, T. R. P., Gomes, M. I., & Barbosa-Póvoa, A. P. (2013). Planning waste cooking oil collection systems. Waste Management, 33(8), 1691–1703.
  • Takaoka, T. (1998). Shortest path algorithms for nearly acyclic directed graphs. Theoretical Computer Science, 203(1), 143–150.
  • Vidal, T. (2016). Technical note: Split algorithm in o(n) for the capacitated vehicle routing problem. Computers & Operations Research, 69, 40–47.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.