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

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

Hankuk University of Foreign Studies, Yongin 449791, Republic of Korea

Received 25 February 2015; Accepted 21 June 2015

Academic Editor: Emilio Insfran

Copyright © 2015 Ji Ung Sun. 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. I. Karaoglan, F. Altiparmak, I. Kara, and B. Dengiz, “The location-routing problem with simultaneous pickup and delivery: formulations and a heuristic approach,” Omega, vol. 40, no. 4, pp. 465–477, 2012. View at Publisher · View at Google Scholar · View at Scopus
  2. G. Nagy and S. Salhi, “Location-routing: issues, models and methods,” European Journal of Operational Research, vol. 177, no. 2, pp. 649–672, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. M. J. Kuby and R. G. Gray, “The hub network design problem with stopovers and feeders: the case of federal express,” Transportation Research Part A, vol. 27, no. 1, pp. 1–12, 1993. View at Publisher · View at Google Scholar · View at Scopus
  4. T. Aykin, “The hub location and routing problem,” European Journal of Operational Research, vol. 83, no. 1, pp. 200–219, 1995. View at Publisher · View at Google Scholar · View at Scopus
  5. G. Nagy and S. Salhi, “The many-to-many location-routing problem,” TOP, vol. 6, no. 2, pp. 261–275, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  6. A. Bruns, A. Klose, and P. Stähly, “Restructuring of Swiss parcel delivery services,” OR Spektrum, vol. 22, no. 2, pp. 285–302, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. M. Wasner and G. Zäpfel, “An integrated multi-depot hub-location vehicle routing model for network planning of parcel service,” International Journal of Production Economics, vol. 90, no. 3, pp. 403–419, 2004. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Çetiner, C. Sepil, and H. Süral, “Hubbing and routing in postal delivery systems,” Annals of Operations Research, vol. 181, no. 1, pp. 109–124, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. D. Catanzaro, E. Gourdin, M. Labbé, and F. A. Özsoy, “A branch-and-cut algorithm for the partitioning-hub location-routing problem,” Computers & Operations Research, vol. 38, no. 2, pp. 539–549, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. J. M. Nambiar, L. F. Gelders, and L. N. van Wassenhove, “A large scale location-allocation problem in the natural rubber industry,” European Journal of Operational Research, vol. 6, no. 2, pp. 183–189, 1981. View at Publisher · View at Google Scholar · View at Scopus
  11. I. M. Branco and J. D. Coelho, “The Hamiltonian p-median problem,” European Journal of Operational Research, vol. 47, no. 1, pp. 86–95, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. H. Min, “Consolidation terminal location-allocation and consolidated routing problems,” Journal of Business Logistics, vol. 17, no. 2, pp. 235–263, 1996. View at Google Scholar
  13. A. Billionnet, S. Elloumi, and L. Grouz-Djerbi, “Designing radio-mobile access networks based on synchronous digital hierarchy rings,” Computers and Operations Research, vol. 32, no. 2, pp. 379–394, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. J. Perl and M. S. Daskin, “A warehouse location-routing problem,” Transportation Research Part B, vol. 19, no. 5, pp. 381–396, 1985. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Salhi and M. Fraser, “An integrated heuristic approach for the combined location vehicle fleet mix problem,” Studies in Locational Analysis, vol. 8, pp. 3–21, 1996. View at Google Scholar
  16. T.-H. Wu, C. Low, and J.-W. Bai, “Heuristic solutions to multi-depot location-routing problems,” Computers and Operations Research, vol. 29, no. 10, pp. 1393–1415, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. M. Schwardt and J. Dethloff, “Solving a continuous location-routing problem by use of a self-organizing map,” International Journal of Physical Distribution and Logistics Management, vol. 35, no. 6, pp. 390–408, 2005. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Albareda-Sambola, J. A. Diaz, and E. Fernández, “A compact model and tight bounds for a combined location-routing problem,” Computers & Operations Research, vol. 32, no. 3, pp. 407–428, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. J. Melechovský, C. Prins, and R. W. Calvo, “A metaheuristic to solve a location-routing problem with non-linear costs,” Journal of Heuristics, vol. 11, no. 5-6, pp. 375–391, 2005. View at Publisher · View at Google Scholar · View at Scopus
  20. J. Y. Kim, Y. Kim, and Y. K. Kim, “An endosymbiotic evolutionary algorithm for optimization,” Applied Intelligence, vol. 15, no. 2, pp. 117–130, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  21. Y. K. Kim, J. Y. Kim, and Y. Kim, “An endosymbiotic evolutionary algorithm for the integration of balancing and sequencing in mixed-model U-lines,” European Journal of Operational Research, vol. 168, no. 3, pp. 838–852, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. D. A. M. Rocha, E. F. G. Goldbarg, and M. C. Goldbarg, “A new evolutionary algorithm for the bi-objective minimum spanning tree,” in Proceedings of the 7th International Conference on Intelligent Systems Design and Applications (ISDA '07), pp. 735–740, Rio de Janeiro, Brazil, October 2007. View at Publisher · View at Google Scholar · View at Scopus
  23. S. R. Yadav, A. Ghorpade, C. Mahajan, M. K. Tiwari, and R. Shankar, “Optimising a logistics system with multiple procurements and warehousing using endosymbiotic evolutionary algorithm,” International Journal of Logistics Systems and Management, vol. 5, no. 1-2, pp. 154–175, 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. K. S. Shin, J. H. Kim, and Y. K. Kim, “A two-leveled multi-objective symbiotic evolutionary algorithm for the hub and spoke location problem,” Journal of Advanced Transportation, vol. 43, no. 4, pp. 391–411, 2009. View at Publisher · View at Google Scholar · View at Scopus
  25. J. U. Sun, “An endosymbiotic evolutionary algorithm for designing hub and spoke network with asymmetric allocation,” Advanced Science Letters, vol. 20, no. 10–12, pp. 2152–2156, 2014. View at Publisher · View at Google Scholar · View at Scopus
  26. D. E. Moriarty and R. Miikkulainen, “Forming neural networks through efficient and adaptive coevolution,” Evolutionary Computation, vol. 5, no. 4, pp. 373–399, 1997. View at Publisher · View at Google Scholar · View at Scopus
  27. Y. K. Kim, K. Park, and J. Ko, “A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling,” Computers and Operations Research, vol. 30, no. 8, pp. 1151–1171, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. M. Gen and R. Cheng, Genetic Algorithms and Engineering Optimization, John Wiley & Sons, Hoboken, NJ, USA, 2000. View at Publisher · View at Google Scholar
  29. C.-J. Ting and C.-H. Chen, “A multiple ant colony optimization algorithm for the capacitated location routing problem,” International Journal of Production Economics, vol. 141, no. 1, pp. 34–44, 2013. View at Publisher · View at Google Scholar · View at Scopus