Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem

Oliveira, Rudinei Martins de; Mauri, Geraldo Regis; Lorena, Luiz Antônio Nogueira

doi:10.1007/978-3-642-29124-1_5

Cited by 12 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Mauri et al (2011) developed a memetic algorithm to solve the continuous BAP. de Oliveira et al (2012) presented a clustering search method with a simulated annealing (CS-SA) heuristic to solve the continuous BAP. They tested their method using data from Cordeau et al (2005).…”

Section: Literature Reviewmentioning

confidence: 99%

“…Heuristic method might be a better solution approach for solving large scale BAP within short computational time. The best heuristics for solving the continuous BAP are the GA developed by Frojan et al (2015), and the CS-SA proposed by de Oliveira et al (2012). In this paper, a dynamic continuous BAP with preferred position is studied and solved using simulated annealing algorithms.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem

Lin

Ting

2017

Flex Serv Manuf J

View full text Add to dashboard Cite

The berth allocation problem is an optimization problem concerning seaside operations at container terminals. This study investigates the dynamic and continuous berth allocation problem (BAP), whose objective is to minimize the total weighted service time and the deviation cost from vessels' preferred position. The problem is formulated as a mixed integer programming model. Due to that the BAP is NP-hard, two efficient and effective simulated annealing (SA) algorithms are proposed to locate vessels along the quay. The first SA assigns vessels to available positions along the quay from the left to the right, while the second assigns vessels from both sides. Both small and large-scale instances in the literature are tested to evaluate the effectiveness of the proposed SA algorithms using the optimization software Gurobi and heuristic algorithms from the literature. The results indicate that the proposed SAs can provide optimal solutions in small-scale instances and updates the best solutions in large-scale instances. The improvement over other comparing heuristics is statistically significant.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem

Lin

Ting

2017

Flex Serv Manuf J

View full text Add to dashboard Cite

show abstract

“…Hansen et al (2008) propuseram uma meta-heurística Variable Neighborhood Search. Oliveira et al (2012) propuseram uma meta-heurística Clustering Search. Barros et al (2011) apresentaram um modelo para portos graneleiros considerando variação de maré e utilizaram a meta-heurística SA.…”

Section: Problema De Alocação De Berços (Pab)unclassified

Modelo matemático e meta-heurística Simulated Annealing para o problema de alocação de berços com múltiplas cargas

et al. 2016

Self Cite

View full text Add to dashboard Cite

Ocorre no Brasil um forte crescimento do comércio exterior na área de granéis, como minério de ferro e agrícolas que são exportados pelos portos. Assim, metodologias que auxiliem o planejamento da operação dos portos são importantes. Este artigo propõe um modelo matemático aplicado a um porto de granel que difere dos demais por três itens: 1) berços operam mais de um tipo de carga e com taxas de operação diferentes para cada um, 2) certas cargas não são operadas em todos os berços, 3) o tempo de operação é dependente do berço e da carga. O modelo proposto elabora a sequência de atendimento dos navios em cada berço e foi implementado no CPLEX 12.6. Como soluções ótimas são difíceis de serem alcançadas, é proposta também uma meta-heurística Simulated Annealing (SA). Para avaliação do modelo e do SA, foram realizados testes com dados reais do Complexo Portuário de Tubarão.

show abstract

Simulated Annealing Algorithm for Berth Allocation Problems

Line

Ting

2013

Proceedings of the Institute of Industrial Engineers Asian Conference 2013

View full text Add to dashboard Cite

Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem

Cited by 12 publications

References 22 publications

Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem

Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem

Modelo matemático e meta-heurística Simulated Annealing para o problema de alocação de berços com múltiplas cargas

Simulated Annealing Algorithm for Berth Allocation Problems

Contact Info

Product

Resources

About