Cyclic delivery schedules for an inventory routing problem
dc.contributor.author | Ekici, Ali | |
dc.contributor.author | Özener, Okan Örsan | |
dc.contributor.author | Kuyzu, G. | |
dc.date.accessioned | 2015-12-04T09:19:39Z | |
dc.date.available | 2015-12-04T09:19:39Z | |
dc.date.issued | 2015-11 | |
dc.identifier.issn | 1526-5447 | |
dc.identifier.uri | http://pubsonline.informs.org/doi/abs/10.1287/trsc.2014.0538 | |
dc.identifier.uri | http://hdl.handle.net/10679/1248 | |
dc.description | Due to copyright restrictions, the access to the full text of this article is only available via subscription. | en_US |
dc.description.abstract | We consider an inventory routing problem where a common vendor is responsible for replenishing the inventories of several customers over a perpetual time horizon. The objective of the vendor is to minimize the total cost of transportation of a single product from a single depot to a set of customers with deterministic and stationary consumption rates over a planning horizon while avoiding stock-outs at the customer locations. We focus on constructing a repeatable (cyclic) delivery schedule for the product delivery. We propose a novel algorithm, called the Iterative Clustering-Based Constructive Heuristic Algorithm, to solve the problem in two stages: (i) clustering, and (ii) delivery schedule generation. To test the performance of the proposed algorithm in terms of solution quality and computational efficiency, we perform a computational study on both randomly generated instances and real-life instances provided by an industrial gases manufacturer. We also compare the performance of the proposed algorithm against an algorithm developed for general routing problems. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Informs | en_US |
dc.relation.ispartof | Transportation Science | |
dc.rights | restrictedAccess | |
dc.title | Cyclic delivery schedules for an inventory routing problem | en_US |
dc.type | Article | en_US |
dc.peerreviewed | yes | en_US |
dc.publicationstatus | published | en_US |
dc.contributor.department | Özyeğin University | |
dc.contributor.authorID | (ORCID 0000-0002-9627-4780 & YÖK ID 124801) Ekici, Ali | |
dc.contributor.authorID | (ORCID 0000-0002-9291-1877 & YÖK ID 21945) Özener, Örsan | |
dc.contributor.ozuauthor | Ekici, Ali | |
dc.contributor.ozuauthor | Özener, Okan Örsan | |
dc.identifier.volume | 49 | |
dc.identifier.issue | 4 | |
dc.identifier.startpage | 817 | |
dc.identifier.endpage | 829 | |
dc.identifier.wos | WOS:000365048900008 | |
dc.identifier.doi | 10.1287/trsc.2014.0538 | |
dc.subject.keywords | Inventory routing problem | en_US |
dc.subject.keywords | Iterative clustering | en_US |
dc.subject.keywords | Cyclic delivery schedules | en_US |
dc.subject.keywords | Heuristic algorithm | en_US |
dc.identifier.scopus | SCOPUS:2-s2.0-84946012734 | |
dc.contributor.authorMale | 2 |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
Share this page