Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer
IEEE Transactions on Computers
Conflict handling in collaborative search
Conflicting agents
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound Algorithm
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Parallel Optimization of Evolutionary Algorithms
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Cooperation of Heterogeneous Provers
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
| Hi-index | 0.00 |
We present an application of a multi-agent cooperative search approach to the problem of optimizing gas pipeline operations, i.e. finding control parameters for a gas transmission network that result in a low usage of energy to make the required gas deliveries. Our cooperative search approach improves on the pure competition of search agents by having them exchange good solutions from time to time that both are integrated into the search state of the agents and used to improve the search control of the agents. Our experimental evaluation with real problem instances from TransCanada show that our system meets TransCanada's time requirements and reliably outperforms the interactive method that is the current state-of-the-art by creating solutions that require more than 10 percent less energy.