2739. A Branch and Price algorithm for a mmulti-compartment multi-trip petrol replenishment problem
Invited abstract in session WD-58: Exact Algorithms for Vehicle Routing, stream Vehicle Routing and Logistics.
Wednesday, 14:30-16:00Room: Liberty 1.13
Authors (first author is the speaker)
| 1. | Massimo Di Francesco
|
| Department of Mathematics and Computer Science, University of Cagliari | |
| 2. | Roberto Wolfler-Calvo
|
| LIPN, Université Paris Nord | |
| 3. | Simone Zanda
|
| University of Cagliari |
Abstract
This paper addresses a new multi-compartment multi-trip Vehicle Routing Problem (VRP) with time windows in which tanker trucks carry different types of products separated by heterogeneous compartments. Moreover, the content of a compartment among can be split among several customers, even if any customer must served by a vehicle only. The objective is to determine the allocation of products to compartments and the least-cost routes. The problem is modeled by a mixed-Integer Linear Programming formulation. We present a Branch-and-Price algorithm for this problem. The algorithm is tested on data from an Italian petroleum transportation company and instances adapted from the literature.
Keywords
- Combinatorial Optimization
- Logistics
- Graphs and Networks
Status: accepted
Back to the list of papers