Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30172
Transportation Under the Threat of Influenza

Authors: Yujun Zheng, Qin Song, Haihe Shi, and Jinyun Xue

Abstract:

There are a number of different cars for transferring hundreds of close contacts of swine influenza patients to hospital, and we need to carefully assign the passengers to those cars in order to minimize the risk of influenza spreading during transportation. The paper presents an approach to straightforward obtain the optimal solution of the relaxed problems, and develops two iterative improvement algorithms to effectively tackle the general problem.

Keywords: Influenza spread, discrete optimization, stationary point, iterative improvement

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1074641

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 804

References:


[1] S.G. Akl, "A comparison of combination generation methods", ACM Tran. Math. Soft., vol. 7, 1981, pp. 42-45.
[2] D.R. Baronaigien, F. Ruskey, "Efficient generation of subsets with a given sum", J. Combin. Math. Combin. Comput., vol. 14, 1993, pp. 87-96.
[3] S. Martello, P. Toth, "A mixture of dynamic programming and branchand- bound for the subset-sum problem", Management Sci., vol. 30, 1984, pp. 765-771.
[4] K. McCurley, "The discrete logarithm problem, In: Cryptology and Computational Number Theory", Proceedings of Symposia in Applied Mathematics, vol. 42, 1990, pp. 49-74.
[5] M. Ben-Or, "Lower bounds for algebraic computation trees", In: 15th Annual ACM Symposium on theory of Computing, ACM Press, New York, 1983, pp. 80-86.
[6] N. Noah, M. O-Mahony, Communicable Disease - Epidemiology and Control, John Wiley, New York, 1998.
[7] Z. Ma, J. L, "Basic Knowledge and Developing Tendencies in Epidemic Dynamics", Mathematics for Life Science and Medicine, Springer Berlin-Heidelberg, 2007, pp. 5-49.
[8] T.G. Crainic, J.M. Rousseau, "Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem", Transportation Research Part B: Methodological, vol. 20, 1986, pp. 225-242.
[9] M. Zhang, G.S. Liu, L.K. Wu, Y.H. He, "Model and algorithm for bilevel transportation problem", Acta Mathematicae Applicatae Sinica, English Series, vol. 31, 2008, pp. 17-23.
[10] T.K. Ralphs, L. Kopman, W.R. Pulleyblank, L.E. Trotter, "On the capacitated vehicle routing problem", Math. Prog., vol. 94, 2003, pp. 343-359.