Most hospitals and clinics in Taiwan do not have on-site treatment facilities for their infectious waste and must rely on outside agencies for their collection and treatment. The problem of optimally routing and scheduling the collection of medical waste from a disperse group of facilities is recognized as a periodic vehicle routing problem. This study develops a computer system to solve the resulting optimization problem based on a two-phased approach proposed earlier. The first phase solves a standard vehicle routing problem to determine a set of individual routes for the collection vehicles. The second phase uses a mixed integer programming method to assign routes to particular days of the week. The computer system is user-friendly and consists of several Visual Basic programs while the geographical information system is incorporated to facilitate input and output interface and database management. An illustrative example for the infectious waste of 348 hospitals in the Tainan City area demonstrates the effectiveness of the system.
[1]
Shen Lin.
Computer solutions of the traveling salesman problem
,
1965
.
[2]
Giuseppe Paletta,et al.
A Heuristic for the Periodic Vehicle Routing Problem
,
1992,
Transp. Sci..
[3]
Robert L. Bowerman,et al.
The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
,
1994
.
[4]
Roberto Baldacci,et al.
A multi-depot period vehicle routing problem arising in the utilities sector
,
1998,
J. Oper. Res. Soc..
[5]
John E. Beasley,et al.
A heuristic algorithm for the period vehicle routing problem
,
1984
.
[6]
Li-Hsing Shih,et al.
Optimal Routing for Infectious Waste Collection
,
1999
.