dc.contributor.authorLi, Kunpeng
dc.contributor.authorChen, Bin
dc.contributor.authorSivakumar, Appa Iyer
dc.contributor.authorWu, Yong
dc.identifier.citationLi, K., Chen, B., Sivakumar, A. I., & Wu, Y. (2013). An inventory–routing problem with the objective of travel time minimization. European journal of operational research, in press.en_US
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.en_US
dc.relation.ispartofseriesEuropean journal of operational researchen_US
dc.subjectDRNTU::Engineering::Mechanical engineering
dc.titleAn inventory routing problem with the objective of travel time minimizationen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Mechanical and Aerospace Engineeringen_US

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record