Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2016, Article ID 3475369, 18 pages
http://dx.doi.org/10.1155/2016/3475369
Research Article

A Location-Inventory-Routing Problem in Forward and Reverse Logistics Network Design

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 & Efficiency Engineering, No. 28 Xianning Road, Xi’an, Shaanxi 710049, China

Received 1 February 2016; Revised 25 May 2016; Accepted 6 June 2016

Academic Editor: Gabriella Bretti

Copyright © 2016 Qunli Yuchi 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. A. A. Javid and N. Azad, “Incorporating location, routing and inventory decisions in supply chain network design,” Transportation Research, Part E: Logistics and Transportation Review, vol. 46, no. 5, pp. 582–597, 2010. View at Publisher · View at Google Scholar · View at Scopus
  2. S. C. Liu and S. B. Lee, “A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration,” International Journal of Advanced Manufacturing Technology, vol. 22, no. 11-12, pp. 941–950, 2003. View at Publisher · View at Google Scholar · View at Scopus
  3. S. Viswanathan and K. Mathur, “Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems,” Management Science, vol. 43, no. 3, pp. 294–312, 1997. View at Publisher · View at Google Scholar · View at Scopus
  4. Y. Zhang, M. Qi, L. Miao, and E. Liu, “Hybrid metaheuristic solutions to inventory location routing problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 70, no. 1, pp. 305–323, 2014. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Ambrosino and M. G. Scutella, “Distribution network design: new problems and related models,” European Journal of Operational Research, vol. 165, no. 3, pp. 610–624, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. Z.-J. M. Shen and L. Qi, “Incorporating inventory and routing costs in strategic location models,” European Journal of Operational Research, vol. 179, no. 2, pp. 372–389, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. W. J. Guerrero, C. Prodhon, N. Velasco, and C. A. Amaya, “A relax-and-price heuristic for the inventory-location-routing problem,” International Transactions in Operational Research, vol. 22, no. 1, pp. 129–148, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. V. Ravi, R. Shankar, and M. K. Tiwari, “Analyzing alternatives in reverse logistics for end-of-life computers: ANP and balanced scorecard approach,” Computers & Industrial Engineering, vol. 48, no. 2, pp. 327–356, 2005. View at Publisher · View at Google Scholar · View at Scopus
  9. B. Vahdani and M. Naderi-Beni, “A mathematical programming model for recycling network design under uncertainty: an interval-stochastic robust optimization model,” The International Journal of Advanced Manufacturing Technology, vol. 73, no. 5–8, pp. 1057–1071, 2014. View at Publisher · View at Google Scholar · View at Scopus
  10. C.-T. Chen, P.-F. Pai, and W.-Z. Hung, “An integrated methodology using linguistic PROMETHEE and maximum deviation method for third-party logistics supplier selection,” International Journal of Computational Intelligence Systems, vol. 3, no. 4, pp. 438–451, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. B. Vahdani, J. Razmi, and R. Tavakkoli-Moghaddam, “Fuzzy possibilistic modeling for closed loop recycling collection networks,” Environmental Modeling & Assessment, vol. 17, no. 6, pp. 623–637, 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. B. Vahdani, R. Tavakkoli-Moghaddam, and F. Jolai, “Reliable design of a logistics network under uncertainty: a fuzzy possibilistic-queuing model,” Applied Mathematical Modelling, vol. 37, no. 5, pp. 3254–3268, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. B. Vahdani and M. Mohammadi, “A bi-objective interval-stochastic robust optimization model for designing closed loop supply chain network with multi-priority queuing system,” International Journal of Production Economics, vol. 170, pp. 67–87, 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. K. Richter, “The EOQ repair and waste disposal model with variable setup numbers,” European Journal of Operational Research, vol. 95, no. 2, pp. 313–324, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. J. Shi, G. Zhang, and J. Sha, “Optimal production planning for a multi-product closed loop system with uncertain demand and return,” Computers & Operations Research, vol. 38, no. 3, pp. 641–650, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. E. E. Zachariadis and C. T. Kiranoudis, “A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries,” Expert Systems with Applications, vol. 38, no. 3, pp. 2717–2726, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. F. P. Goksal, I. Karaoglan, and F. Altiparmak, “A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery,” Computers & Industrial Engineering, vol. 65, no. 1, pp. 39–53, 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. H. Liu, Q. Zhang, and W. Wang, “Research on locationrouting problem of reverse logistics with grey recycling demands based on PSO,” Grey Systems: Theory and Application, vol. 1, no. 1, pp. 97–104, 2011. View at Publisher · View at Google Scholar
  19. V. F. Yu and S.-W. Lin, “Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery,” Applied Soft Computing, vol. 24, pp. 284–290, 2014. View at Publisher · View at Google Scholar · View at Scopus
  20. Z. Wang, D.-Q. Yao, and P. Huang, “A new location-inventory policy with reverse logistics applied to B2C e-markets of China,” International Journal of Production Economics, vol. 107, no. 2, pp. 350–363, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. Y. Li, M. Lu, and B. Liu, “A two-stage algorithm for the closed-loop location-inventory problem model considering returns in E-commerce,” Mathematical Problems in Engineering, vol. 2014, Article ID 260869, 9 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. Y. Li, H. Guo, L. Wang, and J. Fu, “A hybrid genetic-simulated annealing algorithm for the location-inventory- routing problem considering returns under E-supply chain environment,” The Scientific World Journal, vol. 2013, Article ID 125893, 10 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. D. P. Adler, V. Kumar, P. A. Ludewig, and J. W. Sutherland, “Comparing energy and other measures of environmental performance in the original manufacturing and remanufacturing of engine components,” in Proceedings of the ASME International Conference on Manufacturing Science and Engineering, pp. 851–860, October 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. J.-M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfler Calvo, “A branch-and-cut method for the capacitated location-routing problem,” Computers & Operations Research, vol. 38, no. 6, pp. 931–941, 2011. View at Publisher · View at Google Scholar · View at Scopus
  25. R. H. Teunter, “Economic ordering quantities for recoverable item inventory systems,” Naval Research Logistics, vol. 48, no. 6, pp. 484–495, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. F. Glover, “Future paths for integer programming and links to artificial intelligence,” Computers & Operations Research, vol. 13, no. 5, pp. 533–549, 1986. View at Publisher · View at Google Scholar · View at Scopus
  27. F. Glover, “Tabu search—part I,” ORSA Journal on Computing, vol. 1, no. 3, pp. 190–206, 1989. View at Publisher · View at Google Scholar
  28. D. Habet, “Tabu search to solve real-life combinatorial optimization problems: a case of study,” Foundations of Computational Intelligence, vol. 3, pp. 129–151, 2009. View at Google Scholar
  29. V. F. Yu, S.-W. Lin, W. Lee, and C.-J. Ting, “A simulated annealing heuristic for the capacitated location routing problem,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 288–299, 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis, “Approximate algorithms for the traveling salesperson problem,” in Proceedings of the IEEE Conference Record of 15th Annual Symposium on Switching and Automata Theory, pp. 33–42, October 1974. View at Publisher · View at Google Scholar
  31. C. Prins, C. Prodhon, and R. Wolfler-Calvo, “Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité,” MOSIM, vol. 4, no. 2, pp. 1115–1122, 2004. View at Google Scholar