A bi-objective model for robust yard allocation scheduling for outbound containers. Issue 1 (2nd January 2017)

• Record Type: Journal Article
• Authors: Liu, Changchun; Zhang, Canrong; Zheng, Li
• Is Part Of: Engineering optimization. Volume 49:Issue 1(2017)
• Page Start: 113
• Page End: 135
• Publication Date: 2017-01-02
• Subjects: Seaport terminals -- yard allocation -- bi-objective -- robustness; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2016.1170826
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This article examines the yard allocation problem for outbound containers, with consideration of uncertainty factors, mainly including the arrival and operation time of calling vessels. Based on the time buffer inserting method, a bi-objective model is constructed to minimize the total operational cost and to maximize the robustness of fighting against the uncertainty. Due to the NP-hardness of the constructed model, a two-stage heuristic is developed to solve the problem. In the first stage, initial solutions are obtained by a greedy algorithm that looks n -steps ahead with the uncertainty factors set as their respective expected values; in the second stage, based on the solutions obtained in the first stage and with consideration of uncertainty factors, a neighbourhood search heuristic is employed to generate robust solutions that can fight better against the fluctuation of uncertainty factors. Finally, extensive numerical experiments are conducted to test the performance of the proposed method.