Dynamic Network Formation Using Ant Colony Optimization

This research presents three contributions for solving highly dynamic (i.e. drastic change within the network) Multi-commodity Capacitated Network Design Problems (MCNDPs) resulting in a distributed multi-agent network design algorithm. The first contribution incorporates an Ant Colony Optimization (ACO) algorithm Ant Colony System (ACS) to solve the static MCNDP with weak constraints. Second, a new algorithm is developed and has the capability to dynamically adjust its exploration parameter of the solution space. This enhanced algorithm converges quickly and automatically adjusts to the dynamically changing network environment. Third, a distributed approach is created replacing the previous centralized solver.

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.

This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.

As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.