A set-covering formulation for a drayage problem with single and double container loads

Autor: A. Ghezelsoflu, M. Di Francesco, A. Frangioni, P. Zuddas
Jazyk: angličtina
Rok vydání: 2018
Předmět:
Zdroj: Journal of Industrial Engineering International, Vol 14, Iss 4, Pp 665-676 (2018)
Druh dokumentu: article
ISSN: 1735-5702
2251-712X
DOI: 10.1007/s40092-018-0256-8
Popis: 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.
Databáze: Directory of Open Access Journals
Externí odkaz: