Models for the discrete berth allocation problem: A computational comparison

Buhrkal, Katja Frederik; Zuglian, Sara; Røpke, Stefan; Larsen, Jesper; Lusby, Richard Martin

doi:10.1016/j.tre.2010.11.016

Cited by 141 publications

(72 citation statements)

References 29 publications

(64 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The mathematical formulation GSPP implemented by using CPLEX 2 in [2] provides the optimal solution in 17.92 seconds in the worst case. However, as highlighted in [11], GSPP can require large amounts of memory and computational time, depending on the complexity of the instances.…”

Section: Computational Resultsmentioning

confidence: 99%

Decentralized Cooperative Metaheuristic for the Dynamic Berth Allocation Problem

Lalla-Ruiz¹,

Expósito‐Izquierdo²,

Batista³

et al. 2015

View full text Add to dashboard Cite

The increasing demand of maritime transport and the great competition among port terminals force their managers to reduce costs by exploiting its resources accurately. In this environment, the Berth Allocation Problem, which aims to allocate and schedule incoming vessels along the quay, plays a relevant role in improving the overall terminal productivity. In order to address this problem, we propose Decentralized Cooperative Metaheuristic (DCM), which is a population-based approach that exploits the concepts of communication and grouping. In DCM, the individuals are organized into groups, where each individual shares information with its group partners. This grouping strategy allows to diversify as well as intensify the search in some regions by means of information shared among the individuals of each group. Moreover, the constrained relation for sharing information among individuals through the proposed grouping strategy allows to reduce computational resources in comparison to the 'all to all' communication strategy. The computational experiments for this problem reveal that DCM reports high-quality solutions and identifies promising regions within the search space in short computational times.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Decentralized Cooperative Metaheuristic for the Dynamic Berth Allocation Problem

Lalla-Ruiz¹,

Expósito‐Izquierdo²,

Batista³

et al. 2015

View full text Add to dashboard Cite

show abstract

“…In addition, they provided a meta-heuristic to deal with problems of practical size. Buhrkal et al [38] also dealt with the BAP with discrete berths. Having investigated three relevant models for solving the BAP, they improved one of the three models.…”

Section: Studies Focusing On Bap or Qcapmentioning

confidence: 99%

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

et al. 2017

View full text Add to dashboard Cite

Container terminals (CTs) play an essential role in the global transportation system. To deal with growing container shipments, a CT needs to better solve the three essential seaside operational problems; berth allocation problem (BAP), quay crane assignment problem (QCAP), and quay crane scheduling problem (QCSP), which affect the performance of a CT considerably. In past studies, the three seaside operational problems have often been solved individually or partially, which is likely to result in poor overall system performance. However, solving the three seaside operational problems simultaneously is in fact a very complicated task. In this research, we dealt with the three seaside operational problems at the same time by using a novel high-level Petri net, termed an Object-Oriented and Timed Predicate/Transition Net (OOTPr/Tr net). After defining the three seaside operational problems formally, we integrated them as a three-level framework that was further transformed into an OOTPr/Tr net model. Then, using the Prolog programming language, we implemented this model as a simulation tool to find the best solution based on the various combinations of heuristic rules used.

show abstract

“…Mas neste ponto, os artigos também diferem, pois no modelo proposto por eles são considerados somente os valores pagos de multa e não é levado em conta valores recebidos de prêmio, enquanto no modelo proposto neste presente artigo leva em conta o resultado financeiro advindo dos valores recebidos de prêmio menos os valores pagos de multa. Buhrkal et al (2011) realizaram um comparativo entre o PABD, PABC e PABH, utilizando uma perspectiva computacional por meio de extensos testes numéricos. Ting et al (2013) formularam um modelo de Programação Inteira Mista (PIM) a partir da atribuição dos navios aos berços e com o objetivo de minimizar o tempo total de espera e o tempo de manuseio para os navios.…”

Section: Referencial Teóricounclassified

Modelo matemático para planejamento da atracação de navios sob o contrato de Charter Party

Vervloet

Rosa

2016

TRANSPORTES

View full text Add to dashboard Cite

INTRODUÇÃOO transporte marítimo desempenha um papel fundamental para o comércio internacional, que integrado a outros sistemas de transportes, representa o meio de transporte de grande parte da carga movimentada no mundo. No modo marítimo, a movimentação de granel sólido em 2013 foi em torno de 10 bilhões de toneladas. O sistema portuário brasileiro responde por aproximadamente 90% das exportações e importações no país, sendo que as cargas a granel movimentaram 61% da movimentação total em 2014 (UNCTAD, 2014).Os navios de granel, como minério de ferro e agrícolas, são usualmente contratados sob o contrato de Charter Party entre o armador (dono do navio) e o embarcador. As cargas a granel são usualmente transportadas em grande quantidade e, assim, muitas empresas que comercializam estas cargas optam por ter seus próprios portos ou por operarem terminais portuários específicos para suas cargas. A partir deste ponto, define-se para efeitos deste artigo que quando se referenciar ao embarcador, entende-se por um embarcador que é proprietário do porto ou um embarcador operador de um terminal específico dedicado às suas operações.Resumo: Navios de carga granel são usualmente contratados sob o contrato Charter Party entre o armador e o embarcador. Neste contrato é estabelecido um tempo limite de permanência do navio no porto. Caso o navio permaneça abaixo deste tempo, o embarcador recebe um prêmio financeiro e, caso contrário, paga uma multa ao armador. Após a revisão bibliográfica, não foram encontrados artigos sobre o Problema de Alocação de Berços (PAB) que tratassem das questões referentes a prêmio e multa sob a ótica do contrato Charter Party com o objetivo de maximizar o resultado financeiro do embarcador, calculado como prêmio menos multa. Assim, um modelo matemático é proposto para o PAB com considerações sobre a Charter Party e, instâncias baseadas no Porto de Tubarão foram desenvolvidas e executadas no CPLEX 12.6. Os resultados mostraram a aplicabilidade do modelo na programação dos navios e também diretrizes para apoiar a negociação deste tipo de contrato.Palavras-chave: Problema de Alocação de Berço (PAB), Charter Party, Logística Portuária, Portos Graneleiros.Abstract: Bulk cargo ships are usually contracted under the Charter Party contract between the owner and the shipper. This contract establishes a time limit for vessel to stay at port. If the vessel is below this time the shipper receives a financial award and, if not, pay a fine to the owner. After the literature review, no articles were found on the Berth Allocation Problem (BAP) that addressed the issues related to premium and fine from the perspective of Charter Party contract in order to maximize the financial result of the shipper, calculated as a reward less fine. Thus, a mathematical model is proposed for the BAP with consideration of the Charter Party, and instances based in the Port of Tubarão were developed and implemented in CPLEX 12.6. The results showed the applicability of the model in the scheduling of ships and also guidelines to suppo...

show abstract

Models for the discrete berth allocation problem: A computational comparison

Cited by 141 publications

References 29 publications

Decentralized Cooperative Metaheuristic for the Dynamic Berth Allocation Problem

Decentralized Cooperative Metaheuristic for the Dynamic Berth Allocation Problem

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

Modelo matemático para planejamento da atracação de navios sob o contrato de Charter Party

Contact Info

Product

Resources

About