15
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Solve the medical specimen collection problem by Ant Colony Optimization

, ORCID Icon &

References

  • Agárdi, A., Kovács, L., & Bányai, T. (2021). An attraction map framework of a complex multi-echelon vehicle routing problem with random walk analysis. Applied Sciences, 11(5), 2100. https://doi.org/10.3390/app11052100
  • Alsumairat, N., & Alrefaei, M. (2021). Solving hybrid-vehicle routing problem using modified simulated annealing. International Journal of Electrical and Computer Engineering, 11(6), 4922–4931.
  • Bräysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science, 39(1), 119–139. https://doi.org/10.1287/trsc.1030.0057
  • Desaulniers, G., Lessard, F., & Hadjar, A. (2008). Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Science, 42(3), 387–404. https://doi.org/10.1287/trsc.1070.0223
  • Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations research, 40(2), 342–354. https://doi.org/10.1287/opre.40.2.342
  • Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on evolutionary computation, 1(1), 53–66. https://doi.org/10.1109/4235.585892
  • Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 26(1), 29–41. https://doi.org/10.1109/3477.484436
  • Escobar, J. W., Linfati, R., Toth, P., & Baldoquin, M. G. (2014). A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. Journal of heuristics, 20(5), 483–509. https://doi.org/10.1007/s10732-014-9247-0
  • Faizal, U. M., Jayachitra, R., Vijayakumar, P., & Rajasekar, M. (2021). Optimization of inbound vehicle routes in the collection of bio-medical wastes. Materials Today: Proceedings, 45, 692–699. https://doi.org/10.1016/j.matpr.2020.02.741
  • Gutiérrez-Jarpa, G., Desaulniers, G., Laporte, G., & Marianov, V. (2010). A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows. European Journal of Operational Research, 206(2), 341–349. https://doi.org/10.1016/j.ejor.2010.02.037
  • Haitam, E., Najat, R., & Abouchabaka, J. (2021). A vehicle routing problem for the collection of medical samples at home: Case study of Morocco. International Journal of Advanced Computer Science and Applications, 12(4), https://doi.org/10.14569/IJACSA.2021.0120443
  • Henke, T., Speranza, M. G., & Wäscher, G. (2019). A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes. Annals of Operations Research, 275(2), 321–338. https://doi.org/10.1007/s10479-018-2938-4
  • Huang, Y. H., Blazquez, C. A., Huang, S. H., Paredes-Belmar, G., & Latorre-Nuñez, G. (2019). Solving the feeder vehicle routing problem using Ant Colony Optimization. Computers & Industrial Engineering, 127, 520–535. https://doi.org/10.1016/j.cie.2018.10.037
  • Huang, S. H., Huang, Y. H., Blazquez, C. A., & Paredes-Belmar, G. (2018). Application of the Ant Colony Optimization in the resolution of the bridge inspection routing problem. Applied Soft Computing, 65, 443–461. https://doi.org/10.1016/j.asoc.2018.01.034
  • Huang, S. H., & Lin, P. C. (2015). Vehicle routing–scheduling for municipal waste collection system under the “Keep Trash off the Ground” policy. Omega, 55, 24–37. https://doi.org/10.1016/j.omega.2015.02.004
  • Letchford, A. N., Lysgaard, J., & Eglese, R. W. (2007). A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society, 58(12), 1642–1651. https://doi.org/10.1057/palgrave.jors.2602345
  • Li, D., Cao, Q., Zuo, M., & Xu, F. (2020). Optimization of green fresh food logistics with heterogeneous fleet vehicle route problem by improved genetic algorithm. Sustainability, 12(5), 1946.
  • Mladenović, N., Urošević, D., & Ilić, A. (2012). A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Operational Research, 220(1), 270–285. https://doi.org/10.1016/j.ejor.2012.01.036
  • Nolz, P. C., Absi, N., & Feillet, D. (2014). A stochastic inventory routing problem for infectious medical waste collection. Networks, 63(1), 82–95. https://doi.org/10.1002/net.21523
  • Perboli, G., Tadei, R., & Vigo, D. (2011). The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Science, 45(3), 364–380. https://doi.org/10.1287/trsc.1110.0368
  • Qi, Y., & Cai, Y. (2021). Hybrid chaotic discrete bat algorithm with variable neighborhood search for vehicle routing problem in complex supply chain. Applied Sciences, 11(21), 10101. https://doi.org/10.3390/app112110101
  • Rabbani, M., Akbarpour, M., Hosseini, M., & Farrokhi-Asl, H. (2021). A multi-depot vehicle routing problem with time windows and load balancing: A real world application. International Journal of Supply and Operations Management, 8(3), 347–369.
  • Shih, L. H., & Chang, H. C. (2001). A routing and scheduling system for infectious waste collection. Environmental Modeling and Assessment, 6(4), 261–269. https://doi.org/10.1023/A:1013342102025
  • Zabinsky, Z. B., Dulyakupt, P., Zangeneh-Khamooshi, S., Xiao, C., Zhang, P., Kiatsupaibul, S., & Heim, J. A. (2020). Optimal collection of medical specimens and delivery to central laboratory. Annals of Operations Research, 287(1), 537–564. https://doi.org/10.1007/s10479-019-03260-9

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.