Optimization of Infectious Medical Waste Collection Using RFID

  • Pamela C. Nolz
  • Nabil Absi
  • Dominique Feillet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6971)


In this paper we consider the collection of infectious medical waste, produced by patients in self-treatment and stored at pharmacies. The problem is formulated as a collector-managed inventory routing problem, encompassing stochastic aspects, which are common in such problems. Social objectives, specifically the satisfaction of pharmacists and the local authority, as well as the minimization of public health risks, are considered for the real-world motivated inventory routing problem. To optimize the planning process for a predefined time horizon, we take advantage of radio frequency identification technologies. We design a tabu search based algorithm to optimize the determination of visit dates and corresponding vehicle routes. The suggested approach is tested on real-world data from the region of Provence-Alpes-Côte d’Azur, in France. The results for different waste collection scenarios are analyzed and compared in order to evaluate the performance of the proposed solution method.


Tabu Search Travel Salesman Problem Inventory Level Penalty Cost Inventory Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ak, A., Erera, A.L.: A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transportation Science 41(2), 222–237 (2007)CrossRefGoogle Scholar
  2. 2.
    Baptista, S., Oliveira, R.C., Zuquete, E.: A period vehicle routing case study. European Journal of Operational Research 139(2), 220–229 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bertazzi, L., Savelsbergh, M., Speranza, M.G.: Inventory routing. In: Golden, B., Raghvan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 49–72. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Campbell, A., Clarke, L., Kleywegt, A., Savelsbergh, M.: The inventory routing problem. Fleet Management and Logistics, 95–113 (1998)Google Scholar
  5. 5.
    Campbell, A., Clarke, L., Savelsbergh, M.: Inventory routing in practice. In: Toth, P., Vigo, D. (eds.) The vehicle routing problem. SIAM Monographes on Discrete Mathematics and Applications, pp. 309–330 (2002)Google Scholar
  6. 6.
    Campbell, A.M., Savelsbergh, M.W.P.: A decomposition approach for the inventory-routing problem. Transportation Science 38(4), 488–502 (2004)CrossRefGoogle Scholar
  7. 7.
    Christiansen, C.H., Lysgaard, J.: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters 35(6), 773–781 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a Large-Scale Traveling-Salesman Problem. Operations Research 2(4), 393–410 (1954)MathSciNetGoogle Scholar
  9. 9.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Federgruen, A., Simchi-Levi, D.: Analysis of vehicle routing and inventory-routing problems. Handbooks in Operations Research and Management Science 8, 297–373 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Gendreau, M., Laporte, G., Séguin, R.: Stochastic vehicle routing. European Journal of Operational Research 88(1), 3–12 (1996)CrossRefzbMATHGoogle Scholar
  12. 12.
    Gendreau, M., Laporte, G., Séguin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research 44(3), 469–477 (1996)CrossRefzbMATHGoogle Scholar
  13. 13.
    Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)CrossRefzbMATHGoogle Scholar
  14. 14.
    Hjorring, C., Holt, J.: New optimality cuts for a single-vehicle stochastic routing problem. Annals of Operations Research 86, 569–584 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Kulcar, T.: Optimizing solid waste collection in Brussels. European Journal of Operational Research 90(1), 71–77 (1996)CrossRefzbMATHGoogle Scholar
  16. 16.
    Laporte, G., Louveaux, F.: Solving stochastic routing problems with the integer L-shaped method. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 159–167. Kluwer Academic Publishers, Dordrecht (1996)Google Scholar
  17. 17.
    Le Blanc, H.M., Van Krieken, M.G.C., Fleuren, H., Krikke, H.R.: Collector managed inventory, a proactive planning approach to the collection of liquids coming from end-of-life vehicles. Technical report (2004)Google Scholar
  18. 18.
    Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21(2), 498–516 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Mendoza, J.E., Castanier, B., Guéret, C., Medaglia, A.L., Velasco, N.: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers & Operations Research 37(11), 1886–1898 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Miyazaki, M., Imatoh, T., Une, H.: The treatment of infectious waste arising from home health and medical care services: Present situation in Japan. Waste Management 27, 130–134 (2007)CrossRefGoogle Scholar
  21. 21.
    Mourao, M., Almeida, M.T.: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. European Journal of Operational Research 121(2), 420–434 (2000)CrossRefzbMATHGoogle Scholar
  22. 22.
    Nuortio, T., et al.: Improved route planning and scheduling of waste collection and transport. Expert Systems with Applications 30(2), 223–232 (2006)CrossRefGoogle Scholar
  23. 23.
    Rei, W., Gendreau, M., Soriano, P.: A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transportation Science 44(1), 136–146 (2010)CrossRefGoogle Scholar
  24. 24.
    Shih, L., Chang, H.: A routing and scheduling system for infectious waste collection. Environmental Modeling and Assessment 6(4), 261–269 (2001)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Solyali, O., Cordeau, J.F., Laporte, G.: Robust Inventory Routing under Demand Uncertainty. Technical report (2010)Google Scholar
  26. 26.
    Teixeira, J., Antunes, A.P., de Sousa, J.P.: Recyclable waste collection planning–a case study. European Journal of Operational Research 158(3), 543–554 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Tung, D.V., Pinnoi, A.: Vehicle routing-scheduling for waste collection in Hanoi. European Journal of Operational Research 125(3), 449–468 (2000)CrossRefzbMATHGoogle Scholar
  28. 28.
    Yu, Y., Chen, H., Chu, F.: A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research 189(3), 1022–1040 (2008)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Pamela C. Nolz
    • 1
  • Nabil Absi
    • 1
  • Dominique Feillet
    • 1
  1. 1.Ecole des Mines de Saint-EtienneGardanneFrance

Personalised recommendations