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

Solving a Two-Stage Stochastic Capacitated Location-Allocation Problem with an Improved PSO in Emergency Logistics

College of Field Engineering, The PLA University of Science and Technology, Nanjing 210000, China

Correspondence should be addressed to Wanhong Zhu; moc.liamg@6102gnohnawuhz

Received 12 November 2016; Revised 12 March 2017; Accepted 23 March 2017; Published 31 May 2017

Academic Editor: Jorge Magalhaes-Mendes

Copyright © 2017 Ye Deng 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. L. Cooper, “Location-allocation problems,” Operations Research, vol. 11, pp. 331–343, 1963. View at Publisher · View at Google Scholar · View at MathSciNet
  2. R. Logendran and M. P. Terrell, “Uncapacitated plant location-allocation problems with price sensitive stochastic demands,” Computers & Operations Research, vol. 15, no. 2, pp. 189–198, 1991. View at Google Scholar
  3. E. Carrizosa, E. Conde, M. Muñoz-Marquez, and J. Puerto, “The generalized Weber problem with expected distances,” RAIRO—Operations Research, vol. 29, no. 29, pp. 35–57, 1995. View at Google Scholar
  4. E. Carrizosa and J. Puerto, “A note on the optimal positioning of service units,” Operations Research, vol. 46, no. 1, pp. 155-156, 1998. View at Google Scholar
  5. B. Liu, Theory and Practice of Uncertain Programming: Physica-Verlag, 2002. View at Publisher · View at Google Scholar
  6. B. Liu, “uncertainty theory,” Studies in Computational Intelligence, vol. 154, no. 3, pp. 1–79, 2015. View at Google Scholar
  7. J. Zhou and B. Liu, “New stochastic models for capacitated location-allocation problem,” Computers & Industrial Engineering, vol. 45, no. 1, pp. 115–125, 2003. View at Google Scholar
  8. J. Zhou and B. Liu, “Modeling capacitated locationallocation problem with fuzzy demands,” Computers & Industrial Engineering., vol. 53, no. 3, pp. 454–468, 2007. View at Google Scholar
  9. F. J. F. Silva and D. S. De La Figuera, “A capacitated facility location problem with constrained backlogging probabilities,” International Journal of Production Research, vol. 45, no. 21, pp. 5117–5134, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. B. H. Wang and H. E. Shi-Wei, “robust optimization model and algorithm for logistics center location and allocation under uncertain environment,” Journal of Transportation Systems Engineering & Information Technology, vol. 9, no. 2, pp. 69–74, 2009. View at Google Scholar
  11. Z. Yao, L. H. Lee, W. Jaruphongsa, V. Tan, and C. F. Hui, “Multi-source facility location-allocation and inventory problem,” European Journal of Operational Research, vol. 207, no. 2, pp. 750–762, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. M. Wen and R. Kang, “Some optimal models for facility location-allocation problem with random fuzzy demands,” Applied Soft Computing, vol. 11, no. 1, pp. 1202–1207, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. S. M. Mousavi and S. T. Niaki, “Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm,” Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 37, no. 7, pp. 5109–5119, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. N. Vidyarthi and S. Jayaswal, “Efficient solution of a class of location-allocation problems with stochastic demand and congestion,” Computers & Operations Research, vol. 48, no. 9, pp. 20–30, 2013. View at Google Scholar
  15. M. A. Pereira, L. C. Coelho, L. A. N. Lorena, and L. C. D. Souza, “A hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem,” Computers & Operations Research, vol. 57, pp. 51–59, 2015. View at Google Scholar
  16. M. Alizadeh, I. Mahdavi, S. Shiripour, and H. Asadi, “A nonlinear model for a capacitated location-allocation problem with bernoulli demand using sub-sources,” International Journal of Engineering, vol. 26, no. 9, pp. 1025–2495, 2012. View at Google Scholar
  17. M. Alizadeh, I. Mahdavi, N. Mahdavi-Amiri, and S. Shiripour, “A capacitated location-allocation problem with stochastic demands using sub-sources: an empirical study,” Applied Soft Computing Journal, vol. 34, article 2973, pp. 551–571, 2015. View at Publisher · View at Google Scholar · View at Scopus
  18. A. Klose, “An LP-based heuristic for two-stage capacitated facility location problems,” Journal of the Operational Research Society, vol. 50, no. 2, pp. 157–166, 1999. View at Google Scholar
  19. A. Marín and B. Pelegrín, “Applying Lagrangian relaxation to the resolution of two-stage location problems,” Annals of Operations Research, vol. 86, no. 1–6, pp. 179–198, 1999. View at Google Scholar
  20. Y. K. Liu and X. Zhu, “Capacitated fuzzy two-stage location-allocation problem,” International Journal of Innovative Computing Information & Control Ijicic, vol. 3, no. 4, pp. 987–999, 2007. View at Google Scholar
  21. G. A. Ghodsi, A Lagrangian Relaxation Approach to a Two-Stage Stochastic Facility Location Problem with Second-Stage Activation Cost, University of Waterloo, Ontario, Waterloo, Canada, 2012.
  22. A. Adibi and J. Razmi, “2-Stage stochastic programming approach for hub location problem under uncertainty: A case study of air network of Iran,” Journal of Air Transport Management, vol. 47, pp. 172–178, 2015. View at Publisher · View at Google Scholar · View at Scopus
  23. J.-P. Arnaout, “Ant colony optimization algorithm for the Euclidean location-allocation problem with unknown number of facilities,” Journal of Intelligent Manufacturing, vol. 24, no. 1, pp. 45–54, 2013. View at Publisher · View at Google Scholar · View at Scopus
  24. N. Megiddo and K. J. Supowit, “On the complexity of some common geometric location problems,” SIAM Journal on Computing, vol. 13, no. 1, pp. 182–196, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. N. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica, vol. 4, no. 4, pp. 373–395, 1984. View at Publisher · View at Google Scholar · View at MathSciNet
  26. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in proceeding of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, 1995.
  27. J. Ciurana, G. Arias, and T. Ozel, “Neural network modeling and particle swarm optimization (PSO) of process parameters in pulsed laser micromachining of hardened AISI H13 steel,” Materials & Manufacturing Processes, vol. 24, no. 3, pp. 358–368, 2009. View at Publisher · View at Google Scholar · View at Scopus
  28. B. Liu, L. Wang, and Y. Jin, “An effective PSO-based memetic algorithm for flow shop scheduling,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 37, no. 1, pp. 18–27, 2007. View at Publisher · View at Google Scholar · View at Scopus
  29. X. Li and J. Wang, “A steganographic method based upon JPEG and particle swarm optimization algorithm,” Information Sciences, vol. 177, no. 15, pp. 3099–3109, 2007. View at Publisher · View at Google Scholar · View at Scopus
  30. M. G. Omran, A. Salman, and A. P. Engelbrecht, “Dynamic clustering using particle swarm optimization with application in image segmentation,” Pattern Analysis and Applications, vol. 8, no. 4, pp. 332–344, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  31. N. Holden and A. A. Freitas, “A hybrid PSO/ACO algorithm for discovering classification rules in data mining,” Journal of Artificial Evolution & Applications, vol. 2008, Article ID 316145, 11 pages, 2008. View at Google Scholar
  32. R. C. Eberhart and Y. Shi, “Particle swarm optimization: developments, applications and resources,” in proceeding of the Transactions on Evolutionary Computation (IEEE '01), vol. 1, pp. 81–86.
  33. X. Li and A. P. Engelbrecht, “Particle swarm optimization: an introduction and its recent developments,” the 15th annual Conference Companion on Genetic and Evolutionary Computation, pp. 33–57, 2007. View at Google Scholar
  34. A. Ratnaweera, S. K. Halgamuge, and H. C. Watson, “Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 240–255, 2004. View at Publisher · View at Google Scholar · View at Scopus
  35. J. J. Liang and P. N. Suganthan, “Dynamic multi-swarm particle swarm optimizer,” in proceeding of Swarm Intelligence Symposium (sis '05), pp. 124–129, 2005.
  36. T. Yamaguchi and K. Yasuda, “Adaptive particle swarm optimization–self-coordinating mechanism with updating information,” in proceeding of the IEEE International Conference on Systems, Man and Cybernetics (SMC '06), pp. 2303–2308, twn, October 2006. View at Publisher · View at Google Scholar · View at Scopus
  37. W. Liao and J. Wang, “Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization,” in proceeding of the Second international conference on Advances in swarm intelligence (ICSI '11), pp. 859–871, Chongqing , China, June 12-15.
  38. D. Zhan, H. Lu, W. Hao, and D. Jin, “Improving particle swarm optimization: Using neighbor heuristic and Gaussian cloud learning,” Intelligent Data Analysis, vol. 20, no. 1, pp. 167–182, 2016. View at Publisher · View at Google Scholar · View at Scopus
  39. L. Deyi, M. Haijun, and S. Xuemei, “Membership cloud and membership cloud generator,” Computer Research & Development, vol. 32, no. 6, 1995. View at Google Scholar
  40. Z. Guangwei, H. Rui, L. Yu, L. Deyi, and C. Guisheng, “An evolutionary algorithm based on cloud model,” Chnises Journal of Computers, vol. 31, no. 7, 2008. View at Google Scholar
  41. B. Y. Shi and R. Eberhart, “A modified particle swarm optimizer,” in proceeding of the 1998 IEEE World Congress on Computational Intelligence, pp. 69–73, 1998.
  42. A. Carlisle and G. Dozier, “An off-the-shelf PSO,” in proceeding of the Workshop on Particle Swarm Optimization.