Show simple item record

dc.contributor.authorLi, Kunpeng
dc.contributor.authorChen, Bin
dc.contributor.authorSivakumar, Appa Iyer
dc.contributor.authorWu, Yong
dc.date.accessioned2017-08-14T12:31:02Z
dc.date.available2017-08-14T12:31:02Z
dc.date.issued2014
dc.date.modified2013-10-30T03:49:16Z
dc.identifier.issn0377-2217
dc.identifier.doi10.1016/j.ejor.2013.07.034
dc.identifier.urihttp://hdl.handle.net/10072/53912
dc.description.abstractIn this paper, we consider an inventory-routing problem (IRP) in a large petroleum and petrochemical enterprise group. Compared to many other IRPs, the problem in this paper includes some special aspects due to the operational constraints, such as hours-of-service regulations of the company and the industry. Also, in some cases, it is more important to avoid stock out for any station, rather than purely focusing on transportation cost minimization. The objective is to minimize the maximum of the route travel time, which is not addressed in the literature so far. We present a tabu search algorithm to tackle the problem, which builds in an efficient and effective procedure to improve the search quality in each iteration. Moreover, lower bounds of reasonable sized problems, which are intractable in the formulated mathematical model by existing optimization software, are obtained via Lagrangian relaxation technique. Computational results indicate that the lower bounds are tight and the tabu search is capable of providing near optimal, close-to-lower-bound solutions in a computational time effective manner.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent500887 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoeng
dc.publisherElsevier
dc.publisher.placeNetherlands
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom936
dc.relation.ispartofpageto945
dc.relation.ispartofissue3
dc.relation.ispartofjournalEuropean Journal of Operational Research
dc.relation.ispartofvolume236
dc.rights.retentionY
dc.subject.fieldofresearchLogistics and Supply Chain Management
dc.subject.fieldofresearchcode150309
dc.titleAn inventory-routing problem with the objective of travel time minimization
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.rights.copyright© 2013 Elsevier. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.
gro.date.issued2013
gro.hasfulltextFull Text
gro.griffith.authorWu, Yong


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record