Solving a rich vehicle routing and inventory problem using column generation

Authors:
Johan Oppen;Arne Løkketangen;Jacques Desrosiers
Affiliations:
Molde University College, 6402 Molde, Norway;Molde University College, 6402 Molde, Norway;HEC Montreal and GERAD, Canada
Venue:
Computers and Operations Research
Year:
2010

Citing 5
Cited 3

A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
The vehicle routing problem

The vehicle routing problem
Drive: Dynamic Routing of Independent Vehicles

Operations Research
A Decomposition Approach for the Inventory-Routing Problem

Transportation Science
A tabu search approach for the livestock collection problem

Computers and Operations Research

Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery

Expert Systems with Applications: An International Journal
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science
Genetic Algorithm for Inventory Levels and Routing Structure Optimization in Two Stage Supply Chain

International Journal of Information Systems and Supply Chain Management

Quantified Score

Hi-index	0.01

Visualization

Abstract

The livestock collection problem (LCP) is a rich vehicle routing problem (VRP) extended with inventory constraints. The LCP is a complex planning problem taken from the meat industry, and the goal is to construct a set of vehicle routes to collect animals from farms for slaughter at a slaughterhouse. Several constraints dealing with animal welfare are added, some of these lead to a loading problem where the vehicle capacity depends on the loading sequence. In addition, global constraints to handle production and inventory at the slaughterhouse are needed. This paper presents an exact solution method for the LCP, based on column generation, that solves much larger instances to optimality than what has been done before. The algorithm presented here also solves a richer model that is closer to the underlying real-world problem than previously published work on exact methods for this problem is based on.