Solving the container pre-marshalling problem using variable length genetic algorithms. Issue 4 (2nd April 2016)

• Record Type: Journal Article
• Authors: Gheith, Mohamed; Eltawil, Amr B.; Harraz, Nermine A.
• Is Part Of: Engineering optimization. Volume 48:Issue 4(2016)
• Page Start: 687
• Page End: 705
• Publication Date: 2016-04-02
• Subjects: container pre-marshalling -- variable chromosome length -- genetic algorithm -- container terminals -- heuristics; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2015.1031661
• Languages: English
• ISSNs: 0305-215X

Abstract

Abstract : In container terminals, the yard area consists of a set of blocks, which consists of a set of bays. Each bay consists of a set of stacks, which consists of a set of tiers. In the container pre-marshalling problem, an initial layout of a bay is converted to a final desired layout. The final layout follows the given loading schedule of this bay. This has a direct impact on the most important container terminal performance measure: the vessel loading time. The deviation between the current layout and the desired layout is expressed by the value of the mis-overlays. The objective of the pre-marshalling problem is to eliminate the mis-overlays with the minimum number of container movements. In this article, a variable chromosome length genetic algorithm was applied to solve the problem. The results of the new solution approach were compared against benchmark instances and the results were remarkably better.