A two-phase algorithm for the cyclic inventory routing problemAuthor-Name: Chitsaz, Masoud
Ali Divsalar and
European Journal of Operational Research, 2016, vol. 254, issue 2, 410-426
The Cyclic Inventory Routing Problem (CIRP) is concerned with finding a cyclic schedule for the distribution of a single product to a number of customers. The problem involves multiple vehicles that can be dispatched several times during their shift. Each customer has a local inventory capacity, a constant consumption rate and stockouts are not allowed. The goal is to compose multiple trips which serve all customers and minimize the combination of transportation, inventory and vehicle costs, in a cyclic distribution pattern. Each trip can have a different frequency in the vehicle schedule. This is an important aspect that makes this so called CIRP, with its non-linear non-convex objective function and a set of non-linear constraints, more complex than the basic Inventory Routing Problem (IRP).
Keywords: Cyclic inventory routing problem; Decomposition heuristic; Two-phase iterative algorithm; Saving-based routing heuristic; Infinite-time cyclic scheduling (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:254:y:2016:i:2:p:410-426
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Series data maintained by Dana Niculescu ().