Computing optimal coalition structures in non-linear logistics domains Online publication date: Mon, 17-Oct-2011
by Chattrakul Sombattheera
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 5, No. 6, 2011
Abstract: We study computing optimal coalition structures in non-linear logistics domains, where coalition values are not known a priori and computing them is NP-hard. In our setting, the common goal of the agents is to minimise the system's cost. Agents perform two steps: 1) deliberate appropriate coalitions; 2) exchange computed coalitions and generate coalition structures. We apply the concept of best coalition introduced in Sombattheera and Ghose (2008), to work in the non-linear logistics domains. We provide an algorithm and explain via examples to show how it works. Lastly, we show the empirical results of our algorithm in terms of elapsed time and number of coalition structures generated.
Online publication date: Mon, 17-Oct-2011
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com