MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • High Performance Computation for Engineered Systems (HPCES)
  • View Item
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • High Performance Computation for Engineered Systems (HPCES)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme

Author(s)
Cheng, Yong Leong
Thumbnail
DownloadHPCES023.pdf (451.2Kb)
Metadata
Show full item record
Abstract
Automated Guided Vehicle (AGV) Container-Job deployment is essentially a vehicle-dispatching problem. In this problem, the impact of vehicle dispatching polices on the ship makespan for discharging and/or loading operations is analyzed. In particular, given a storage location for each container to be discharged from the ship and given the current location of each container to be loaded onto the ship, the problem is to propose an efficient deployment scheme to dispatch vehicles to containers so as to minimize the makespan of the ship so as to increase the throughput. The makespan of the ship refers to the time a ship spends at the port for loading and unloading operations. In this paper, we will compare the performance of current deployment scheme used with the new proposed deployment scheme, both with deadlock prediction & avoidance algorithm done in previous study [1]. The prediction & avoidance algorithm predicts and avoids cyclic deadlock. The current deployment scheme, namely pmds makes use of a greedy heuristics which dispatches the available vehicle that will reach the quay with the minimum amount of time the vehicle has to spend waiting for the crane to discharge/load the container from/onto the ship. The new deployment scheme, namely mcf aims to formulate the problem as a minimum cost flow problem, which will then be solved by network simplex code. The two simulation models are implemented using discrete-event simulation software, AutoMod, and the performances of both deployment schemes are analyzed. The simulation results show that the new deployment scheme will result in a higher throughput and lower ship makespan than the current deployment scheme.
Date issued
2002-01
URI
http://hdl.handle.net/1721.1/4014
Series/Report no.
High Performance Computation for Engineered Systems (HPCES);
Keywords
automated guided vehicles, container-job deployment, makespan, minimum cost flow problem

Collections
  • High Performance Computation for Engineered Systems (HPCES)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.