<abstract xmlns="http://www.w3.org/1999/xhtml"><p> We study the performance of some widely-used design construction algorithms like the coordinate exchange and swapping-cycling as well as some of their versions. We measure performance in two ways, namely, first, by measuring jointly both running time and the efficiency achieved, and, second, by fixing the running time of the algorithms and measuring the efficiency achieved while allowing the number of choice situations to vary. In addition, we also analyse the performance in terms of heterogeneous designs. A somewhat surprising outcome of our analyses is that a simplified version of the joint swapping-cycling algorithm outperforms the coordinate-exchange algorithm irrespective of the performance measure. </p></abstract>

We study the performance of some widely-used design construction algorithms like the coordinate exchange and swapping-cycling as well as some of their versions. We measure performance in two ways, namely, first, by measuring jointly both running time and the efficiency achieved, and, second, by fixing the running time of the algorithms and measuring the efficiency achieved while allowing the number of choice situations to vary. In addition, we also analyse the performance in terms of heterogeneous designs. A somewhat surprising outcome of our analyses is that a simplified version of the joint swapping-cycling algorithm outperforms the coordinate-exchange algorithm irrespective of the performance measure.

A Comparison of Algorithms for Conjoint Choice Designs

Sapientia Hungarian University of Transylvania, Faculty of Economic and Human Sciences, Department of Economic Sciences, Miercurea Ciuc

Sapientia Hungarian University of Transylvania, Faculty of Economic and Human Sciences, Department of Business Sciences, Miercurea Ciuc

Acta Universitatis Sapientiae, Economics and Business

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"A Comparison of Algorithms for Conjoint Choice Designs"}

We study the performance of some widely-used design construction algorithms like the coordinate exchange and swapping-cycling as well as some of their...

A Comparison of Algorithms for Conjoint Choice Designs

Data publikacji: 17 paź 2014

Zakres stron: 95 - 108

DOI: https://doi.org/10.2478/auseb-2014-0012

© 2014

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.