Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
2005
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.
Discipline
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Publication
Applied Computing 2005: Proceedings of the 2005 ACM Symposium on Applied Computing, Santa Fe, New Mexico, 13-17 March 2005
First Page
79
Last Page
83
ISBN
9781581139648
Identifier
10.1145/1066677.1066699
Publisher
ACM
City or Country
Santa Fe, NM
Citation
LAU, Hoong Chuin and WANG, H..
A Multi-Agent Approach for Solving Optimization Problems involving Expensive Resources. (2005). Applied Computing 2005: Proceedings of the 2005 ACM Symposium on Applied Computing, Santa Fe, New Mexico, 13-17 March 2005. 79-83.
Available at: https://ink.library.smu.edu.sg/sis_research/1097
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://dx.doi.org/10.1145/1066677.1066699
Included in
Artificial Intelligence and Robotics Commons, Business Commons, Operations Research, Systems Engineering and Industrial Engineering Commons
