In this paper, we make a comprehensive comparison in terms of the quality of the achieved solutions, the corresponding execution time and impact of the genetic operators on the quality of the results between the Haploid Genetic Algorithms (HGAs) and Diploid Genetic Algorithms (DGAs). The standard genetic algorithms, referred to in our paper as HGAs are characterized by the fact that they are using a haploid representation relating an individual with a chromosome, while the DGAs are using diploid individuals which are made of two chromosomes corresponding to the dominant and recessive genes. Even though the general opinion is that DGAs do not provide much benefit as compared to classical GAs, based on extensive computational experiments, we do show that the DGAs are robust, have a high degree of consistency and perform better, sometimes almost twice as well, than the HGAs, but are slower due to the high number of operations to be performed, caused by the duplication of the genetic information. However, the quality of the solutions achieved by the DGAs compensate their relative high execution time. The better quality of the DGAs, proving the efficiency of using diploid genes, is given by the homogeneity of the population which covers the search space thoroughly and in this way being capable of avoiding the local optima.