Integrated Inventory Routing Problem with Quality Time Windows and Loading Cost for Deteriorating Items under Discrete Time
Tao Jia,
Xiaofan Li,
Nengmin Wang and
Ran Li
Mathematical Problems in Engineering, 2014, vol. 2014, 1-14
Abstract:
We investigate an integrated inventory routing problem (IRP) in which one supplier with limited production capacity distributes a single item to a set of retailers using homogeneous vehicles. In the objective function we consider a loading cost which is often neglected in previous research. Considering the deterioration in the products, we set a soft time window during the transportation stage and a hard time window during the sales stage, and to prevent jams and waiting cost, the time interval of two successive vehicles returning to the supplier’s facilities is required not to be overly short. Combining all of these factors, a two-echelon supply chain mixed integer programming model under discrete time is proposed, and a two-phase algorithm is developed. The first phase uses tabu search to obtain the retailers’ ordering matrix. The second phase is to generate production scheduling and distribution routing, adopting a saving algorithm and a neighbourhood search, respectively. Computational experiments are conducted to illustrate the effectiveness of the proposed model and algorithm.
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/537409.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/537409.xml (text/xml)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:537409
DOI: 10.1155/2014/537409
Access Statistics for this article
More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().