Please use this identifier to cite or link to this item:
|Title:||A multi-agent approach for solving optimization problems involving expensive resources||Authors:||Lau, H.C.
|Issue Date:||2005||Citation:||Lau, H.C.,Wang, H. (2005). A multi-agent approach for solving optimization problems involving expensive resources. Proceedings of the ACM Symposium on Applied Computing 1 : 79-83. ScholarBank@NUS Repository. https://doi.org/10.1145/1066677.1066699||Abstract:||In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserably. More specifically, we study the class of bin-packing problems. Under our proposed Fine-Grained Agent System scheme, rational agents work both collaboratively and selfishly based on local search and mimic physics-motivated systems. We apply our approach to a generalization of bin-packing - the Inventory Routing Problem with Time Windows - which is an important logistics problem, and demonstrate the efficiency and effectiveness of our approach. Copyright 2005 ACM.||Source Title:||Proceedings of the ACM Symposium on Applied Computing||URI:||http://scholarbank.nus.edu.sg/handle/10635/41562||DOI:||10.1145/1066677.1066699|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 10, 2019
checked on Jul 5, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.