Dynamic AGV-Container Job Deployment Strategy
Automated Guided Vehicles (AGVs) are now becoming popular in container-handling applications at seaport. Efficacy of the dispatching strategy adopted to deploy AGVs is a prime factor affecting the performance of the entire system. The objective of this project is thus to develop an efficient dispatc...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | en_US |
| Published: |
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/3998 |
| _version_ | 1811080231144914944 |
|---|---|
| author | Sen, Hock Chan |
| author_facet | Sen, Hock Chan |
| author_sort | Sen, Hock Chan |
| collection | MIT |
| description | Automated Guided Vehicles (AGVs) are now becoming popular in container-handling applications at seaport. Efficacy of the dispatching strategy adopted to deploy AGVs is a prime factor affecting the performance of the entire system. The objective of this project is thus to develop an efficient dispatching strategy to deploy AGVs in a container terminal.
The scenario considered was a container terminal where containers are uploaded to and discharged from ships. Discharged containers are stored at specific storage locations in the terminal yard. Containers are moved between dock and yard by a dedicated fleet of AGVs. At any point of time, each AGV carries at most two containers. This two-container load may comprise of any plausible permutation of containers for discharge or upload. To reduce congestion and increase utility level, an efficient dispatching strategy for AGVs is paramount.
At present, a variety of heuristic methods for dispatching AGVs are available, but these methods were primarily developed to work in a manufacturing context where the network structure is uncomplicated and only a small number of AGVs are required. The situation under consideration entails greater network complexity and also a large fleet of close to 80 AGVs.
In this study, the problem was modeled via network flows with constraints, which describe the disparate instances when the AGV carries one container and when it carries two. Heuristic algorithms based on this model are proposed and their performance investigated. |
| first_indexed | 2024-09-23T11:27:55Z |
| format | Article |
| id | mit-1721.1/3998 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:27:55Z |
| publishDate | 2003 |
| record_format | dspace |
| spelling | mit-1721.1/39982019-04-10T08:59:57Z Dynamic AGV-Container Job Deployment Strategy Sen, Hock Chan Automated Guided Vehicles seaport container handling dispatching strategy container terminal network flows heuristic algorithms Automated Guided Vehicles (AGVs) are now becoming popular in container-handling applications at seaport. Efficacy of the dispatching strategy adopted to deploy AGVs is a prime factor affecting the performance of the entire system. The objective of this project is thus to develop an efficient dispatching strategy to deploy AGVs in a container terminal. The scenario considered was a container terminal where containers are uploaded to and discharged from ships. Discharged containers are stored at specific storage locations in the terminal yard. Containers are moved between dock and yard by a dedicated fleet of AGVs. At any point of time, each AGV carries at most two containers. This two-container load may comprise of any plausible permutation of containers for discharge or upload. To reduce congestion and increase utility level, an efficient dispatching strategy for AGVs is paramount. At present, a variety of heuristic methods for dispatching AGVs are available, but these methods were primarily developed to work in a manufacturing context where the network structure is uncomplicated and only a small number of AGVs are required. The situation under consideration entails greater network complexity and also a large fleet of close to 80 AGVs. In this study, the problem was modeled via network flows with constraints, which describe the disparate instances when the AGV carries one container and when it carries two. Heuristic algorithms based on this model are proposed and their performance investigated. Singapore-MIT Alliance (SMA) 2003-12-23T02:16:27Z 2003-12-23T02:16:27Z 2002-01 Article http://hdl.handle.net/1721.1/3998 en_US High Performance Computation for Engineered Systems (HPCES); 159439 bytes application/pdf application/pdf |
| spellingShingle | Automated Guided Vehicles seaport container handling dispatching strategy container terminal network flows heuristic algorithms Sen, Hock Chan Dynamic AGV-Container Job Deployment Strategy |
| title | Dynamic AGV-Container Job Deployment Strategy |
| title_full | Dynamic AGV-Container Job Deployment Strategy |
| title_fullStr | Dynamic AGV-Container Job Deployment Strategy |
| title_full_unstemmed | Dynamic AGV-Container Job Deployment Strategy |
| title_short | Dynamic AGV-Container Job Deployment Strategy |
| title_sort | dynamic agv container job deployment strategy |
| topic | Automated Guided Vehicles seaport container handling dispatching strategy container terminal network flows heuristic algorithms |
| url | http://hdl.handle.net/1721.1/3998 |
| work_keys_str_mv | AT senhockchan dynamicagvcontainerjobdeploymentstrategy |