Saltar para:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Início > Publicações > Visualização > Dynamic VRP in pharmaceutical distribution-a case study

Dynamic VRP in pharmaceutical distribution-a case study

Título
Dynamic VRP in pharmaceutical distribution-a case study
Tipo
Artigo em Revista Científica Internacional
Ano
2006
Autores
De Magalhaes, JM
(Autor)
Outra
A pessoa não pertence à instituição. A pessoa não pertence à instituição. A pessoa não pertence à instituição. Sem AUTHENTICUS Sem ORCID
Jorge Pinho de Sousa
(Autor)
FEUP
Ver página pessoal Sem permissões para visualizar e-mail institucional Pesquisar Publicações do Participante Ver página do Authenticus Sem ORCID
Revista
Vol. 14
Páginas: 177-192
ISSN: 1435-246X
Editora: Springer Nature
Indexação
Outras Informações
ID Authenticus: P-007-GHG
Abstract (EN): 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. © Springer-Verlag 2006.
Idioma: Inglês
Tipo (Avaliação Docente): Científica
Documentos
Não foi encontrado nenhum documento associado à publicação.
Publicações Relacionadas

Dos mesmos autores

Multiobjective metaheuristic approaches for mean-risk combinatorial optimisation with applications to capacity expansion (2008)
Tese
João Alberto Vieira de Campos Pereira Claro; Jorge Pinho de Sousa; Jorge Pinho de Sousa
HIERARCHICAL PRODUCTION PLANNING IN A MAKE-TO-ORDER COMPANY - A CASE-STUDY (1995)
Artigo em Revista Científica Internacional
Maria Antónia Carravilla; Jorge Pinho de Sousa; Jorge Pinho de Sousa

Da mesma revista

On the convergence to Walrasian prices in random matching Edgeworthian economies (2012)
Artigo em Revista Científica Internacional
Pinto, AA; Ferreira, M; Finkenstaedt, BF; Oliveira, B; Yannacopoulos, AN
A comparison of matching algorithms for kidney exchange programs addressing waiting time (2021)
Artigo em Revista Científica Internacional
Monteiro, T; Klimentova, X; Joao Pedro Pedroso; Viana, A
Recomendar Página Voltar ao Topo
Copyright 1996-2025 © Centro de Desporto da Universidade do Porto I Termos e Condições I Acessibilidade I Índice A-Z
Página gerada em: 2025-10-20 às 23:17:15 | Política de Privacidade | Política de Proteção de Dados Pessoais | Denúncias | Livro Amarelo Eletrónico