Cargo theft weighted vehicle routing problem: modeling and application to the pharmaceutical distribution sector

Repolho, Hugo M.; Marchesi, Janaina Figueira; Júnior, Orivalde S. Silva; Bezerra, Rodrigo Rangel Ribeiro

doi:10.1007/s00500-018-3250-6

Cited by 8 publications

(6 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The upstanding result attributed to route optimization implies a very high maturity level due to the evolutionary level of its implementation and the higher degree of importance attributed mainly to the following indicators: (i) employee safety caused to the alignment in real time of the routes with the goal of minimizing theft episodes [113]; (ii) operating cost reduction, including delivery and maintenance cost [62,84]; (iii) CO 2 emission reduction by consuming less fuel and reducing the distance traveled on delivery stretches [67,84]; and (iv) total round trip time, consequent to creating realistic routes with more predictable delivery times [82].…”

Section: Analysis Discussion Of Results and Contribution Of Best Prac...mentioning

confidence: 99%

Methodology for Prioritizing Best Practices Applied to the Sustainable Last Mile—The Case of a Brazilian Parcel Delivery Service Company

et al. 2022

View full text Add to dashboard Cite

The ever-increasing impacts of the last mile delivery sector on the environment and the quality of life of the urban population, such as increased congestion, demand best practices to be incorporated by companies to reduce impacts such as emission of air pollutants and Greenhouse Gases (GHG) and depletion of natural resources, among others. However, a myriad of strategies has been developed for this purpose but there is a lack of methodologies that allow the choice of the best ones for a specific case. Therefore, this study looks for those best practices to be employed through an innovative methodology that consists of SWOT analysis (Strengths, Weaknesses, Opportunities, and Threats), a map of strategies of the delivery service, and using the Sustainability Balanced Scorecard (SBSC) and the Analytic Hierarchy Process (AHP), with the differential of considering the peculiarities of each company. The results applied in a Brazilian last mile delivery service company show that best practices such as route optimization, implementation of new infrastructure and business models for urban deliveries, and use of information systems for fleet tracking and monitoring contribute significantly to improving performance indicators and achieving the sector’s goal to become more sustainable, and especially meeting the Sustainable Development Goals (SDGs) 8, 9, 11, and 17.

show abstract

Section: Analysis Discussion Of Results and Contribution Of Best Prac...mentioning

confidence: 99%

Methodology for Prioritizing Best Practices Applied to the Sustainable Last Mile—The Case of a Brazilian Parcel Delivery Service Company

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Recently, Xu et al (2019) developed a mixed-integer linear model for optimizing the distribution of different cash denominations. Repolho et al (2019) studied a variant of VRP which aims to minimize transportation and cargo theft costs in high theft risk areas. Ghannadpour and Zandiyeh (2020) developed a bi-objective VRP with time windows in order to simultaneously minimize the risk of transfers and the total distance traveled by vehicles.…”

Section: Cash Transportation Problemmentioning

confidence: 99%

Multi-objective periodic cash transportation problem with path dissimilarity and arrival time variation

Tikani

Setak

Demir

2021

Expert Systems with Applications

View full text Add to dashboard Cite

This paper introduces a multi-objective periodic routing problem in the context of cash transportation, which attempts to increase security by generating unpredictable alternative paths and spreading arrival times at each demand node. The current study covers the shortcomings of previous models on dissimilar routing and cash transportation problems from several aspects. The studied problem has tri objectives, including completion times, risk of robbery, and customers' satisfaction level considering the effects of traffic congestion as a daily phenomenon. On top of these, we extend the studied routing problem in multigraph setting, which can keep a set of efficient paths with multiple attributes (e.g., risk, time). Such representation enables us to evoke dissimilar route plans not only by reordering the sequence of nodes but also by employing alternative links even in a fix sequence of nodes. To handle the computational challenges arising from these properties, we propose a new evolutionary algorithm based on NSGA-II. The proposed method is embedded with a fuzzy logic technique to guide the applied operators and benefits from caching memory to accelerate and diversify the searching process. The results of implementing the proposed algorithm on test instances confirm the effectiveness of our method in compression to standard NSGA-II. In addition, our performed sensitivity analyses show that the multigraph setting can substantially improve the quality of solutions with respect to all studied objectives.

show abstract

“…Zhu and Ursavas (2018) designed a VRP model for drug distribution in the Netherlands, which included warehouse location, customer time windows and limited route time. The VRP models in the field of pharmaceutical distribution can be found in Moghadama and Seyedhosseinia (2010), Gulczynski et al (2011), Kramer et al (2019), Repolho et al (2019) and Campelo et al (2019). For the pharmaceutical distribution problem, there are studies that deal with the vehicle routing and location selection problem together (see Sousa et al, 2005;Escu ın et al, 2012;Ceselli et al, 2014;Perwira Redi et al, 2020).…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Simulated annealing (SA) is applied to optimization problems inspired by the annealing process of metals by Kirkpatrick et al (1983) and Cerny (1985). The SA method relies on very few parameters and can be considered relatively simple, making it quite practical and easy to implement (Repolho et al , 2019) It has also been widely used to solve the VRP in the literature. SA with a specific solution encoding scheme was used in a capacitated location routing problem by Yu et al (2010), where location and routing decisions were integrated to broaden the search space so that better solutions could be obtained.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Solving vehicle routing problem with time windows using metaheuristic approaches

Birecik

Özgen

2022

IJICC

View full text Add to dashboard Cite

PurposeDrugs are strategic products with essential functions in human health. An optimum design of the pharmaceutical supply chain is critical to avoid economic damage and adverse effects on human health. The vehicle-routing problem, focused on finding the lowest-cost routes with available vehicles and constraints, such as time constraints and road length, is an important aspect of this. In this paper, the vehicle routing problem (VRP) for a pharmaceutical company in Turkey is discussed.Design/methodology/approachA mixed-integer programming (MIP) model based on the vehicle routing problem with time windows (VRPTW) is presented, aiming to minimize the total route cost with certain constraints. As the model provides an optimum solution for small problem sizes with the GUROBI® solver, for large problem sizes, metaheuristic methods that simulate annealing and adaptive large neighborhood search algorithms are proposed. A real dataset was used to analyze the effectiveness of the metaheuristic algorithms. The proposed simulated annealing (SA) and adaptive large neighborhood search (ALNS) were evaluated and compared against GUROBI® and each other through a set of real problem instances.FindingsThe model is solved optimally for a small-sized dataset with exact algorithms; for solving a larger dataset, however, metaheuristic algorithms require significantly lesser time. For the problem addressed in this study, while the metaheuristic algorithms obtained the optimum solution in less than one minute, the solution in the GUROBI® solver was limited to one hour and three hours, and no solution could be obtained in this time interval.Originality/valueThe VRPTW problem presented in this paper is a real-life problem. The vehicle fleet owned by the factory cannot be transported between certain suppliers, which complicates the solution of the problem.

show abstract

Cargo theft weighted vehicle routing problem: modeling and application to the pharmaceutical distribution sector

Cited by 8 publications

References 41 publications

Methodology for Prioritizing Best Practices Applied to the Sustainable Last Mile—The Case of a Brazilian Parcel Delivery Service Company

Methodology for Prioritizing Best Practices Applied to the Sustainable Last Mile—The Case of a Brazilian Parcel Delivery Service Company

Multi-objective periodic cash transportation problem with path dissimilarity and arrival time variation

Solving vehicle routing problem with time windows using metaheuristic approaches

Contact Info

Product

Resources

About