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

Variations in the Flow Approach to CFCLP-TC for Multiobjective Supply Chain Design

1School of Engineering, Polytechnic University of Tulancingo, Tulancingo 43629, Mexico
2School of Engineering, UPAEP University, Puebla 72410, Mexico

Received 18 October 2013; Accepted 25 December 2013; Published 13 March 2014

Academic Editor: Timothy I. Matis

Copyright © 2014 Minor P. Hertwin 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. T. Melo, S. Nickel, and F. Saldanha-da-Gama, “Facility location and supply chain management—a review,” European Journal of Operational Research, vol. 196, no. 2, pp. 401–412, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. E. Olivares Benitez, Capacitated fixed cost facility location problem with transportation choices [Ph.D. thesis], ITESM, 2007.
  3. E. Olivares-Benitez, J. L. González-Velarde, and R. Z. Ríos-Mercado, “A supply chain design problem with facility location and bi-objective transportation choices,” TOP, vol. 20, no. 3, pp. 729–753, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. F. Altiparmak, M. Gen, L. Lin, and T. Paksoy, “A genetic algorithm approach for multi-objective optimization of supply chain networks,” Computers & Industrial Engineering, vol. 51, no. 1, pp. 196–215, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. A. M. Geoffrion and R. F. Powers, “Twenty years of strategic distribution system design: an evolutionary perspective,” Interfaces, vol. 25, no. 5, pp. 105–127, 1995. View at Publisher · View at Google Scholar
  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 Zentralblatt MATH · View at MathSciNet
  7. C. S. Revelle and G. Laporte, “The plant location problem: new models and research prospects,” Operations Research, vol. 44, no. 6, pp. 864–874, 1996. View at Google Scholar · View at Scopus
  8. J. A. Díaz and E. Fernández, “Hybrid scatter search and path relinking for the capacitated p-median problem,” European Journal of Operational Research, vol. 169, no. 2, pp. 570–585, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  9. N. Mladenović, J. Brimberg, P. Hansen, and J. A. Moreno-Pérez, “The p-median problem: a survey of metaheuristic approaches,” European Journal of Operational Research, vol. 179, no. 3, pp. 927–939, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  10. M. Baïou and F. Barahona, “On the p-median polytope of Y-free graphs,” Discrete Optimization, vol. 5, no. 2, pp. 205–219, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  11. B. Goldengorin and D. Krushinsky, “Complexity evaluation of benchmark instances for the p-median problem,” Mathematical and Computer Modelling, vol. 53, no. 9-10, pp. 1719–1736, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  12. M. Sun, “Solving the uncapacitated facility location problem using tabu search,” Computers & Operations Research, vol. 33, no. 9, pp. 2563–2589, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. I. Averbakh, O. Berman, Z. Drezner, and G. O. Wesolowsky, “The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation,” European Journal of Operational Research, vol. 179, no. 3, pp. 956–967, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. H.-C. Huang and R. Li, “A k-product uncapacitated facility location problem,” European Journal of Operational Research, vol. 185, no. 2, pp. 552–562, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  15. A. Klose and A. Drexl, “Facility location models for distribution system design,” European Journal of Operational Research, vol. 162, no. 1, pp. 4–29, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. C.-H. Chen and C.-J. Ting, “Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem,” Transportation Research E, vol. 44, no. 6, pp. 1099–1122, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. L. Lin, M. Gen, and X. Wang, “Integrated multistage logistics network design by using hybrid evolutionary algorithm,” Computers & Industrial Engineering, vol. 56, no. 3, pp. 854–873, 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. 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 Zentralblatt MATH · View at MathSciNet
  19. İ. K. Altınel, E. Durmaz, N. Aras, and K. C. Özkısacık, “A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations,” European Journal of Operational Research, vol. 198, no. 3, pp. 790–799, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. K. E. Caggiano, P. L. Jackson, J. A. Muckstadt, and J. A. Rappold, “Efficient computation of time-based customer service levels in a multi-item, multi-echelon supply chain: a practical approach for inventory optimization,” European Journal of Operational Research, vol. 199, no. 3, pp. 744–749, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  21. A. Klose and S. Görtz, “A branch-and-price algorithm for the capacitated facility location problem,” European Journal of Operational Research, vol. 179, no. 3, pp. 1109–1125, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. A. A. Kuehn and M. J. Hamburger, “A heuristic program for locating warehouses,” Management Science, vol. 9, no. 4, pp. 643–666, 1963. View at Publisher · View at Google Scholar
  23. B. M. Khumawala, “An efficient heuristic procedure for the capacitated warehouse location problem,” Naval Research Logistics Quarterly, vol. 21, no. 4, pp. 609–623, 1974. View at Publisher · View at Google Scholar
  24. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, “Analysis of a local search heuristic for facility location problems,” in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '98), pp. 1–10, ACM, Philadelphia, Pa, USA, 1998.
  25. E. Rolland, D. A. Schilling, and J. R. Current, “An efficient tabu search procedure for the p-median problem,” European Journal of Operational Research, vol. 96, no. 2, pp. 329–342, 1997. View at Publisher · View at Google Scholar · View at Scopus
  26. H. Delmaire, J. A. Díaz, E. Fernández, and M. Ortega, “Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem,” INFOR Journal, vol. 37, no. 3, pp. 194–225, 1999. View at Google Scholar · View at Scopus
  27. T. L. Magnanti and R. T. Wong, “Accelerating benders decomposition: algorithmic enhancement and model selection criteria,” Operations Research, vol. 29, no. 3, pp. 464–484, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. J. M. Y. Leung and T. L. Magnanti, “Valid inequalities and facets of the capacitated plant location problem,” Mathematical Programming, vol. 44, no. 1–3, pp. 271–291, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. K. Aardal, “Capacitated facility location: separation algorithms and computational experience,” Mathematical Programming, vol. 81, no. 2, pp. 149–175, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. G. Laporte, F. V. Louveaux, and L. van Hamme, “Exact solution of a stochastic location problem by an integer L-shaped algorithm,” Transportation Science, vol. 28, no. 2, pp. 95–103, 1994. View at Google Scholar
  31. S. Tragantalerngsak, J. Holt, and M. Rönnqvist, “Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem,” European Journal of Operational Research, vol. 102, no. 3, pp. 611–625, 1997. View at Publisher · View at Google Scholar · View at Scopus
  32. L. A. Moncayo-Martínez and Z. Z. David, “Optimising safety stock placement and lead time in a assembly supply chain using bi-objetive MAX-MIN ant system,” International Journal of Production Economics, vol. 145, no. 1, pp. 18–28, 2013. View at Publisher · View at Google Scholar
  33. W.-C. Yeh and M.-C. Chuang, “Using multi-objective genetic algorithm for partner selection in green supply chain problems,” Expert Systems with Applications, vol. 38, no. 4, pp. 4244–4253, 2011. View at Publisher · View at Google Scholar · View at Scopus
  34. R. Rajesh, S. Pugazhendhi, and K. Ganesh, “Simulated annealing algorithm for balanced allocation problem,” The International Journal of Advanced Manufacturing Technology, vol. 61, no. 5–8, pp. 431–440, 2011. View at Publisher · View at Google Scholar · View at Scopus
  35. G. C. Cabrera Guillermo, E. Cabrera, R. Soto, L. J. M. Rubio, B. Crawford, and F. Paredes, “A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem,” Mathematical Problems in Engineering, vol. 2012, Article ID 954249, 14 pages, 2012. View at Publisher · View at Google Scholar
  36. Y.-S. Myung, H.-G. Kim, and D.-W. Tcha, “A bi-objective uncapacitated facility location problem,” European Journal of Operational Research, vol. 100, no. 3, pp. 608–616, 1997. View at Publisher · View at Google Scholar · View at Scopus
  37. J. G. Villegas, F. Palacios, and A. L. Medaglia, “Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example,” Annals of Operations Research, vol. 147, no. 1, pp. 109–141, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  38. R. D. Galvão, L. G. A. Espejo, B. Boffey, and D. Yates, “Load balancing and capacity constraints in a hierarchical location model,” European Journal of Operational Research, vol. 172, no. 2, pp. 631–646, 2006. View at Publisher · View at Google Scholar · View at Scopus
  39. M. da Graça Costa, M. E. Captivo, and J. Clímaco, “Capacitated single allocation hub location problem—a bi-criteria approach,” Computers & Operations Research, vol. 35, no. 11, pp. 3671–3695, 2008. View at Publisher · View at Google Scholar · View at Scopus
  40. C. C. Bozarth, D. P. Warsing, B. B. Flynn, and E. J. Flynn, “The impact of supply chain complexity on manufacturing plant performance,” Journal of Operations Management, vol. 27, no. 1, pp. 78–93, 2009. View at Publisher · View at Google Scholar · View at Scopus
  41. J. Mula, D. Peidro, M. Díaz-Madroñero, and E. Vicens, “Mathematical programming models for supply chain production and transport planning,” European Journal of Operational Research, vol. 204, no. 3, pp. 377–390, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  42. H. Lidestam and M. Rönnqvist, “Use of Lagrangian decomposition in supply chain planning,” Mathematical and Computer Modelling, vol. 54, no. 9-10, pp. 2428–2442, 2011. View at Publisher · View at Google Scholar · View at Scopus
  43. M. Gen, F. Altiparmak, and L. Lin, “A genetic algorithm for two-stage transportation problem using priority-based encoding,” OR Spectrum, vol. 28, no. 3, pp. 337–354, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  44. X. Li, L. Amodeo, F. Yaloui, and H. Chehade, “A multiobjetive optimization approach to solve parallel machines scheduling problem,” Advances in Artificial Intelligence, vol. 2010, Article ID 943050, 10 pages, 2010. View at Publisher · View at Google Scholar
  45. H. Xing and R. Qu, “A nondominated sorting genetic algorithm for bi-objetive network coding based multicast routing problems,” Information Sciences, vol. 233, pp. 36–53, 2013. View at Publisher · View at Google Scholar