Please use this identifier to cite or link to this item:
Title: Routing algorithms for automated guided vehicles for container operations
Authors: Wang, Yu Hsin
Keywords: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
DRNTU::Engineering::Computer science and engineering::Data::Data structures
Issue Date: 2014
Abstract: Currently, there are many routing and dispatching techniques for Automated Guided Vehicle System (AGVS), but the well-known issue – “traffic congestion” still happens in the AGVS. This Final Year Project (FYP) addresses this issue by studying and examining a new technique called Linked Vehicles in order to alleviate the traffic congestion. The idea comes from Road Train in highway which helps to reduce energy consumptions, decrease travel time and also reduce the traffic incidences. The knowledge about Road Train is applied to AGVS, and the implementation of Linked Vehicle is further divided into two approaches. This FYP examines two approaches and evaluate their performance under several metrics. Furthermore, the Linked Vehicle technique is applied in different routing algorithms and dispatching rules, and studies the performance in each situation. For this project, besides the routing algorithms; an automated data collection tool is constructed to automatically gather data for analysis. This tool provides a convenient way for users to explore and analyze different techniques applied in Linked Vehicles Approach. Last but not least, this FYP performed a series of experiments to analyze the performance of the Linked Vehicles Approach.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
FYP Report.pdf
  Restricted Access
2.99 MBAdobe PDFView/Open

Page view(s) 50

checked on Sep 29, 2020

Download(s) 50

checked on Sep 29, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.