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

DOI10.1016/j.ejor.2018.07.030zbMath1403.90498OpenAlexW2884149332WikidataQ129468070 ScholiaQ129468070MaRDI QIDQ1991272

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

Publication date: 30 October 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.07.030

zbMATH Keywords

matheuristicspharmaceutical industryconsistent vehicle routing problemservice level agreements

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90)

Related Items

The periodic vehicle routing problem with driver consistency ⋮ The consistent vehicle routing problem with heterogeneous fleet ⋮ The consistent electric-vehicle routing problem with backhauls and charging management ⋮ Binary driver-customer familiarity in service routing ⋮ The consistent production routing problem ⋮ A case study of consistent vehicle routing problem with time windows ⋮ Minimizing late deliveries in a truck loading problem ⋮ Stochastic inventory routing with time-based shipment consolidation ⋮ Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach ⋮ The vehicle routing problem with profits and consistency constraints ⋮ A matheuristic algorithm for stochastic home health care planning ⋮ The collaborative consistent vehicle routing problem with workload balance ⋮ Discrete optimization model and algorithm for driver planning in periodic driver routing problem ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers

Cites Work

• Rich vehicle routing problems: from a taxonomy to a definition
• The discrete time window assignment vehicle routing problem
• Complexity of routing problems with release dates
• Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
• A set-covering based heuristic algorithm for the periodic vehicle routing problem
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
• A general heuristic for vehicle routing problems
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
• Variable neighborhood decomposition search
• A variable neighborhood search heuristic for periodic routing problems
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Very large-scale vehicle routing: new test problems, algorithms, and results
• A survey on matheuristics for routing problems
• The Truck Dispatching Problem
• Forty years of periodic vehicle routing
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem
• An Exact Algorithm for the Period Routing Problem
• The period routing problem
• A Heuristic for the Periodic Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A unified tabu search heuristic for vehicle routing problems with time windows
• Variable neighborhood search: Principles and applications