Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/195633
Authors: 
Ghezelsoflu, A.
Di Francesco, M.
Frangion, A.
Zuddas, P.
Year of Publication: 
2018
Citation: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 14 [Year:] 2018 [Issue:] 4 [Pages:] 665-676
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.
Subjects: 
Drayage
Vehicle routing problem
Street-turns
Set covering
Persistent Identifier of the first edition: 
Creative Commons License: 
https://creativecommons.org/licenses/by/4.0/
Document Type: 
Article
Social Media Mentions:

Files in This Item:
File
Size
441.71 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.