Automated Negotiation for Package Delivery
Publication Type:
Conference PaperSource:
Workshop on Technologies for the Organisation, Adaptation and Simulation of Transportation Systems (TOASTS@SASO), Lyon, France (2012)Keywords:
Negotiation; Search; NB3; LogisticsAbstract:
Package delivery companies compete with each other and have costumers spread over wide areas. We propose a negotiation algorithm that allows companies and individual postmen to negotiate over who delivers what package. This way, package delivery can be made more efficient, yielding a higher profit and/or lower costs for all parties. Our system does not force competing companies to co-operate, but proposes solutions that allow all parties to increase their individual profit.
Branch and Bound for Negotiations in Large Agreement Spaces
Publication Type:
Conference PaperSource:
The 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), Valencia, Spain (2012)Keywords:
Negotiation; Search; Branch and Bound; Negotiating Salesmen ProblemAbstract:
We introduce a new multiagent negotiation algorithm for large and complex domains, called NB3. It applies Branch & Bound to search for good off ers to propose. To analyze its performance we present a new problem called the Negotiating Salesmen Problem. We have conducted some experiments with NB3 from which we conclude that it manages to decrease the traveling cost of the agents significantly, that it outperforms random search and that it scales well with the complexity of the problem.
