Showing 1 - 10 of 6,849
Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player, called “codemaker”, chooses a secret code and the...
Persistent link: https://www.econbiz.de/10011771356
Persistent link: https://www.econbiz.de/10003984764
Persistent link: https://www.econbiz.de/10003984931
-heuristic algorithm based on simulated annealing (SA) is applied to heuristically solve the problem in a reasonable time. An initial … feasible solution generator and several novel neighborhood structures are applied to enhance performance of the SA algorithm … algorithm. The results of computational experiments indicate that the applied SA algorithm provides solutions with average …
Persistent link: https://www.econbiz.de/10011562610
Persistent link: https://www.econbiz.de/10012821214
Persistent link: https://www.econbiz.de/10012650269
Persistent link: https://www.econbiz.de/10012589299
Persistent link: https://www.econbiz.de/10012615643
-reduction Algorithm is developed to obtain the optimal allocation that minimizes the makespan. We show that the solution space increases … very quickly. In contrast, our algorithm is efficient with a polynomial computational complexity of , where is the total … number of serus in a seru system. To verify the usefulness of the developed exact dimension-reduction algorithm, we compare …
Persistent link: https://www.econbiz.de/10013207231
algorithm. Moreover, to preserve desirable population diversity and improve the searching efficiency, we propose different … problem-specific evolutionary strategies. Finally, we test the performance of our proposed memetic algorithm with other state …-of-the-art multi-objective evolutionary algorithms and demonstrate the effectiveness of our proposed algorithm. …
Persistent link: https://www.econbiz.de/10013207391