Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units
[EN] In most large port cities, the challenge of inter-terminal transfers (ITT) prevails due to the long distance between multiple terminals. The quantity of containers requiring movement between terminals as they connect from pre-carrier to on-carrier is increasing with the formation of the mega-al...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/90339 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/90339 |
| Access Level: | acceso abierto |
| Palabra clave: | Mathematical programming Pick up and delivery problem with time windows Interterminal transfer |
| id |
ES_4d85765eecb6c2a3df5a04496eacf75e |
|---|---|
| oai_identifier_str |
oai:riunet.upv.es:10251/90339 |
| network_acronym_str |
ES |
| network_name_str |
España |
| repository_id_str |
|
| spelling |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport unitsMorales Fusco, PauPedrielli, GiuliaZhou, ChenhaoLee, LooChew, EkMathematical programmingPick up and delivery problem with time windowsInterterminal transfer[EN] In most large port cities, the challenge of inter-terminal transfers (ITT) prevails due to the long distance between multiple terminals. The quantity of containers requiring movement between terminals as they connect from pre-carrier to on-carrier is increasing with the formation of the mega-alliances. The paper proposes a continuous time mathematical programming model to optimize the deployment and schedule of trucks and barges to minimize the number of operating transporters, their makespan, costs and the distance travelled by the containers by choosing the right combination of transporters and container movements while fulfilling time window restrictions imposed on reception of the containers. A multi-step routing problem is developed where transporters can travel from one terminal to another and/or load or unload containers from a specific batch at each step. The model proves successful in identifying the costless schedule and means of transportation. And a sensibility analysis over the parameters used is provided.Editorial Universitat Politècnica de ValènciaRepositorio Institucional de la Universitat Politècnica de València Riunet20162016-06-01book parthttp://purl.org/coar/resource_type/c_3248VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/bookPartapplication/pdfhttps://riunet.upv.es/handle/10251/90339reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) http://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/903392026-06-13T07:49:27Z |
| dc.title.none.fl_str_mv |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units |
| title |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units |
| spellingShingle |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units Morales Fusco, Pau Mathematical programming Pick up and delivery problem with time windows Interterminal transfer |
| title_short |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units |
| title_full |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units |
| title_fullStr |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units |
| title_full_unstemmed |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units |
| title_sort |
Inter-terminal transfer between port terminals. A continuous mathematical programming model to optimize scheduling and deployment of transport units |
| dc.creator.none.fl_str_mv |
Morales Fusco, Pau Pedrielli, Giulia Zhou, Chenhao Lee, Loo Chew, Ek |
| author |
Morales Fusco, Pau |
| author_facet |
Morales Fusco, Pau Pedrielli, Giulia Zhou, Chenhao Lee, Loo Chew, Ek |
| author_role |
author |
| author2 |
Pedrielli, Giulia Zhou, Chenhao Lee, Loo Chew, Ek |
| author2_role |
author author author author |
| dc.contributor.none.fl_str_mv |
Repositorio Institucional de la Universitat Politècnica de València Riunet |
| dc.subject.none.fl_str_mv |
Mathematical programming Pick up and delivery problem with time windows Interterminal transfer |
| topic |
Mathematical programming Pick up and delivery problem with time windows Interterminal transfer |
| description |
[EN] In most large port cities, the challenge of inter-terminal transfers (ITT) prevails due to the long distance between multiple terminals. The quantity of containers requiring movement between terminals as they connect from pre-carrier to on-carrier is increasing with the formation of the mega-alliances. The paper proposes a continuous time mathematical programming model to optimize the deployment and schedule of trucks and barges to minimize the number of operating transporters, their makespan, costs and the distance travelled by the containers by choosing the right combination of transporters and container movements while fulfilling time window restrictions imposed on reception of the containers. A multi-step routing problem is developed where transporters can travel from one terminal to another and/or load or unload containers from a specific batch at each step. The model proves successful in identifying the costless schedule and means of transportation. And a sensibility analysis over the parameters used is provided. |
| publishDate |
2016 |
| dc.date.none.fl_str_mv |
2016 2016-06-01 |
| dc.type.none.fl_str_mv |
book part http://purl.org/coar/resource_type/c_3248 VoR http://purl.org/coar/version/c_970fb48d4fbd8a85 |
| dc.type.openaire.fl_str_mv |
info:eu-repo/semantics/bookPart |
| format |
bookPart |
| dc.identifier.none.fl_str_mv |
https://riunet.upv.es/handle/10251/90339 |
| url |
https://riunet.upv.es/handle/10251/90339 |
| dc.language.none.fl_str_mv |
Inglés eng |
| language_invalid_str_mv |
Inglés |
| language |
eng |
| dc.rights.none.fl_str_mv |
open access http://purl.org/coar/access_right/c_abf2 Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) http://creativecommons.org/licenses/by-nc-nd/4.0/ |
| dc.rights.openaire.fl_str_mv |
info:eu-repo/semantics/openAccess |
| rights_invalid_str_mv |
open access http://purl.org/coar/access_right/c_abf2 Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) http://creativecommons.org/licenses/by-nc-nd/4.0/ |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf |
| dc.publisher.none.fl_str_mv |
Editorial Universitat Politècnica de València |
| publisher.none.fl_str_mv |
Editorial Universitat Politècnica de València |
| dc.source.none.fl_str_mv |
reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia instname:Universitat Politècnica de València (UPV) |
| instname_str |
Universitat Politècnica de València (UPV) |
| reponame_str |
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| collection |
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| repository.name.fl_str_mv |
|
| repository.mail.fl_str_mv |
|
| _version_ |
1869407697076486144 |
| score |
15.300719 |