A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan

Raka Jovanovic, Shunji Tanaka, Tatsushi Nishi, Stefan Voß

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we present a method for finding high quality solutions for the Blocks Relocation Problem with Stowage Plan (BRLP). The interest for this problem comes from the fact that previous research has shown that a significant amount of savings can be achieved, if the process of specifying the loading sequence takes into account both the state of the bay and the stowage plan. In this work, we propose a two step greedy algorithm for the BRLP. In the first one, a heuristic is used to select the next container to be loaded into the vessel. In the second step, a new heuristic is used to relocate obstructing containers. The solutions acquired in this way are improved using a correction procedure. The idea of the correction procedure is to use a heuristic approach to recognize undesirable properties of a solution and remove them. Finally, the method is extended towards the GRASP metaheuristic. Our computational experiments show that the proposed approach manages to significantly outperform existing methods for the BRLP.

Original languageEnglish
JournalFlexible Services and Manufacturing Journal
DOIs
Publication statusAccepted/In press - 1 Jan 2018

Fingerprint

Relocation
Containers
Heuristics
Experiments
Container

Keywords

  • Blocks relocation problem
  • GRASP
  • Heuristics
  • Maritime shipping
  • Stowage plan

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan. / Jovanovic, Raka; Tanaka, Shunji; Nishi, Tatsushi; Voß, Stefan.

In: Flexible Services and Manufacturing Journal, 01.01.2018.

Research output: Contribution to journalArticle

@article{94c2e91efabe4d90ba1ef7d78848a8b4,
title = "A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan",
abstract = "In this paper, we present a method for finding high quality solutions for the Blocks Relocation Problem with Stowage Plan (BRLP). The interest for this problem comes from the fact that previous research has shown that a significant amount of savings can be achieved, if the process of specifying the loading sequence takes into account both the state of the bay and the stowage plan. In this work, we propose a two step greedy algorithm for the BRLP. In the first one, a heuristic is used to select the next container to be loaded into the vessel. In the second step, a new heuristic is used to relocate obstructing containers. The solutions acquired in this way are improved using a correction procedure. The idea of the correction procedure is to use a heuristic approach to recognize undesirable properties of a solution and remove them. Finally, the method is extended towards the GRASP metaheuristic. Our computational experiments show that the proposed approach manages to significantly outperform existing methods for the BRLP.",
keywords = "Blocks relocation problem, GRASP, Heuristics, Maritime shipping, Stowage plan",
author = "Raka Jovanovic and Shunji Tanaka and Tatsushi Nishi and Stefan Vo{\ss}",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/s10696-018-9320-3",
language = "English",
journal = "Flexible Services and Manufacturing Journal",
issn = "1936-6582",
publisher = "Springer New York",

}

TY - JOUR

T1 - A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan

AU - Jovanovic, Raka

AU - Tanaka, Shunji

AU - Nishi, Tatsushi

AU - Voß, Stefan

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In this paper, we present a method for finding high quality solutions for the Blocks Relocation Problem with Stowage Plan (BRLP). The interest for this problem comes from the fact that previous research has shown that a significant amount of savings can be achieved, if the process of specifying the loading sequence takes into account both the state of the bay and the stowage plan. In this work, we propose a two step greedy algorithm for the BRLP. In the first one, a heuristic is used to select the next container to be loaded into the vessel. In the second step, a new heuristic is used to relocate obstructing containers. The solutions acquired in this way are improved using a correction procedure. The idea of the correction procedure is to use a heuristic approach to recognize undesirable properties of a solution and remove them. Finally, the method is extended towards the GRASP metaheuristic. Our computational experiments show that the proposed approach manages to significantly outperform existing methods for the BRLP.

AB - In this paper, we present a method for finding high quality solutions for the Blocks Relocation Problem with Stowage Plan (BRLP). The interest for this problem comes from the fact that previous research has shown that a significant amount of savings can be achieved, if the process of specifying the loading sequence takes into account both the state of the bay and the stowage plan. In this work, we propose a two step greedy algorithm for the BRLP. In the first one, a heuristic is used to select the next container to be loaded into the vessel. In the second step, a new heuristic is used to relocate obstructing containers. The solutions acquired in this way are improved using a correction procedure. The idea of the correction procedure is to use a heuristic approach to recognize undesirable properties of a solution and remove them. Finally, the method is extended towards the GRASP metaheuristic. Our computational experiments show that the proposed approach manages to significantly outperform existing methods for the BRLP.

KW - Blocks relocation problem

KW - GRASP

KW - Heuristics

KW - Maritime shipping

KW - Stowage plan

UR - http://www.scopus.com/inward/record.url?scp=85050795228&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050795228&partnerID=8YFLogxK

U2 - 10.1007/s10696-018-9320-3

DO - 10.1007/s10696-018-9320-3

M3 - Article

AN - SCOPUS:85050795228

JO - Flexible Services and Manufacturing Journal

JF - Flexible Services and Manufacturing Journal

SN - 1936-6582

ER -