File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A load scattering algorithm for dynamic routing of automated material handling systems

TitleA load scattering algorithm for dynamic routing of automated material handling systems
Authors
Issue Date2007
Citation
2006 International Conference On Computational Intelligence And Security, Iccias 2006, 2007, v. 2, p. 1020-1025 How to Cite?
AbstractAn agent-based dynamic routing strategy for a generic automated material handling systems (AMHS) is developed. The strategy employs an agent-based paradigm in which the control points of a network of AMHS components are modelled as cooperating node agents. With the inherent features of route discovery a set of shortest and near-shortest path, an average-flow route selection algorithm is developed to scatter the load of an AMHS. Their performance is investigated through a detailed simulation study. The performance of the proposed dynamic routing strategy is benchmarked with the shortest path algorithm. The results of the simulation experiments are presented and their performance compared under a number of performance indices including the hop count, flow and ability to balance network loading. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/100185
References

 

DC FieldValueLanguage
dc.contributor.authorNg, AKSen_HK
dc.contributor.authorEfstathiou, Jen_HK
dc.contributor.authorLau, HYKen_HK
dc.date.accessioned2010-09-25T19:00:03Z-
dc.date.available2010-09-25T19:00:03Z-
dc.date.issued2007en_HK
dc.identifier.citation2006 International Conference On Computational Intelligence And Security, Iccias 2006, 2007, v. 2, p. 1020-1025en_HK
dc.identifier.urihttp://hdl.handle.net/10722/100185-
dc.description.abstractAn agent-based dynamic routing strategy for a generic automated material handling systems (AMHS) is developed. The strategy employs an agent-based paradigm in which the control points of a network of AMHS components are modelled as cooperating node agents. With the inherent features of route discovery a set of shortest and near-shortest path, an average-flow route selection algorithm is developed to scatter the load of an AMHS. Their performance is investigated through a detailed simulation study. The performance of the proposed dynamic routing strategy is benchmarked with the shortest path algorithm. The results of the simulation experiments are presented and their performance compared under a number of performance indices including the hop count, flow and ability to balance network loading. © 2006 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartof2006 International Conference on Computational Intelligence and Security, ICCIAS 2006en_HK
dc.titleA load scattering algorithm for dynamic routing of automated material handling systemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLau, HYK:hyklau@hkucc.hku.hken_HK
dc.identifier.authorityLau, HYK=rp00137en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICCIAS.2006.295418en_HK
dc.identifier.scopuseid_2-s2.0-38949173933en_HK
dc.identifier.hkuros119164en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-38949173933&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2en_HK
dc.identifier.spage1020en_HK
dc.identifier.epage1025en_HK
dc.identifier.scopusauthoridNg, AKS=7202763566en_HK
dc.identifier.scopusauthoridEfstathiou, J=7003756469en_HK
dc.identifier.scopusauthoridLau, HYK=7201497761en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats