MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10773/18404 |
Resumo: | In this paper we consider an integrated berth allocation and quay crane assignment and scheduling problem motivated by a real case where a heterogeneous set of cranes is considered. A first mathematical model based on the {\it relative position formulation} (RPF) for the berth allocation aspects is presented. Then, a new model is introduced to avoid the big-M constraints included in the RPF. This model results from a discretization of the time and space variables. For the new discretized model several enhancements, such as valid inequalities, are introduced. In order to derive good feasible solutions, a rolling horizon heuristic (RHH) is presented. A branch and cut approach that uses the enhanced discretized model and incorporates the upper bounds provided by the RHH solution is proposed. Computational tests are reported to show (i) the quality of the linear relaxation of the enhanced models; (ii) the effectiveness of the exact approach to solve to optimality a set of real instances; and (iii) the scalability of the RHH based on the enhanced mathematical model which is able to provide good feasible solutions for large size instances. |
id |
RCAP_792f2422406ef7ccbc02b080c5bee318 |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/18404 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problemBerth allocationQuay crane schedulingMixed integer formulationsBranch and cutRolling horizon heuristicIn this paper we consider an integrated berth allocation and quay crane assignment and scheduling problem motivated by a real case where a heterogeneous set of cranes is considered. A first mathematical model based on the {\it relative position formulation} (RPF) for the berth allocation aspects is presented. Then, a new model is introduced to avoid the big-M constraints included in the RPF. This model results from a discretization of the time and space variables. For the new discretized model several enhancements, such as valid inequalities, are introduced. In order to derive good feasible solutions, a rolling horizon heuristic (RHH) is presented. A branch and cut approach that uses the enhanced discretized model and incorporates the upper bounds provided by the RHH solution is proposed. Computational tests are reported to show (i) the quality of the linear relaxation of the enhanced models; (ii) the effectiveness of the exact approach to solve to optimality a set of real instances; and (iii) the scalability of the RHH based on the enhanced mathematical model which is able to provide good feasible solutions for large size instances.Elsevier2018-012018-01-01T00:00:00Z2019-12-26T16:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/18404eng0377-221710.1016/j.ejor.2017.05.040Agostinho AgraOliveira, Maryseinfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T11:34:41Zoai:ria.ua.pt:10773/18404Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:53:02.973556Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem |
title |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem |
spellingShingle |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem Agostinho Agra Berth allocation Quay crane scheduling Mixed integer formulations Branch and cut Rolling horizon heuristic |
title_short |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem |
title_full |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem |
title_fullStr |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem |
title_full_unstemmed |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem |
title_sort |
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem |
author |
Agostinho Agra |
author_facet |
Agostinho Agra Oliveira, Maryse |
author_role |
author |
author2 |
Oliveira, Maryse |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Agostinho Agra Oliveira, Maryse |
dc.subject.por.fl_str_mv |
Berth allocation Quay crane scheduling Mixed integer formulations Branch and cut Rolling horizon heuristic |
topic |
Berth allocation Quay crane scheduling Mixed integer formulations Branch and cut Rolling horizon heuristic |
description |
In this paper we consider an integrated berth allocation and quay crane assignment and scheduling problem motivated by a real case where a heterogeneous set of cranes is considered. A first mathematical model based on the {\it relative position formulation} (RPF) for the berth allocation aspects is presented. Then, a new model is introduced to avoid the big-M constraints included in the RPF. This model results from a discretization of the time and space variables. For the new discretized model several enhancements, such as valid inequalities, are introduced. In order to derive good feasible solutions, a rolling horizon heuristic (RHH) is presented. A branch and cut approach that uses the enhanced discretized model and incorporates the upper bounds provided by the RHH solution is proposed. Computational tests are reported to show (i) the quality of the linear relaxation of the enhanced models; (ii) the effectiveness of the exact approach to solve to optimality a set of real instances; and (iii) the scalability of the RHH based on the enhanced mathematical model which is able to provide good feasible solutions for large size instances. |
publishDate |
2018 |
dc.date.none.fl_str_mv |
2018-01 2018-01-01T00:00:00Z 2019-12-26T16:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10773/18404 |
url |
http://hdl.handle.net/10773/18404 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0377-2217 10.1016/j.ejor.2017.05.040 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799137581643857920 |