Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector

Campelo, Pedro Henrique; Neves-Moreira, Fábio; Amorim, Pedro; Almada-Lobo, Bernardo

doi:10.1016/j.ejor.2018.07.030

Cited by 56 publications

(35 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Among them there are pharmaceuticals distribution which is one of the most important activities. The paper of Campelo et al (2019) treated the case of pharmaceutical distribution company that serve pharmacies and the problem was characterized by multiple daily deliveries and different service level constraints. The authors used consistent routes to improve driver efficiency, and proposed a method which combined Fix-and-optimize (FO) approach and the Variable Neighborhood Decomposition Search VNDS to tackle this problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem

Bouchra¹,

Dkhissi²,

Cherkaoui³

2020

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper is interested in pharmaceuticals distribution which is one of the most important activities and ensures the availability of drug products to a set of customers (pharmacies). The study introduces the Disrupted Vehicle Routing problem with Soft Time Windows since pharmaceutical distributors should respond to increased demands for products to ensure timely and efficient delivery to dynamic demands. We also propose an improved multiobjective local search (IMOLS), which uses methods of neighborhood search such as large neighborhood search (LNS) and variable neighborhood search (VNS) based on a hybrid approach in the optimization of vehicle routes. The algorithm is expected to achieve competitive results compared with previously published studies.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem

Bouchra¹,

Dkhissi²,

Cherkaoui³

2020

10.5267/j.ijiec

View full text Add to dashboard Cite

show abstract

“…T0 is the initial temperature, k is the iteration number, c is the value of the constant given, and N is the number of inversion parameters. When the temperature is less than the value of Te specified, stage 2 will be carried out with the Equation (6). k0 is the iteration number in stage 1, the β factor increases in temperature.…”

Section: Improved Simulated Annealingmentioning

confidence: 99%

“…In this case, the problem can be called the Capacitated Vehicle Routing Problem (CVRP), which is a problem in determining the route of a vehicle that has a certain capacity in the distribution process. For example the distribution of goods at retail stores [4], motor fuel [5], and distribution in the pharmaceutical sector [6].…”

Section: Introductionmentioning

confidence: 99%

An Improved Simulated Annealing for the Capacitated Vehicle Routing Problem (Cvrp)

Mar'i¹,

Mahmudy²,

Santoso³

2019

kursor

View full text Add to dashboard Cite

In the industrial sector, in order to increase the company's competitive profit and ratio, must be able to suppress as much expenditure as possible. Product distribution is one of the logistics processes in the industry which consumes the most costs. Products must be distributed to customers in different locations and also with varying requests. The problem belongs to Capacitated Vehicle Routing Problem (CVRP) that is considered as one of the complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem that requires difficult computation and a lot of time along with the increasing size of the problem data. So, in this study improvisation will be carried out in the form of modifying the simulated annealing method to solve the combinatorial problem so that the optimal distance in the case of distribution will be obtained. In addition, in this study a comparison will be made between basic simulated annealing and also improved simulated annealing. Based on the results of the research it is proven that Improved Simulated Annealing can provide a better solution.

show abstract

“…Campelo et. al [17] study the routes consistency of several warehouses to hundreds of orders. What should be mentioned is that the service consistency required the learning process and planning of drivers.…”

Section: Literature Reviewmentioning

confidence: 99%

Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem

Huang

Sun

et al. 2019

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

Workforce planning is an operation management problem in the delivery industry to improve service quality and reliability, and the working attitude and passion of drivers, as the direct implementors of delivery service, affect the service level. Consequently, assigning equal workload for drivers so as to improve drivers’ acceptance is a reasonable and efficient workforce plan for managers. This paper investigates a periodic driver routing problem to explore the relationship between workload differential among drivers and total workload; the objective of the optimization problem is to minimize the total workload. To tackle this problem, we first propose a mixed-integer linear programming model, which can be solved by an off-the-shelf mixed-integer linear programming solver, and use the local branching based method to solve larger instances of the problem. Numerical experiments are conducted to validate the effectiveness and efficiency of the proposed model and solution method, as well as the effect of small workload differential among drivers on the total workload.

show abstract

Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector

Cited by 56 publications

References 38 publications

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem

An Improved Simulated Annealing for the Capacitated Vehicle Routing Problem (Cvrp)

Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem

Contact Info

Product

Resources

About