Dynamic VRP in pharmaceutical distribution—a case study

Detalhes bibliográficos
Autor(a) principal: Magalhães, José
Data de Publicação: 2006
Outros Autores: Sousa, Jorge de
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/7655
https://doi.org/10.1007/s10100-006-0167-4
Resumo: Abstract In recent years, the pharmaceutical sector has gone through deep changes, partially due to the ageing of the population and to the increasing of costs in health care services. With margins that are getting lower and lower, the drug distribution problem to pharmacies has become much more important, particularly in large metropolitan areas. As pharmacies demand shorter delivery times, vehicle routing and scheduling problems become harder for distributors. It is recognized that the traditional system based on fixed routes does not fulfil the expectations of pharmacies and may, in some cases, be quite inefficient for distributiors. In this work, a case study has been carried out and a change of the traditional approach is proposed, by adopting a system of variable routes that are dynamically designed, based on orders that are constantly arriving along the day. A dynamic algorithm is therefore proposed, meant to be run several times a day. It has four phases: first, a clustering of the orders is performed; second, potential routes are constructed; third, a route is selected for operation; and finally, that route is subject to an improvement process. The selection of the next route to be launched may be postponed in order to take advantage of subsequent information. The algorithm has been tested in the case study, by simulating one week of operation, and by comparing the results with the plan produced by the traditional way
id RCAP_a386b15c38e3a0c6b2182bf1ee4ccd17
oai_identifier_str oai:estudogeral.uc.pt:10316/7655
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Dynamic VRP in pharmaceutical distribution—a case studyAbstract In recent years, the pharmaceutical sector has gone through deep changes, partially due to the ageing of the population and to the increasing of costs in health care services. With margins that are getting lower and lower, the drug distribution problem to pharmacies has become much more important, particularly in large metropolitan areas. As pharmacies demand shorter delivery times, vehicle routing and scheduling problems become harder for distributors. It is recognized that the traditional system based on fixed routes does not fulfil the expectations of pharmacies and may, in some cases, be quite inefficient for distributiors. In this work, a case study has been carried out and a change of the traditional approach is proposed, by adopting a system of variable routes that are dynamically designed, based on orders that are constantly arriving along the day. A dynamic algorithm is therefore proposed, meant to be run several times a day. It has four phases: first, a clustering of the orders is performed; second, potential routes are constructed; third, a route is selected for operation; and finally, that route is subject to an improvement process. The selection of the next route to be launched may be postponed in order to take advantage of subsequent information. The algorithm has been tested in the case study, by simulating one week of operation, and by comparing the results with the plan produced by the traditional way2006info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/7655http://hdl.handle.net/10316/7655https://doi.org/10.1007/s10100-006-0167-4engCentral European Journal of Operations Research. 14:2 (2006) 177-192Magalhães, JoséSousa, Jorge deinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2019-06-02T10:23:12Zoai:estudogeral.uc.pt:10316/7655Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:58:34.435637Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Dynamic VRP in pharmaceutical distribution—a case study
title Dynamic VRP in pharmaceutical distribution—a case study
spellingShingle Dynamic VRP in pharmaceutical distribution—a case study
Magalhães, José
title_short Dynamic VRP in pharmaceutical distribution—a case study
title_full Dynamic VRP in pharmaceutical distribution—a case study
title_fullStr Dynamic VRP in pharmaceutical distribution—a case study
title_full_unstemmed Dynamic VRP in pharmaceutical distribution—a case study
title_sort Dynamic VRP in pharmaceutical distribution—a case study
author Magalhães, José
author_facet Magalhães, José
Sousa, Jorge de
author_role author
author2 Sousa, Jorge de
author2_role author
dc.contributor.author.fl_str_mv Magalhães, José
Sousa, Jorge de
description Abstract In recent years, the pharmaceutical sector has gone through deep changes, partially due to the ageing of the population and to the increasing of costs in health care services. With margins that are getting lower and lower, the drug distribution problem to pharmacies has become much more important, particularly in large metropolitan areas. As pharmacies demand shorter delivery times, vehicle routing and scheduling problems become harder for distributors. It is recognized that the traditional system based on fixed routes does not fulfil the expectations of pharmacies and may, in some cases, be quite inefficient for distributiors. In this work, a case study has been carried out and a change of the traditional approach is proposed, by adopting a system of variable routes that are dynamically designed, based on orders that are constantly arriving along the day. A dynamic algorithm is therefore proposed, meant to be run several times a day. It has four phases: first, a clustering of the orders is performed; second, potential routes are constructed; third, a route is selected for operation; and finally, that route is subject to an improvement process. The selection of the next route to be launched may be postponed in order to take advantage of subsequent information. The algorithm has been tested in the case study, by simulating one week of operation, and by comparing the results with the plan produced by the traditional way
publishDate 2006
dc.date.none.fl_str_mv 2006
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/7655
http://hdl.handle.net/10316/7655
https://doi.org/10.1007/s10100-006-0167-4
url http://hdl.handle.net/10316/7655
https://doi.org/10.1007/s10100-006-0167-4
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Central European Journal of Operations Research. 14:2 (2006) 177-192
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133876441841664