Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
The steel plate yard of shipbuilding separates the inbound and pre-processing operations, increasing the number of moves. This paper considers the mixed inbound and pre-processing operation and studies the stack inbound and pre-marshalling problem where storage and relocation moves can alternate. This problem aims to find a minimum operation to store all inbound plates while eliminating all blocking plates. The authors propose a novel integer programming model combining two moves in one time period. This model reduces the number of periods, thereby decreasing the model size, but requires extra constraints to avoid infeasible patterns. An exact branch-and-cut algorithm is introduced to tackle the influence of these extra constraints. This paper provides a new modeling approach for stack-related problems, and the experiments show that the proposed method outperforms other ILP-based methods in the literature.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/oclc/1793974
-
Supplemental Notes:
- © 2023 Published by Elsevier Ltd. Abstract reprinted with permission of Elsevier.
-
Authors:
- Wu, Lebao
- Jiang, Zuhua
- Wang, Fuhua
-
0000-0002-9425-9640
- Publication Date: 2023-7
Language
- English
Media Info
- Media Type: Web
- Features: References;
- Pagination: 106238
-
Serial:
- Computers & Operations Research
- Volume: 155
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 0305-0548
- Serial URL: https://www.sciencedirect.com/journal/computers-and-operations-research
Subject/Index Terms
- TRT Terms: Branch and bound algorithms; Integer programming; Shipyards; Steel plates; Storage facilities
- Subject Areas: Data and Information Technology; Marine Transportation; Materials; Vehicles and Equipment;
Filing Info
- Accession Number: 01886336
- Record Type: Publication
- Files: TRIS
- Created Date: Jun 28 2023 4:29PM