DBCN: A New Method for Dynamic Combinatorial Optimization Problem

Contraposing to the shortage of those actual methods for solving the dynamic combinatorial optimization problems, a new method called DBCN short for duality balance contract-net is brought forward. The DBCN integrates the traditional contract-net protocol and the duality balance algorithm, so that which is not only good at timeliness and facility, but also achieves the dynamic optimization in real-time for the compages of tasks and resources. The concept of k-balance solution is put forward for the first time, and the formalization of the duality balance algorithm is presented, and the astringency and complexity of the duality balance algorithm are proved in theoretics, and the information model and process model of the DBCN are also expounded in detail, and finally the optimization effect, astringency and stability of the DBCN are validated by comparing with the traditional contract-net through an experimentation. With the appearance of the k-balance solution and the DBCN, a new orientation is offered for solving the problem of dynamic combinatorial optimization.