English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/131425
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Exploiting Max-Sum for the Decentralized Assembly of High-Valued Supply Chains

AuthorsPenya-Alba, Toni; Cerquides, Jesús ; Rodríguez-Aguilar, Juan Antonio ; Vinyals, Meritxell
Distributed problem solving
Issue Date5-May-2014
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems
Citation13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014; Paris; France; 5 May 2014 through 9 May 2014. Proceedings, vol. 1, pp. 373-380, 2014
AbstractSupply Chain Formation involves determining the participants and the exchange of goods within a production network. Today's companies operate autonomously, making local decisions, and coordinating with other companies to buy and sell goods along their Supply Chains. Such temporal interactions need to be formed rapidly and in a decentralized manner. For sufficiently large problems, current state-of-the-art approaches for Decentralized Supply Chain Formation are only capable of either (i) producing Supply Chains of high value at the expense of high resource requirements; or (ii) require low resources at the expense of producing Supply Chains of low value. In this paper we describe an algorithm that is able to produce Supply Chains of high value while keeping a low resource usage profile. Moreover, our method is able to produce near optimal Supply Chains while using up to four orders of magnitude less resources that the state-of-the-art. Copyright © 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
Identifiersissn: 978-1-4503-2738-1
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.