  We present a pair of heuristic algorithms. The first is to generate a random
regular graph of fixed size. The second is the introduction of the Metropolis
Coupled Simulated Annealer (MCSA) for optimizing spectral gaps in fixed size
regular graphs.
