A multiperiod drayage problem with customer-dependent service periods

Autor: Paola Zuddas, Antonio Frangioni, Massimo Di Francesco, Ali Ghezelsoflu

Publikováno v: Computers & Operations Research. 129:105189

We investigate a multiperiod drayage problem in which customers request transportation services over several days, possibly leaving the carrier some flexibility to change service periods. We compare three approaches for the problem: a path-based mode

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb750b0dbea40064586a92acaaf826f3
https://doi.org/10.1016/j.cor.2020.105189

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

Autor: Ali Ghezelsoflu, M Di Francesco, Antonio Frangioni, Paola Zuddas

Publikováno v: Journal of industrial engineering international (Online) 14 (2018): 665–676. doi:10.1007/s40092-018-0256-8
info:cnr-pdr/source/autori:Ghezelsoflu A.; Di Francesco M.; Frangioni A.; Zuddas P./titolo:A set-covering formulation for a drayage problem with single and double container loads/doi:10.1007%2Fs40092-018-0256-8/rivista:Journal of industrial engineering international (Online)/anno:2018/pagina_da:665/pagina_a:676/intervallo_pagine:665–676/volume:14
Journal of Industrial Engineering International, Vol 14, Iss 4, Pp 665-676 (2018)

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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8885849431d58ca41e0f03c6f7d5f339
http://hdl.handle.net/11568/900252