Skip to main content

Ant Colony Optimization Algorithm for a Transportation Problem in Home Health Care with the Consideration of Carbon Emissions

  • Conference paper
  • First Online:
Artificial Evolution (EA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12052))

Abstract

Home health care (HHC) companies provide the care service for the patients at their homes in order to help them recover from illness or injury. Since transportation cost is one of the largest operating costs in the daily activities of HHC company, it is crucial to optimize daily traveling routes of the HHC vehicles in order to reduce the transportation cost meanwhile improving the service quality to patients. However, transportation has serious impacts on the environment. Therefore, it compels managers of the HHC companies to pay more attention to CO\(_2\) emissions when designing the daily logistics activities. This study addresses a daily transportation problem of a HHC company with the constraints of synchronized visits and carbon emissions. In order to solve the studied problem, we develop an ant colony optimization (ACO) algorithm. The experimental results highlight the efficiency of the proposed ACO algorithm compared with the Gurobi solver with a time limit of 3600 s.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Liu, R., Xie, X., Augusto, V., Rodriguez, C.: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur. J. Oper. Res. 230(3), 475–486 (2013)

    Article  MathSciNet  Google Scholar 

  2. Yuan, B., Liu, R., Jiang, Z.: Daily scheduling of caregivers with stochastic times. Int. J. Prod. Res. 56(9), 3245–3261 (2018)

    Article  Google Scholar 

  3. Liu, R., Tao, Y., Xie, X.: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits. Comput. Oper. Res. 101, 250–262 (2019)

    Article  MathSciNet  Google Scholar 

  4. Bektaş, T., Laporte, G.: The pollution-routing problem. Trasport. Res. B-Meth. 45(8), 1232–1250 (2011)

    Article  Google Scholar 

  5. Fathollahi-Fard, A.M., Hajiaghaei-Keshteli, M., Tavakkoli-Moghaddam, R.: A bi-objective green home health care routing problem. J. Clean. Prod. 200, 423–443 (2018)

    Article  Google Scholar 

  6. Xiao, L., Dridi, M., Hajjam El Hassani, A., Fei, H., Lin, W.: An improved cuckoo search for a patient transportation problem with consideration of reducing transport emissions. Sustainability 10(3), 793 (2018)

    Article  Google Scholar 

  7. Jabali, O., Van Woensel, T., De Kok, A.G.: Analysis of travel times and CO\( _ 2 \) emissions in time-dependent vehicle routing. Prod. Oper. Manag. 21(6), 1060–1074 (2012)

    Article  Google Scholar 

  8. Demir, E., Bektaş, T., Laporte, G.: The bi-objective pollution-routing problem. Eur. J. Oper. Res. 232(3), 464–478 (2014)

    Article  MathSciNet  Google Scholar 

  9. Teoh, B.E., Ponnambalam, S.G., Subramanian, N.: Data driven safe vehicle routing analytics: a differential evolution algorithm to reduce CO\( _ 2 \) emissions and hazardous risks. Ann. Oper. Res. 270(1–2), 515–538 (2018)

    Article  MathSciNet  Google Scholar 

  10. Wang, D., Luo, H., Grunder, O., Lin, Y., Guo, H.: Multi-step ahead electricity price forecasting using a hybrid model based on two-layer decomposition technique and BP neural network optimized by firefly algorithm. Appl. Energy 190, 390–407 (2017)

    Article  Google Scholar 

  11. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B Cybern. 26(1), 29–41 (1996)

    Article  Google Scholar 

  12. Wang, X., Choi, T.M., Liu, H., Yue, X.: Novel ant colony optimization methods for simplifying solution construction in vehicle routing problems. IEEE Trans. Intell. Transp. Syst. 17(11), 3132–3141 (2016)

    Article  Google Scholar 

  13. Decerle, J., Grunder, O., Hajjam El Hassani, A., Barakat, O.: A memetic algorithm for a home health care routing and scheduling problem. Oper. Res. Health Care 16, 59–71 (2018)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olivier Grunder .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Luo, H., Dridi, M., Grunder, O. (2020). Ant Colony Optimization Algorithm for a Transportation Problem in Home Health Care with the Consideration of Carbon Emissions. In: Idoumghar, L., Legrand, P., Liefooghe, A., Lutton, E., Monmarché, N., Schoenauer, M. (eds) Artificial Evolution. EA 2019. Lecture Notes in Computer Science(), vol 12052. Springer, Cham. https://doi.org/10.1007/978-3-030-45715-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-45715-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-45714-3

  • Online ISBN: 978-3-030-45715-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics