Lagrangean decomposition: A model yielding stronger lagrangean bounds
Mathematical Programming: Series A and B
An asynchronous complete method for distributed constraint optimization
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Adaptive price update in distributed Lagrangian relaxation protocol
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
An α-approximation protocol for the generalized mutual assignment problem
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Survey of Target Tracking Protocols Using Wireless Sensor Network
ICWMC '09 Proceedings of the 2009 Fifth International Conference on Wireless and Mobile Communications
Distributed facility location algorithms for flexible configuration of wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Hi-index | 0.00 |
The Generalized Mutual Assignment Problem (GMAP) is a distributed combinatorial optimization problem in which, with no centralized control, multiple agents search for an optimal assignment of goods that satisfies their individual knapsack constraints. Previously, in the GMAP protocol, problem instances were assumed to be feasible, meaning that the total capacities of the agents were large enough to assign the goods. However, this assumption may not be realistic in some situations. In this paper, we present two methods for dealing with such “over-constrained” GMAP instances. First, we introduce a disposal agent who has an unlimited capacity and is in charge of the unassigned goods. With this method, we can use any off-the-shelf GMAP protocol since the disposal agent can make the instances feasible. Second, we formulate the GMAP instances as an Integer Programming (IP) problem, in which the assignment constraints are described with inequalities. With this method, we need to devise a new protocol for such a formulation. We experimentally compared these two methods on the variants of Generalized Assignment Problem (GAP) benchmark instances. Our results indicate that the first method finds a solution faster for fewer over-constrained instances, and the second finds a better solution faster for more over-constrained instances.