Combined location and routing problems for drug distribution

Authors:
Alberto Ceselli;Giovanni Righini;Emanuele Tresoldi
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 11
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
2-Path Cuts for the Vehicle Routing Problem with Time Windows

Transportation Science
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3

INFORMS Journal on Computing
New dynamic programming algorithms for the resource constrained elementary shortest path problem

Networks
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

Operations Research
Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows

Transportation Science
A two-stage vehicle routing model for large-scale bioterrorism emergencies

Networks - Route 2007
A Branch-and-Cut method for the Capacitated Location-Routing Problem

Computers and Operations Research
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

Operations Research
An Exact Method for the Capacitated Location-Routing Problem

Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present a model for the optimization of logistics operations in emergency health care systems; in particular, we study the problem of efficient distribution of vaccines or drugs through the simultaneous and coordinated use of distribution centers and vehicles. We devise an exact algorithm based on column generation with three different types of columns and branch-and-bound. The pricing subproblems are solved through advanced dynamic programming techniques. In order to strengthen the dual bounds, we adapt two families of cuts from the literature and we introduce a new one. Our framework also includes primal heuristics and ad-hoc branching rules. An experimental campaign on realistic data proves our method to be effective and flexible.