Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme
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 b...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | en_US |
| Published: |
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/4014 |
| _version_ | 1826213194479173632 |
|---|---|
| author | Cheng, Yong Leong |
| author_facet | Cheng, Yong Leong |
| author_sort | Cheng, Yong Leong |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T15:44:48Z |
| format | Article |
| id | mit-1721.1/4014 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:44:48Z |
| publishDate | 2003 |
| record_format | dspace |
| spelling | mit-1721.1/40142019-04-11T08:44:08Z Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme Cheng, Yong Leong automated guided vehicles container-job deployment makespan minimum cost flow problem 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. Singapore-MIT Alliance (SMA) 2003-12-23T03:12:51Z 2003-12-23T03:12:51Z 2002-01 Article http://hdl.handle.net/1721.1/4014 en_US High Performance Computation for Engineered Systems (HPCES); 462108 bytes application/pdf application/pdf |
| spellingShingle | automated guided vehicles container-job deployment makespan minimum cost flow problem Cheng, Yong Leong Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme |
| title | Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme |
| title_full | Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme |
| title_fullStr | Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme |
| title_full_unstemmed | Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme |
| title_short | Simulation Study of a Semi-Dynamic AGV-Container Unit Job Deployment Scheme |
| title_sort | simulation study of a semi dynamic agv container unit job deployment scheme |
| topic | automated guided vehicles container-job deployment makespan minimum cost flow problem |
| url | http://hdl.handle.net/1721.1/4014 |
| work_keys_str_mv | AT chengyongleong simulationstudyofasemidynamicagvcontainerunitjobdeploymentscheme |