Integrated storage space allocation and ship scheduling problem in bulk cargo terminals. Issue 5 (3rd May 2016)

• Record Type: Journal Article
• Authors: Tang, Lixin; Sun, Defeng; Liu, Jiyin
• Is Part Of: IIE transactions. Volume 48:Issue 5(2016)
• Page Start: 428
• Page End: 439
• Publication Date: 2016-05-03
• Subjects: Benders decomposition -- integer programming -- valid inequality -- variable reduction tests -- heuristics; Industrial engineering -- Periodicals; Génie industriel; 620
• DOI: 10.1080/0740817X.2015.1063791
• Languages: English
• ISSNs: 0740-817X

Abstract

ABSTRACT: This study is motivated by the practices of large iron and steel companies that have steady and heavy demands for bulk raw materials, such as iron ore, coal, limestone, etc. These materials are usually transported to a bulk cargo terminal by ships (or to a station by trains). Once unloaded, they are moved to and stored in a bulk material stockyard, waiting for retrieval for use in production. Efficient storage space allocation and ship scheduling are critical to achieving high space utilization, low material loss, and low transportation costs. In this article, we study the integrated storage space allocation and ship scheduling problem in the bulk cargo terminal. Our problem is different from other associated problems due to the special way that the materials are transported and stored. A novel mixed-integer programming model is developed and then solved using a Benders decomposition algorithm, which is enhanced by the use of various valid inequalities, combinatorial Benders cuts, variable reduction tests, and an iterative heuristic procedure. Computational results indicate that the proposed solution method is much more efficient than the standard solution software CPLEX.