{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:34:53Z","timestamp":1759667693512,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030532611"},{"type":"electronic","value":"9783030532628"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53262-8_23","type":"book-chapter","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:12:23Z","timestamp":1595373143000},"page":"273-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Matheuristic for the Inventory Routing Problem"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Diniz","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Martinelli","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Poggi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/ijoc.2013.0550","volume":"26","author":"Y Adulyasak","year":"2013","unstructured":"Adulyasak, Y., Cordeau, J.F., Jans, R.: Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J. Comput. 26(1), 103\u2013120 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1111\/itor.12547","volume":"25","author":"A Alvarez","year":"2018","unstructured":"Alvarez, A., Munari, P., Morabito, R.: Iterated local search and simulated annealing algorithms for the inventory routing problem. Int. Trans. Oper. Res. 25(6), 1785\u20131809 (2018)","journal-title":"Int. Trans. Oper. Res."},{"key":"23_CR3","unstructured":"Archetti, C., Guastaroba, G., Huerta-Mu\u00f1oz, D., Speranza, M.: A kernel search heuristic for the multi-vehicle inventory routing problem (2019). http:\/\/or-brescia.unibs.it\/instances"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/ijoc.1100.0439","volume":"24","author":"C Archetti","year":"2012","unstructured":"Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G.: A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24(1), 101\u2013116 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1287\/trsc.1060.0188","volume":"41","author":"C Archetti","year":"2007","unstructured":"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), 382\u2013391 (2007)","journal-title":"Transp. Sci."},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1111\/itor.12076","volume":"21","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Bianchessi, N., Irnich, S., Speranza, M.G.: Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21(3), 353\u2013374 (2014)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1287\/ijoc.2016.0737","volume":"29","author":"C Archetti","year":"2017","unstructured":"Archetti, C., Boland, N., Speranza, M.G.: A matheuristic for the multivehicle inventory routing problem. INFORMS J. Comput. 29(3), 377\u2013387 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/trsc.2016.0729","volume":"52","author":"P Avella","year":"2018","unstructured":"Avella, P., Boccia, M., Wolsey, L.A.: Single-period cutting planes for inventory routing problems. Transp. Sci. 52(3), 497\u2013508 (2018)","journal-title":"Transp. Sci."},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.36.1.119.573","volume":"36","author":"L Bertazzi","year":"2002","unstructured":"Bertazzi, L., Paletta, G., Speranza, M.G.: Deterministic order-up-to level policies in an inventory routing problem. Transp. Sci. 36(1), 119\u2013132 (2002)","journal-title":"Transp. Sci."},{"key":"23_CR10","series-title":"Centre for Research on Transportation","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-1-4615-5755-5_4","volume-title":"Fleet Management and Logistics","author":"A Campbell","year":"1998","unstructured":"Campbell, A., Clarke, L., Kleywegt, A., Savelsbergh, M.: The inventory routing problem. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics. CRT, pp. 95\u2013113. Springer, Boston, MA (1998). https:\/\/doi.org\/10.1007\/978-1-4615-5755-5_4"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1287\/ijoc.2018.0817","volume":"31","author":"M Chitsaz","year":"2019","unstructured":"Chitsaz, M., Cordeau, J.F., Jans, R.: A unified decomposition matheuristic for assembly, production, and inventory routing. INFORMS J. Comput. 31(1), 134\u2013152 (2019)","journal-title":"INFORMS J. Comput."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.trc.2012.03.007","volume":"24","author":"LC Coelho","year":"2012","unstructured":"Coelho, L.C., Cordeau, J.F., Laporte, G.: Consistency in multi-vehicle inventory-routing. Transp. Res. Part C: Emerg. Technol. 24, 270\u2013287 (2012)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"issue":"11","key":"23_CR13","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.cor.2011.12.020","volume":"39","author":"LC Coelho","year":"2012","unstructured":"Coelho, L.C., Cordeau, J.F., Laporte, G.: The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11), 2537\u20132548 (2012)","journal-title":"Comput. Oper. Res."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.ijpe.2013.11.019","volume":"155","author":"LC Coelho","year":"2014","unstructured":"Coelho, L.C., Laporte, G.: Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int. J. Prod. Econ. 155, 391\u2013397 (2014)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"WH Cunningham","year":"1976","unstructured":"Cunningham, W.H.: A network simplex method. Math. Program. 11(1), 105\u2013116 (1976)","journal-title":"Math. Program."},{"issue":"3","key":"23_CR16","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1287\/trsc.2015.0635","volume":"50","author":"G Desaulniers","year":"2015","unstructured":"Desaulniers, G., Rakke, J.G., Coelho, L.C.: A branch-price-and-cut algorithm for the inventory-routing problem. Transp. Sci. 50(3), 1060\u20131076 (2015)","journal-title":"Transp. Sci."},{"issue":"5","key":"23_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","volume":"264","author":"B Dezs\u0151","year":"2011","unstructured":"Dezs\u0151, B., J\u00fcttner, A., Kov\u00e1cs, P.: LEMON - an open source C++ graph template library. Electron. Notes Theor. Comput. Sci. 264(5), 23\u201345 (2011)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"23_CR18","unstructured":"Huerta-Mu\u00f1oz, D., Archetti, C., Guastaroba, G., Speranza, M.: A kernel search for the inventory routing problem (2019). http:\/\/redloca.ulpgc.es\/images\/workshop\/2019\/Slides_2019\/Huerta_Munoz.pdf"},{"key":"23_CR19","unstructured":"Orlin, J.B.: A polynomial-time parametric simplex algorithm for the minimum cost network flow problem. Working papers 1484-83. Massachusetts Institute of Technology (MIT), Sloan School of Management (1983)"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.ijpe.2017.09.002","volume":"193","author":"IT Peres","year":"2017","unstructured":"Peres, I.T., Repolho, H.M., Martinelli, R., Monteiro, N.J.: Optimization in inventory-routing problem with planned transshipment: a case study in the retail industry. Int. J. Prod. Econ. 193, 748\u2013756 (2017)","journal-title":"Int. J. Prod. Econ."},{"issue":"4","key":"23_CR21","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.endm.2016.03.026","volume":"52","author":"E Santos","year":"2016","unstructured":"Santos, E., Ochi, L.S., Simonetti, L., Gonz\u00e1lez, P.H.: A hybrid heuristic based on iterated local search for multivehicle inventory routing problem. Electron. Notes Discret. Math. 52, 197\u2013204 (2016)","journal-title":"Electron. Notes Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53262-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:09:28Z","timestamp":1710266968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-53262-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532611","9783030532628"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53262-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lamsade.dauphine.fr\/~isco\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Symposia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.26","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.85","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}