|
DSpace at MIT >
MIT Libraries >
MIT Theses >
Theses - Computation for Design and Optimization >
Computation for Design and Optimization - Master's degree >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1721.1/39219
|
| Title: | The crane split and sequencing problem with clearance and yard congestion constraints in container terminal ports |
| Authors: | Choo, Shawn (Shawn Sheng Wen) |
| Advisor: | David Simchi-Levi. |
| Department: | Massachusetts Institute of Technology. Computation for Design and Optimization Program. |
| Other contributors: | Massachusetts Institute of Technology. Computation for Design and Optimization Program. |
| Keywords: | Computation for Design and Optimization Program. |
| Issue Date: | 2006 |
| Publisher: | Massachusetts Institute of Technology |
| Abstract: | One of the steps in stowage planning is crane split and sequencing, which determines the order of container discharging and loading jobs quay cranes (QCs) perform so that the completion time (or makespan) of ship operation is minimized. The vessel's load profile, number of bays and number of allocated QCs are known to port-planners hours before its arrival, and these are input parameters to the problem. The problem is modeled as a large-scale linear IP where the planning horizon is discretized into time intervals and at most one QC can be assigned to a bay at any period. We introduce clearance constraints, which prevent adjacent QCs from being positioned too close to one another, and yard congestion constraints, which prevent yard storage locations from being overly accessed at any time. This makes the model relevant in an industrial setting. We examine the case only a single ship arrives at port, and the case where multiple ships berth at different times in the planning horizon. The berth time of each ship and number of ships arriving is known. The problem is difficult to solve without any special technique applied. For the single-ship problem, a heuristic approach, which produces high-quality solutions, is developed.
(cont.) A branch-and-price method re-formulates the problem into a set-covering form with huge number of variables; standard variable branching provides optimal solutions very efficiently. For the multiple-ship problem, a solution strategy is developed combining Lagrangian relaxation, branch-and-price and heuristics. After relaxing the yard congestion constraints, the problem decomposes into smaller sub-problems, each involving one ship; the sub-problems are then re-formulated into a column generation form and solved using branch-and-price to obtain Lagrangian solutions and lower-bound values. Lagrangian multipliers are iteratively updated using the sub-gradient method. A primal heuristic detects and eliminates infeasibilities in the Lagrangian solutions which then become an upper bound to the optimal objective. Once the duality gap is sufficiently reduced, the sub-gradient routine is terminated. The availability of efficient commercial modeling software such as OPL Studio and CPLEX allows for larger instances of the problem to be tackled than previously possible. |
| Description: | Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2006.
Includes bibliographical references (p. 93-94). |
| URI: | http://hdl.handle.net/1721.1/39219 |
| Appears in Collections: | Computation for Design and Optimization - Master's degree
Computation for Design and Optimization - Master's degree
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 85844395.pdf | Preview, non-printable (open to all) | 4272Kb | Adobe PDF | View/Open | | 85844395-MIT.pdf | Full printable version (MIT only) | 4272Kb | Adobe PDF | View/Open |
|
|  |
This item is protected by original copyright
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
