Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2012 (2012), Article ID 393890, 25 pages
http://dx.doi.org/10.1155/2012/393890
Research Article

Exact and Heuristic Solutions to Minimize Total Waiting Time in the Blood Products Distribution Problem

1Department of Industrial Engineering, School of Engineering, Tarbiat Modares University, Tehran 14117-13114, Iran
2Hospital Management Research Center, Tehran University of Medical Sciences, Tehran 19697-14713, Iran

Received 18 October 2011; Revised 29 March 2012; Accepted 14 May 2012

Academic Editor: Silvano Martello

Copyright © 2012 Amir Salehipour and Mohammad Mehdi Sepehri. 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. D. Delen, M. Erraguntla, R. J. Mayer, and C. N. Wu, “Better management of blood supply-chain with GIS-based analytics,” Annals of Operations Research, vol. 185, no. 1, pp. 181–193, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Chapman and J. MacPherson, “Unlocking the essentials of effective blood inventory management,” Transfusion, vol. 47, no. 2, pp. 190–196, 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. E. Brodheim and G. P. Prastacos, “The Long Island blood distribution system as a prototype for regional blood management,” Interfaces, vol. 9, no. 5, pp. 3–20, 1979. View at Publisher · View at Google Scholar
  4. G. P. Prastacos, “Blood inventory management: an overview of theory and practice,” Management Science, vol. 30, no. 7, pp. 777–800, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. C. Sapountzis, “Allocating blood to hospitals from a central blood bank,” European Journal of Operational Research, vol. 16, no. 2, pp. 157–162, 1984. View at Publisher · View at Google Scholar · View at Scopus
  6. S. L. Sime, “Strengthening the service continuum between transfusion providers and suppliers: enhancing the blood services network,” Transfusion, vol. 45, no. 4, pp. 206–223, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. J. S. Rytila and K. M. Spens, “Using simulation to increase efficiency in blood supply chains,” Management Research News, vol. 29, no. 12, pp. 801–819, 2006. View at Publisher · View at Google Scholar
  8. K. Katsaliaki, “Cost-effective practices in the blood service sector,” Health Policy, vol. 86, no. 2-3, pp. 276–287, 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. K. Katsaliaki and S. C. Brailsford, “Using simulation to improve the blood supply chain,” Journal of the Operational Research Society, vol. 58, no. 2, pp. 219–227, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. V. Hemmelmayr, K. F. Doerner, R. F. Hartl, and M. W. P. Savelsbergh, “Delivery strategies for blood products supplies,” OR Spectrum, vol. 31, no. 4, pp. 707–725, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. N. Rego and J. P. Sousa, “Supporting the definition of strategies for the configuration of health care supply chains,” in Logistik Management Systeme, Methoden, Integration, S. Voß, J. Pahl, and S. Schwarze, Eds., Springer, 2009. View at Google Scholar
  12. S. Sahni and T. Gonzalez, “P-complete approximation problems,” Journal of the Association for Computing Machinery, vol. 23, no. 3, pp. 555–565, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. L. Bianco, A. Mingozzi, and S. Ricciardelli, “The traveling salesman problem with cumulative costs,” Networks, vol. 23, no. 2, pp. 81–91, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. A. Salehipour and M. M. Sepehri, “A new mixed-integer programming formulation for locating workstations in tandem automated guided vehicle systems,” Working paper, Department of Industrial Engineering, Tarbiat Modares University, Tehran, Iran, 2010. View at Google Scholar
  15. M. Fischetti, G. Laporte, and S. Martello, “The delivery man problem and cumulative matroids,” Operations Research, vol. 41, no. 6, pp. 1055–1064, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. E. Eijl, “A polyhedral approach to the delivery man problem,” Memorandum COSOT 95, Eindhoven University of Technology, 1995. View at Google Scholar
  17. J. F. M. Sarubbi and H. P. L. Luna, “A flow formulation for the minimum latency problem,” in Proceedings of the International Network Optimization Conference (INOC '07), Spa, Belgium, April 2007.
  18. I. Mendez-Diaz, P. Zabala, and A. Lucena, “A new formulation for the traveling deliveryman problem,” Discrete Applied Mathematics, vol. 156, no. 17, pp. 3223–3237, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. D. Simchi-Levi and O. Berman, “Minimizing the total flow time of n jobs on a network,” IIE Transactions, vol. 23, no. 3, pp. 236–244, 1991. View at Publisher · View at Google Scholar
  20. G. Ghiani, G. Laporte, and R. Musmanno, Introduction to Logistics Systems Planning and Control, Wiley, 2004.
  21. T. A. Feo and M. G. C. Resende, “A probabilistic heuristic for a computationally difficult set covering problem,” Operations Research Letters, vol. 8, no. 2, pp. 67–71, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. T. A. Feo and M. G. C. Resende, “Greedy randomized adaptive search procedures,” Journal of Global Optimization, vol. 6, no. 2, pp. 109–133, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  23. P. Hansen and N. Mladenovic, “Variable neighborhood search for the p-median,” Location Science, vol. 5, pp. 207–226, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  24. P. Hansen and N. Mladenovic, “An introduction to variable neighborhood search,” in Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I. Osman, and C. Roucairol, Eds., pp. 433–458, Kluwer Academic, Boston, Mass, USA, 1999. View at Google Scholar · View at Zentralblatt MATH
  25. P. Hansen and N. Mladenovic, “Industrial applications of the variable neighborhood search metaheuristic,” in Decisions and Control in Management Science, pp. 261–274, Kluwer Academic, Boston, Mass, USA, 2001. View at Google Scholar
  26. P. Hansen and N. Mladenović, “Variable neighborhood search: principles and applications,” European Journal of Operational Research, vol. 130, no. 3, pp. 449–467, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  27. S. Kirkpatrick, J. C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  28. A. Salehipour, P. Goos, K. Sorensen, and O. Braysy, “The traveling repairman problem,” in Proceedings of the 21st Annual Conference of the Belgian Operational Research Society (ORBEL '83), Luxembourg, January 1983. View at Publisher · View at Google Scholar