Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 537409, 14 pages
http://dx.doi.org/10.1155/2014/537409
Research Article

Integrated Inventory Routing Problem with Quality Time Windows and Loading Cost for Deteriorating Items under Discrete Time

Tao Jia,1,2 Xiaofan Li,1,2 Nengmin Wang,1,2 and Ran Li1,2

1School of Management, Xi’an JiaoTong University, No. 28 Xianning Road, Xi’an, Shaanxi 710049, China
2The Key Lab of the Ministry of Education for Process Control and Efficiency Engineering, No. 28 Xianning Road, Xi’an, Shaanxi 710049, China

Received 21 September 2013; Revised 26 November 2013; Accepted 26 November 2013; Published 29 January 2014

Academic Editor: Yunqiang Yin

Copyright © 2014 Tao Jia et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. F. Raafat, “Survey of literature on continuously deteriorating inventory models,” The Journal of the Operational Research Society, vol. 42, no. 1, pp. 27–37, 1991. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. L. J. S. Lukasse and J. J. Polderdijk, “Predictive modelling of post-harvest quality evolution in perishables, applied to mushrooms,” Journal of Food Engineering, vol. 59, no. 2-3, pp. 191–198, 2003. View at Publisher · View at Google Scholar · View at Scopus
  3. C.-I. Hsu, S.-F. Hung, and H.-C. Li, “Vehicle routing problem with time-windows for perishable food delivery,” Journal of Food Engineering, vol. 80, no. 2, pp. 465–475, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Rong, R. Akkerman, and M. Grunow, “An optimization approach for managing fresh food quality throughout the supply chain,” International Journal of Production Economics, vol. 131, no. 1, pp. 421–429, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. A. Federgruen and P. Zipkin, “A combined vehicle routing and inventory allocation problem,” Operations Research, vol. 32, no. 5, pp. 1019–1037, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. S. Anily and A. Federgruen, “One warehouse multiple retailer systems with vehicle routing costs,” Management Science, vol. 36, no. 1, pp. 92–114, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. A. J. Kleywegt, V. S. Nori, and M. W. P. Savelsbergh, “The stochastic inventory routing problem with direct deliveries,” Transportation Science, vol. 36, no. 1, pp. 94–118, 2002. View at Publisher · View at Google Scholar · View at Scopus
  8. E.-H. Aghezzaf, B. Raa, and H. Van Landeghem, “Modeling inventory routing problems in supply chains of high consumption products,” European Journal of Operational Research, vol. 169, no. 3, pp. 1048–1063, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. J. F. Bard and N. Nananukul, “Heuristics for a multiperiod inventory routing problem with production decisions,” Computers & Industrial Engineering, vol. 57, no. 3, pp. 713–723, 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. T. F. Abdelmaguid, M. M. Dessouky, and F. Ordóñez, “Heuristic approaches for the inventory-routing problem with backlogging,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1519–1534, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. M. Savelsbergh and J.-H. Song, “An optimization algorithm for the inventory routing problem with continuous moves,” Computers & Operations Research, vol. 35, no. 7, pp. 2266–2282, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. M. Ben-Daya, M. Darwish, and K. Ertogral, “The joint economic lot sizing problem: review and extensions,” European Journal of Operational Research, vol. 185, no. 2, pp. 726–742, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. L. Lei, S. Liu, A. Ruszczynski, and S. Park, “On the integrated production, inventory, and distribution routing problem,” IIE Transactions, vol. 38, no. 11, pp. 955–970, 2006. View at Publisher · View at Google Scholar · View at Scopus
  14. J. F. Bard and N. Nananukul, “A branch-and-price algorithm for an integrated production and inventory routing problem,” Computers & Operations Research, vol. 37, no. 12, pp. 2202–2217, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. J. Tang, J. Zhang, and Z. Pan, “A scatter search algorithm for solving vehicle routing problem with loading cost,” Expert Systems with Applications, vol. 37, no. 6, pp. 4073–4083, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. W. J. Bell, L. M. Dalberto, M. L. Fisher et al., “Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer,” Interfaces, vol. 13, no. 6, pp. 4–23, 1983. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. M. Savelsbergh and J.-H. Song, “Inventory routing with continuous moves,” Computers & Operations Research, vol. 34, no. 6, pp. 1744–1763, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. M. G. C. Resende and C. C. Ribeiro, “GRASP with path-relinking: recent advances and applications,” in Metaheuristics: Progress as Real Problem Solvers, vol. 32 of Operations Research/Computer Science Interfaces Series, pp. 29–63, Springer, New York, NY, USA, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. M. Boudia, M. A. O. Louly, and C. A. Prins, “A memetic algorithm with population management for a production-distribution problem,” Information Control Problems in Manufacturing, vol. 12, no. 1, pp. 541–546, 2006. View at Google Scholar
  20. M. Boudia, M. A. O. Louly, and C. Prins, “A reactive GRASP and path relinking for a combined production-distribution problem,” Computers & Operations Research, vol. 34, no. 11, pp. 3402–3419, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. N. H. Moin, S. Salhi, and N. A. B. Aziz, “An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem,” International Journal of Production Economics, vol. 133, no. 1, pp. 334–343, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Popović, M. Vidović, and G. Radivojević, “Variable neighborhood search heuristic for the Inventory Routing Problem in fuel delivery,” Expert Systems with Applications, vol. 39, no. 18, pp. 13390–13398, 2012. View at Google Scholar
  23. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, Mass, USA, 1997.
  24. A. E. Fallahi, C. Prins, and R. W. Calvo, “A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem,” Computers & Operations Research, vol. 35, no. 5, pp. 1725–1741, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  25. É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, “A tabu search heuristic for the vehicle routing problem with soft time windows,” Transportation Science, vol. 31, no. 2, pp. 170–186, 1997. View at Google Scholar · View at Scopus