Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2018, Article ID 7235048, 10 pages
https://doi.org/10.1155/2018/7235048
Research Article

Application of Hierarchical Facility Location-Routing Problem with Optimization of an Underground Logistic System: A Case Study in China

College of Science, Northwest A&F University, Yangling, Shaanxi Province, China

Correspondence should be addressed to Yanghui Wu; moc.liamtoh@hywaxxs

Received 30 May 2018; Revised 20 August 2018; Accepted 10 September 2018; Published 26 September 2018

Academic Editor: Liang Jing

Copyright © 2018 Yingpeng Hu 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. M. A. Zu-Jun, Urban Underground Logistics System and its Design, Logistics Technology, 2004.
  2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, Calif, USA, 1979. View at MathSciNet
  3. G. Laporte and Y. Nobert, “An exact algorithm for minimizing routing and operating costs in depot location,” European Journal of Operational Research, vol. 6, no. 2, pp. 224–226, 1981. View at Publisher · View at Google Scholar · View at Scopus
  4. K. Holmberg, “Exact solution methods for uncapacitated location problems with convex transportation costs,” European Journal of Operational Research, vol. 114, no. 1, pp. 127–140, 1999. View at Publisher · View at Google Scholar · View at Scopus
  5. T. Wu, C. Low, and J. Bai, “Heuristic solutions to multi-depot location-routing problems,” Computers & Operations Research, vol. 29, no. 10, pp. 1393–1415, 2002. View at Publisher · View at Google Scholar · View at Scopus
  6. C. H. Aikens, “Facility location models for distribution planning,” European Journal of Operational Research, vol. 22, no. 3, pp. 263–279, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. S. H. Owen and M. S. Daskin, “Strategic facility location: a review,” European Journal of Operational Research, vol. 111, no. 3, pp. 423–447, 1998. View at Publisher · View at Google Scholar · View at Scopus
  8. S. J. Erlebacher and R. D. Meller, “The interaction of location and inventory in designing distribution systems,” IIE Transactions, vol. 32, no. 2, pp. 155–166, 2000. View at Google Scholar · View at Scopus
  9. M. Basti and M. Sevkli, An artificial bee colony algorithm for the p-median facility location problem, vol. 4(4 1), 2015.
  10. F. Wang, D. Xu, and C. Wu, “Approximation algorithms for the robust facility location problem with penalties,” in Advances in global optimization, vol. 95 of Springer Proc. Math. Stat., pp. 129–135, Springer, Cham, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  11. T. H. Tran, M. P. Scaparra, and J. . O'Hanley, “A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem,” European Journal of Operational Research, vol. 263, no. 1, pp. 173–187, 2017. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. G. Clarke and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, vol. 12, no. 4, pp. 568–581, 1964. View at Publisher · View at Google Scholar
  13. B. Gillett and L. Miller, “A heuristic algorithm for the vehicle dispatch problem,” Operations Research, vol. 22, no. 2, pp. 340–350, 1974. View at Publisher · View at Google Scholar
  14. T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “A unified solution framework for multi-attribute vehicle routing problems,” European Journal of Operational Research, vol. 234, no. 3, pp. 658–673, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. M. Lai and X. Tong, “A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search,” Journal of Industrial and Management Optimization, vol. 8, no. 2, pp. 469–484, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. “Vehicle routing: methods and studies,” Studies in Management Science and Systems, vol. 16, 1988. View at MathSciNet
  17. D. Tuzun and L. I. Burke, “Two-phase tabu search approach to the location routing problem,” European Journal of Operational Research, vol. 116, no. 1, pp. 87–99, 1999. View at Publisher · View at Google Scholar · View at Scopus
  18. G. Laporte, “Fifty years of vehicle routing,” Transportation Science, vol. 43, no. 4, pp. 408–416, 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. H. Toro-Díaz, “Joint location and dispatching decisions for Emergency Medical Services,” Computers & Industrial Engineering, vol. 64, no. 4, pp. 917–928, 2013. View at Publisher · View at Google Scholar
  20. S. Gao, Y. Wang, J. Cheng, Y. Inazumi, and Z. Tang, “Ant colony optimization with clustering for solving the dynamic location routing problem,” Applied Mathematics and Computation, vol. 285, pp. 149–173, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. A. M. Caunhye, Y. Zhang, M. Li, and X. Nie, “A location-routing model for prepositioning and distributing emergency supplies,” Transportation Research Part E: Logistics and Transportation Review, vol. 90, pp. 161–176, 2016. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Chan, W. B. Carter, and M. D. Burnes, “A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands,” Computers & Operations Research, vol. 28, no. 8, pp. 803–826, 2001. View at Publisher · View at Google Scholar · View at Scopus
  23. Y. Zhu, J. Zhang, and K. Partel, “Location-aided routing with uncertainty in mobile ad hoc networks: A stochastic semidefinite programming approach,” Mathematical and Computer Modelling, vol. 53, no. 11-12, pp. 2192–2203, 2011. View at Publisher · View at Google Scholar · View at Scopus
  24. Y. Marinakis, “An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands,” Applied Soft Computing, vol. 37, pp. 680–701, 2015. View at Publisher · View at Google Scholar · View at Scopus
  25. J. C. Potts, T. D. Giddens, and S. B. Yadav, “The Development and Evaluation of an Improved Genetic Algorithm Based on Migration and Artificial Selection,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 24, no. 1, pp. 73–86, 1994. View at Publisher · View at Google Scholar · View at Scopus
  26. Y. I. Mei and A. L. Zhou, “Research on a logistics network planning model of the urban underground,” Journal of Transport Science Engineering, 2016. View at Google Scholar
  27. Data source: http://gmcm.seu.edu.cn/01/49/c12a329/page.htm.