Abstract
SYNOPTIC ABSTRACTWe adapt the columnwise-pairwise algorithm (CP) of Li and Wu (1997) to the construction of multi- and mixed-level supersaturated designs. One inherent difficulty associated with the use of many heuristic algorithms is premature convergence to a local optima. Meyer and Nachtsheim (1988) discussed the use of simulated annealing method for constructing D-optimal designs. As an extension to their work, this research proposes two modified CP algorithms: tabu-enhanced CP and CP with perturbation. The performance of the two methods is evaluated in the construction of multi-level supersaturated designs. Using these algorithms yields a class of supersaturated designs that is more efficient than existing designs in terms of the optimality criteria. Results are also compared with Fang, Lin, and Ma (2000). The application of the CP algorithms to mixed-level supersaturated designs is examined as well.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: American Journal of Mathematical and Management Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
