Dynamic platform-independent meta-algorithms for graph-partitioning
dynamicplatformi00schw.pdf (4.400Mb)Abstract
A dynamic platform-independent solver is developed for use with network and graph algorithms of operations research. This solver allows analysts to solve a large variety of problems without writing code. Algorithms from a library can be integrated into a meta-algorithm which also provides easy monitoring of solution progress. The solver, DORS, is demonstrated by heuristically solving a graph-partitioning problem to minimize the number of nodes adjacent to other segments of the partition. The model arises from a network-upgrade project faced by the Defense Information Systems Agency (DISA), a problem with over 200 nodes and 1400 arcs. Solutions are provided on a 266 MHz Pentium II PC using Windows NT 4.0. Eight variants of the problem are solved involving modification to the objective function, constraints on the size of partition segments, and on the number of those segments. DORS (and the meta- algorithm it implements) appears to find a good solution for one of the two problem formulations for DISA, but has difficulty solving the other. Because the solver allows new algorithms to be easily added to create more powerful meta- algorithms, DORS should provide a good solution approach for both problem formulations given a more versatile library of algorithms.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
Experimental evaluation of model predictive control and inverse dynamics control for spacecraft proximity and docking maneuvers
(Springer, 2017);An experimental campaign has been conducted to evaluate the performance of two different guidance and control algorithms on a multi-constrained docking maneuver. The evaluated algorithms are model predictive control (MPC) ... -
Autonomous operations of large-scale satellite constellations and ground station networks
(2017);A dynamic optimization problem is employed to aid operators o f large-scale satellite constellations with automated mission planning and data collection. Traditional techniques focus on graph-theoretic ideas that use ... -
Fast, adaptive, high order accurate discretization of the Lippmann-Schwinger equation in two dimensions
(2015-05-26);We present a fast direct solver for two dimensional scattering problems, where an incident wave impinges on a penetrable medium with compact support. We represent the scattered eld using a volume potential whose kernel ...
