Print Email Facebook Twitter Phoenix – Non-cooperative bargaining agents deploying computationally bounded optimization strategies. Title Phoenix – Non-cooperative bargaining agents deploying computationally bounded optimization strategies. Author De Bakker, F.F. Contributor Rothkrantz, L.J.M. (mentor) Faculty Electrical Engineering, Mathematics and Computer Science Department Man-machine interaction Date 2009-08-21 Abstract The project addresses cost savings and productivity improvement by pooling of resources between independent companies through multi-agent, bargaining-based decision methods. Cost savings are realized by optimizing plans across companies, while the pooling decision and the benefit distribution is done by bargaining. Applications with these characteristics are wide-spread including logistics (pooling of fleets) and manufacturing (joint manufacturing plans). This thesis comprises the project proposal as a research project submitted to the Sixth Framework Programme, Information Society Technologies, and the realization of the proof-of-concept. This proof is provided by the design and implementation a prototype optimizer for the Capacitated Vehicle Routing Problem (CapVRP) in order to simulated pooling versus non-pooling strategies based on a – simplified – business case. The optimizer uses the genetic algorithm meta-heuristic. Extensive experimentation using published CapVRP instances and benchmarks leads to the delivery of the proof-of-concept. Subject multi-agents systemsnon-cooperative bargainingvehicle routing problemgenetic algorithm To reference this document use: http://resolver.tudelft.nl/uuid:9eb6ed7d-2ba9-4332-9d62-73ce72689685 Part of collection Student theses Document type master thesis Rights (c) 2009 De Bakker, F.F. Files PDF MasterThesis_sn1063634_No ... _final.pdf 1.07 MB Close viewer /islandora/object/uuid:9eb6ed7d-2ba9-4332-9d62-73ce72689685/datastream/OBJ/view