This paper is part of the special section devoted to the ROADEF/EURO challenge on inventory routing. We propose an extended formulation that we address with a heuristic branch-cut-and-price method. Among the difficulties that we had to face are a fractional objective function, the simultaneous generation of constraints and columns, and a complex pricing problem. We evaluate our approach on the benchmark instances proposed for the challenge.
A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing
Cattaruzza D;
2020-01-01
Abstract
This paper is part of the special section devoted to the ROADEF/EURO challenge on inventory routing. We propose an extended formulation that we address with a heuristic branch-cut-and-price method. Among the difficulties that we had to face are a fractional objective function, the simultaneous generation of constraints and columns, and a complex pricing problem. We evaluate our approach on the benchmark instances proposed for the challenge.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
