A heuristic algorithm for operating yard cranes over storage blocks to minimize the handling time in a container yard Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/np193f53m

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • In container terminals, the efficiency of loading operations in a container yard highly depends on the productivity of yard cranes. In loading operation, yard cranes have to pick-up the containers which are stacked in the yard-bays to satisfy the work schedule requirement of quay crane, the equipment for loading and unloading containers to and from a container ship. Therefore, a well managed schedule of yard cranes to pick-up containers has to be considered. This thesis focuses on operating multiple yard cranes among storage blocks, allowing multiple yard cranes over a block of yard-bays. The objective of the pick-up scheduling problem is to minimize the total container handling time, which consists of the traveling distance and the setup time of yard cranes in a container yard. A mixed integer programming model of the pick-up scheduling problem for operating a single yard crane over a storage block has been proposed. The mathematical model has been extended to solve the considered problem for operating multiple yard cranes over storage blocks. It is very difficult to obtain the optimal solution through the commercially available software. A genetic algorithm has been proposed to solve the pick-up scheduling problem for operating multiple yard cranes over storage blocks. To demonstrate the effectiveness of the proposed GA, a randomly generated set of various problem sizes have been tested. The computational results acquired from the experiments show that the proposed GA is an effective method for solving the pick-up scheduling problem of operating multiple yard cranes over storage blocks during a loading operation in a container yard.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2009-07-01T18:22:37Z (GMT) No. of bitstreams: 1 Thesis_Weerakit_May29_2009.pdf: 1731317 bytes, checksum: f16d58eae5e2a44d933d5b5d4b206f55 (MD5)
  • description.provenance : Made available in DSpace on 2009-07-09T13:25:07Z (GMT). No. of bitstreams: 1 Thesis_Weerakit_May29_2009.pdf: 1731317 bytes, checksum: f16d58eae5e2a44d933d5b5d4b206f55 (MD5)
  • description.provenance : Submitted by Weerakit Denkaew (denkaeww@onid.orst.edu) on 2009-06-26T18:58:12Z No. of bitstreams: 1 Thesis_Weerakit_May29_2009.pdf: 1731317 bytes, checksum: f16d58eae5e2a44d933d5b5d4b206f55 (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-07-09T13:25:07Z (GMT) No. of bitstreams: 1 Thesis_Weerakit_May29_2009.pdf: 1731317 bytes, checksum: f16d58eae5e2a44d933d5b5d4b206f55 (MD5)

Relationships

In Administrative Set:
Last modified: 10/20/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items