Dynamic Multi-trip Vehicle Routing with Unusual Time-windows for the Pick-up of Blood Samples and Delivery of Medical Material

Nicolas Zufferey, Byung Yun Cho, Rémy Glardon

2016

Abstract

Given a fleet of identical vehicles and a set of n clients to be served from a single depot, the well-known vehicle routing problem (VRP) consists in serving each client (with a deterministic demand) once with a unique vehicle, with the aim of minimizing the total traveled distance. In this work, the basic VRP is extended within a medical environment, leading to MVRP (for medical VRP). Indeed, the depot is typically a laboratory for blood analysis, and a client is assumed to be a medical location at which blood samples should be picked up by a vehicle. In order to have efficient tests at the laboratory, at most 90 minutes should elapse between the release time of the blood sample and the delivery time at the laboratory. In addition, only a proportion of the demand is known in advance and the travel times depend on the traffic conditions. A fleet of non-identical vehicle is considered (with different speeds and capacities), and each location has to be visited anytime a blood sample is available. Finally, medical items should be daily delivered from the laboratory to some medical locations. A transportation cost function with three components has to be minimized. Solution methods are proposed, which are able to account for all the specific features of the problem. The experiments highlight the benefit of considering diversion opportunities (which consists in diverting a vehicle away from its planned destinations).

References

  1. Cho, B. Y. (2015). Management and Optimization of Vehicle Routing Problem with Medical Challenge. Master's thesis, Ó cole Polytechnique Fédérale de Lausanne, Switzerland.
  2. Ciavotta, M., Meloni, C., and Pranzo, M. (2009). Scheduling dispensing and counting in secondary pharmaceutical manufacturing. AIChE Journal, 55 (5):1161 - 1170.
  3. Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., and Sormany, J.-S. (2005). Logistics Systems: Design and Optimization, chapter New Heuristics for the Vehicle Routing Problem, pages 270-297. Springer.
  4. Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., and Semet, F. (2002). A Guide to Vehicle Routing Heuristics. Journal of the Operational Research Society, 53 (5):512-522.
  5. Cordeau, J.-F. and Laporte, G. (2004). Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, chapter Tabu search heuristics for the vehicle routing problem, pages 145-163. Kluwer, Boston.
  6. Cordeau, J.-F., Laporte, G., and Mercier, A. (2001). A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. Journal of the Operational Research Society, 52:928-936.
  7. Fleischmann, B., Grietz, M., and Gnutzmann, S. (2004). Time Varying Travel Times in Vehicle Routing. Transportation Science, 38:160-173.
  8. Garey, M. and Johnson, D. (1979). Computer and Intractability: a Guide to the Theory of NPCompleteness. Freeman, San Francisco.
  9. Gendreau, M., Laporte, G., and Potvin, J.-Y. (2002). The Vehicle Routing Problem, chapter Metaheuristics for the VRP, pages 129-154. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
  10. Gendreau, M. and Potvin, J.-Y. (1998). Fleet Management and Logistics, chapter Dynamic Vehicle Routing and Dispatching, pages 115 - 126. Kluwer.
  11. Gendreau, M. and Potvin, J.-Y. (2010). Handbook of Metaheuristics, volume 146 of International Series in Operations Research & Management Science. Springer.
  12. Golden, B. L., Wasil, E. A., Kelly, J. P., and Chao, I.- M. (1998). Fleet Management and Logistics, chapter Metaheuristics in vehicle routing, pages 33-56. Kluwer, Boston.
  13. Grasas, A., Ramalhinho, H., Pessoa, L., Resende, M., Caballé, I., and N. Barba N. (), . (2014). On the Improvement of Blood Sample Collection at Clinical Laboratories. BMC Health Services Research, 14 (12).
  14. Grefenstette, J. (1987). Genetic Algorithms and Simulated Annealing, chapter Incorporating Problem Specific Knowledge into Genetic Algorithms, pages 42- 60. Morgan Kaufmann Publishers.
  15. Hertz, A., Schindl, D., and Zufferey, N. (2009). A solution method for a car fleet management problem with maintenance constraints. Journal of Heuristics, 15 (5):425 - 450.
  16. Horn, M. (2000). Efficient Modelling of Travel in Networks with Time-Varying Link Speeds. Networks, 36:80 - 90.
  17. Ichoua, S., Gendreau, M., and Potvin, J.-Y. (2000). Diversion Issues in Real-Time Vehicle Dispatching. Transportation Science, 34 (4):426 - 438.
  18. Ichoua, S., Gendreau, M., and Potvin, J.-Y. (2003). Vehicle Dispatching with Time-Dependent Travel Times. European Journal of Operational Research, 144:379 - 396.
  19. Kaufman, D. and Smith, R. (1993). Fastest Paths in TimeDependent Networks for Intelligent Vehicle-Highway Systems Application. Intelligent Vehicle-Highway Systems Journal, 1:1 - 11.
  20. Laporte, G. and Semet, F. (2002). The Vehicle Routing Problem, chapter Classical heuristics for the capacitated VRP, pages 109-128. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
  21. Lorini, S., Potvin, J.-Y., and Zufferey, N. (2011). Online vehicle routing and scheduling with dynamic travel times. Computers & Operations Research, 38:1086 - 1090.
  22. Mester, D. and Braysy, O. (2007). Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers & Operations Research, 34 (10):2964 - 2975.
  23. Nagata, Y. and Braysy, O. (2009). Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks, 54 (4):205 - 215.
  24. Nemhauser, G. and Wolsey, L. (1988). Integer and Combinatorial Optimization. John Wiley & Sons.
  25. Pillac, V., Gendreau, M., Guéret, C., and Medaglia, A. L. (2013). A Review of Dynamic Vehicle Routing Problems. European Journal of Operational Research, 225:1 - 11.
  26. Potvin, J.-Y., Xu, Y., and Benyahia, I. (2006). Vehicle Routing and Scheduling with Dynamic Travel Times. Computers & Operations Research, 33:1129 - 1137.
  27. Psaraftis, H. (1995). Dynamic Vehicle Routing: Status and Prospects. Annals of Operations Research, 61:143 - 164.
  28. Respen, J., Zufferey, N., and Amaldi, E. (2015 (accepted)). Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. Networks.
  29. Respen, J., Zufferey, N., and Potvin, J.-Y. (2014). Online vehicle routing and scheduling with continuous vehicle tracking. In Proceedings of the 15th Annual Congress of the French Operations Research Society, ROADEF 2014, Bordeaux, France.
  30. Rochat, Y. and Taillard, E. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1:147-167.
  31. Silver, E. A. and Zufferey, N. (2005). Inventory control of raw materials under stochastic and seasonal lead times. International Journal of Production Research, 43:5161-5179.
  32. Solnon, C., Cung, V., Nguyen, A., and Artigues, C. (2008). The car sequencing problem: Overview of stateof-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. European Journal of Operational Research, 191 (3):912 - 927.
  33. Taillard, E., Badeau, P., Gendreau, M., Guertin, F., and Potvin, J.-Y. (1997). A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science, 31:170 - 186.
  34. Thevenin, S., Zufferey, N., and Widmer, M. (2015). Metaheuristics for a scheduling problem with rejection and tardiness penalties. Journal of Scheduling, 18 (1):89 - 105.
  35. Toth, P. and Vigo, D. (2003). The Granular Tabu Search and Its Application to the Vehicle-Routing Problem. INFORMS Journal on Computing, 15 (4):333 - 346.
  36. Vidal, T., Crainic, T. G., Gendreau, M., and Prins, C. (2014). A unified solution framework for multiattribute vehicle routing problems. European Journal of Operational Research, 234:658 - 673.
  37. Woolsey, R. and Swanson, H. S. (1975). Operations Research for Immediate Applications. Harper and Row.
  38. Zufferey, N. (2012a). Metaheuristics: some Principles for an Efficient Design. Computer Technology and Applications, 3 (6):446 - 462.
  39. Zufferey, N. (2012b). Optimization by ant algorithms: Possible roles for an individual ant. Optimization Letters, 6 (5):963 - 973.
  40. Zufferey, N., Farres, J., and Glardon, R. (2015). Ant metaheuristics with adapted personalities for the vehicle routing problem. Lecture Notes in Computer Science, 9335:1 - 13.
  41. Zufferey, N., Studer, M., and Silver, E. A. (2006). Tabu search for a car sequencing problem. In Proceedings of the 19th International Florida Artificial Intelligence Research Society Conference, pages 457 - 462, Melbourne, USA, May 11 - 13.
Download


Paper Citation


in Harvard Style

Zufferey N., Cho B. and Glardon R. (2016). Dynamic Multi-trip Vehicle Routing with Unusual Time-windows for the Pick-up of Blood Samples and Delivery of Medical Material . In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-171-7, pages 366-372. DOI: 10.5220/0005733303660372


in Bibtex Style

@conference{icores16,
author={Nicolas Zufferey and Byung Yun Cho and Rémy Glardon},
title={Dynamic Multi-trip Vehicle Routing with Unusual Time-windows for the Pick-up of Blood Samples and Delivery of Medical Material},
booktitle={Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2016},
pages={366-372},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005733303660372},
isbn={978-989-758-171-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Dynamic Multi-trip Vehicle Routing with Unusual Time-windows for the Pick-up of Blood Samples and Delivery of Medical Material
SN - 978-989-758-171-7
AU - Zufferey N.
AU - Cho B.
AU - Glardon R.
PY - 2016
SP - 366
EP - 372
DO - 10.5220/0005733303660372