Go to:
Logótipo
Você está em: Start > Publications > View > Dynamic VRP in pharmaceutical distribution-a case study
Map of Premises
Principal
Publication

Dynamic VRP in pharmaceutical distribution-a case study

Title
Dynamic VRP in pharmaceutical distribution-a case study
Type
Article in International Scientific Journal
Year
2006
Authors
De Magalhaes, JM
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Jorge Pinho de Sousa
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Journal
Vol. 14
Pages: 177-192
ISSN: 1435-246X
Publisher: Springer Nature
Indexing
Other information
Authenticus ID: 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.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Multiobjective metaheuristic approaches for mean-risk combinatorial optimisation with applications to capacity expansion (2008)
Thesis
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)
Article in International Scientific Journal
Maria Antónia Carravilla; Jorge Pinho de Sousa; Jorge Pinho de Sousa

Of the same journal

On the convergence to Walrasian prices in random matching Edgeworthian economies (2012)
Article in International Scientific Journal
Pinto, AA; Ferreira, M; Finkenstaedt, BF; Oliveira, B; Yannacopoulos, AN
A comparison of matching algorithms for kidney exchange programs addressing waiting time (2021)
Article in International Scientific Journal
Monteiro, T; Klimentova, X; Joao Pedro Pedroso; Viana, A
Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-17 at 23:31:28 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book