Multicriteria Optimization for Infectious Medical Waste Collection System Planning
Publication: Practice Periodical of Hazardous, Toxic, and Radioactive Waste Management
Volume 7, Issue 2
Abstract
An infectious waste collection system planning in Taiwan requires solving routing and scheduling problems simultaneously due to an environmental regulation. Previous work on this type of problem that considered a single criterion is extended in this study to a multiple criteria optimization approach. In addition to minimization of the cost, minimization of transportation risk and balancing of workers’ carrying loads are considered for hazardous waste collection. Dynamic programming and integer linear programming methods are incorporated as an integral part of decision analysis in which a compromise programming method is adopted to integrate the three criteria of concern. Finally, an illustrative example of infectious waste collection in Tainan City is presented to demonstrate the application potential of the proposed approach. A geographical information system is used to aid in relevant spatial analyses, such as the location of medical institutions, actual travel distances, and district population density, in the optimization steps. The findings indicate that the incorporation of more objectives in decision analysis may provide a scientifically credible solution for medical waste management in urban areas.
Get full access to this article
View all available purchase options and get full access to this article.
References
Bartholdi, J.J., and Platzman, L.K.(1982). “An planar traveling salesman heuristic based on spacefilling curves.” Oper. Res., 1(4), 121–125.
Beltrami, E.J., and Bodin, L.D.(1974). “Networks and vehicle routing for municipal waste collection.” Network, 4, 65–94.
Bowerman, R.L., and Calamai, P. H.(1994). “The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem.” Eur. J. Oper. Res., 76, 128–142.
Christofides, N., and Beasley, J.E.(1984). “The period routing problem.” Network, 14, 237–256.
Gaudioso, M., and Paletta, G.(1992). “A heuristic for periodic vehicle routing problem.” Transport. Sci., 26(2), 86–92.
Hadjiconstantinou, E., and Baldacci, R.(1998). “A multi-depot period vehicle routing problem arising in the utilities sectors.” J. Oper. Res. Soc. Am., 49(12), 1239–1248.
Lin, S.(1965). “Computer solutions of the traveling salesman problem.” Bell Syst. Tech. J., 44, 2245–2269.
List, G., and Mirchandani, P.(1991). “An integrated network/planar multiobjective model for routing and siting for hazardous materials and wastes.” Transport. Sci., 25(2), 146–156.
Nema, A.K., and Gupta, S.K.(1999). “Optimization of regional hazardous waste management systems: An improved formulation.” Waste Manage. Res., 19, 441–451.
Russell, R., and Gribbin, D.(1991). “An multiphase approach to the period routing problem.” Network, 12(7), 747–765.
Russell, R., and Igo, W.(1979). “An assignment routing problem.” Network, 9(1), 1–17.
Shih, L.H., and Lin, Y.T.(1999). “Optimal routing for infectious waste collection.” J. Environ. Eng. (Reston, Va.), 125(5), 479–484.
Tan, C.C.R., and Beasley, J.E.(1984). “A heuristic algorithm for the period vehicle routing problem.” Omega, 12(5), 497–504.
Yu, P.L., and Leitmann, G.(1973). “Compromise solutions, domination structures and Salukvadze’s solution.” Probl. Control and Information Theory, 2(3–4), 183–197.
Zografos, K.G., and Samara, S.A.(1990). “Combined location-routing model for hazardous waste transportation and disposal.” Transp. Res. Rec.,1245, 52–59.
Information & Authors
Information
Published In
Practice Periodical of Hazardous, Toxic, and Radioactive Waste Management
Volume 7 • Issue 2 • April 2003
Pages: 78 - 85
Copyright
Copyright © 2003 American Society of Civil Engineers.
History
Received: Dec 12, 2002
Accepted: Dec 12, 2002
Published online: Mar 14, 2003
Published in print: Apr 2003
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.