An adaptive large neighborhood search for the discrete and continuous Berth allocation problem
详细信息 查看全文
- 作者：Geraldo Regis Mauria ; geraldo.mauri@ufes.br" class="auth_mail" title="E-mail the corresponding author ; Glaydston Mattos Ribeirob ; glaydston@pet.coppe.ufrj.br" class="auth_mail" title="E-mail the corresponding author ; Luiz Antonio Nogueira Lorenac ; lorena@lac.inpe.br" class="auth_mail" title="E-mail the corresponding author ; Gilbert Laported ; gilbert.laporte@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author
- 关键词：Berth allocation problem ; Metaheuristic ; Adaptive large neighborhood search
- 刊名：Computers and Operations Research
- 出版年：2016
- 出版时间：June 2016
- 年：2016
- 卷：70
- 期：Complete
- 页码：140-154
- 全文大小：2166 K
文摘
- class="listitem" id="list_li0005">
- class="label">•
We propose an Adaptive Large Neighborhood Search (ALNS) heuristic for both discrete and continuous cases of the Berth Allocation Problem.
- class="label">•
A very broad set of instances were used and our heuristic provided good solutions within low computational time.
- class="label">•
A sensitivity analysis was reported by changing the number of ships and berths.
- class="label">•
Statistical tests were performed over the obtained results.
- class="label">•
Our ALNS produced high quality results and was superior to the competing algorithms on most instances.