This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality by a commercial solver, significantly outperforming a previously proposed node-arc formulation. Moreover, the model can be effectively used to evaluate a new distribution policy, which results in an enlarged set of feasible routes and can increase savings w.r.t. the policy currently employed by the carrier.
A set-covering formulation for a drayage problem with single and double container loads
Antonio Frangioni;
2018-01-01
Abstract
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality by a commercial solver, significantly outperforming a previously proposed node-arc formulation. Moreover, the model can be effectively used to evaluate a new distribution policy, which results in an enlarged set of feasible routes and can increase savings w.r.t. the policy currently employed by the carrier.File | Dimensione | Formato | |
---|---|---|---|
PublishedVersion.pdf
accesso aperto
Descrizione: Versione elettronica
Tipologia:
Versione finale editoriale
Licenza:
Creative commons
Dimensione
419.2 kB
Formato
Adobe PDF
|
419.2 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.