Thesiss

Part I Ranking data, which result from m raters ranking n items, are difficult to visualize due to their discrete algebraic structure, and the computational difficulties associated with them when n is large. This problem becomes worse when raters provide tied rankings or not all…

This research seeks to test the effectiveness of a proposed hybrid Variable Neighborhood Search (VNS) / Ant Colony Optimization (ACO) algorithm on a wide range of Quadratic Assignment Problem (QAP) instances. Known as Variable Neighborhood Search - Ranked Ant Colonies (VNS-RAC),…

The historical development of the EER program, from its initiative as WSU’s first Ed. D., to its growth with the Ph. D. and master’s program, was well documented (Irwin, 1960). The importance of the EER doctoral program was established, in terms of its role in the COE, within WS…