English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/61024
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:


Negotiation Based Branch and Bound and the Negotiating Salesmen Problem

AuthorsDe Jonge, Dave ; Sierra, Carles
Issue Date2011
PublisherIOS Press
CitationArtificial Intelligence Research and Development. Proceedings of the 14th International Conference of the Catalan Association for Artificial Intelligence. Lleida, Catalonia, Spain, October 26-28, 2011. Frontiers in Artificial Intelligence and Applications Vol. 232,
AbstractWe introduce a new multiagent negotiation algorithm that explores the space of joint plans of action: NB3. Each negotiator generates a search tree by considering both actions performed by itself and actions performed by others. In order to test the algorithm we present a new variant of the Traveling Salesman Problem, in which there is not one, but many salesmen. The salesmen need to negotiate with each other in order to minimize the distances they have to cover. Finally we present the results of some tests we did with a simple implementation of the algorithm for this problem.
DOIDOI: 10.3233/978-1-60750-842-7-91
Identifiersdoi: DOI: 10.3233/978-1-60750-842-7-91
isbn: 978-1-60750-841-0
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
CCIA 2011 FAIA 232 NBBaB_and_NSP.pdf85,54 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.