Use of a genetic algorithm for building efficient choice designs

International Journal of Bio-Inspired Computation

Volumn 4, Issue 1, 2012, Pages 27-32

  Muñuzuri, Jesús ^a   Achedad, Pablo Cortés ^a   Rodríguez, María ^a   Grosso, Rafael ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

D error; Design building; Discrete choice; Genetic algorithm

Indexed keywords

ARCHITECTURAL DESIGN; ERRORS; PROBABILITY DISTRIBUTIONS;

BUILDING DESIGN; COMPUTATION TIME; DESIGN MATRIX; DISCRETE CHOICE; EFFICIENT DESIGNS; HIGH QUALITY; MINIMISATION; PROBABILISTIC DISTRIBUTION;

GENETIC ALGORITHMS;

EID: 84861840985     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2012.044935     Document Type: Article

References (19)

1. Baker, B.M. and Ayechew, M.A. (2003) 'A genetic algorithm for the vehicle routing problem', Computers & Operations Research, Vol. 30, pp.787-800. (Pubitemid 36175284)
2. Fedorov, V. (1972) Theory of Optimal Experiments, Academic Press, New York.
3. Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading.
4. Holland, J. (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Michigan.
5. Huber, J. and Zwerina, K. (1996) 'The importance of utility balance in efficient choice designs', Journal of Marketing Research, Vol. 33, No. 3, pp.307-317.
6. Hwang, H.S. (2002) 'An improved model for vehicle routing problem with time constraint based on genetic algorithm', Computers and Industrial Engineering, Vol. 42, pp.361-369.
7. Iyer, S.K. and Saxena, B. (2004) 'Improved genetic algorithm for the permutation flowshop scheduling problem', Computers & Operations Research, Vol. 31, No. 4, pp.593-606. (Pubitemid 38098445)
8. Kessels, R., Goos, P. and Vandebroek, M. (2006) 'A comparison of criteria to design efficient choice experiments', Journal of Marketing Research, Vol. 43, pp.409-419. (Pubitemid 44367339)
9. Kuhfeld, W.F., Tobias, R.D. and Garratt, M. (1994) 'Efficient experimental design with marketing research applications', Journal of Marketing Research, Vol. 21, pp.545-557.
10. Liaw, C.F. (2000) 'A hybrid genetic algorithm for the open shop scheduling problem', European Journal of Operational Research, Vol. 124, pp.28-42.
11. Liu, B., Haftka, R.T., Akgün, M.A. and Todoroki, A. (2000) 'Permutation genetic algorithm for stacking sequence design of composite laminates', Computer Methods in Applied Mechanics and Engineering, Vol. 186, Nos. 2-4, pp.357-372. (Pubitemid 30416742)
12. McFadden, D. (1974) 'Conditional logit analysis of qualitative choice behavior', in Zarembka, P. (Ed.): Frontiers in Econometrics, pp.105-142, Academic Press, New York.
13. Mitchell, M. (1998) An Introduction to Genetic Algorithms, MIT Press, Massachusetts.
14. Potvin, J.Y. (1996) 'Genetic algorithms for the travelling salesman problem', Annals of Operations Research, Vol. 63, No 3, pp.337-370.
15. Sandor, Z. and Wedel, M. (2001) 'Designing conjoint choice experiments using managers' prior beliefs', Journal of Marketing Research, Vol. 38, No. 4. pp.430-444.
16. Sandor, Z. and Wedel, M. (2002) 'Profile construction in experimental choice designs for mixed logit models', Marketing Science, Vol. 21, No. 4, pp.455-475.
17. Sandor, Z. and Wedel, M. (2005) 'Heterogeneous conjoint choice designs', Journal of Marketing Research, Vol. 42, pp.210-218. (Pubitemid 40653435)
18. Shi, G. (1997) 'A genetic algorithm applied to a classic job-shop scheduling problem', International Journal of Systems Science, Vol. 28, No. 1, pp.25-32. (Pubitemid 127589686)
19. Zwerina, K., Huber, J. and Kuhfeld, W.F. (2005) 'A general method for constructing efficient choice designs', available at http://support.sas.com/ techsup/tnote/tnote-stat.html - Reference TS-722E (accessed in September 2009).