An Effective Matheuristic for the Multivehicle Inventory Routing Problem
An Effective Matheuristic for the Multivehicle Inventory Routing Problem
About this item
Full title
Author / Creator
Publisher
Baltimore: INFORMS
Journal title
Language
English
Formats
Publication information
Publisher
Baltimore: INFORMS
Subjects
More information
Scope and Contents
Contents
This study considers the multivehicle inventory routing problem in which a supplier has to build a distribution plan over a discrete time horizon to replenish a set of customers that faces a given demand. Transportation costs as well as inventory costs at the supplier and at the customers are to be minimized. A matheuristic algorithm is proposed th...
Alternative Titles
Full title
An Effective Matheuristic for the Multivehicle Inventory Routing Problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2694491556
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2694491556
Other Identifiers
ISSN
0041-1655
E-ISSN
1526-5447
DOI
10.1287/trsc.2021.1123
