Prestwich, Steven D.Rossi, RobertoTarım, S. Armağan2020-06-022020-06-022015Prestwich, Steven D.; Rossi, Roberto; Tarim, S. Armagan, "Randomness as a constraint" Principles And Practice Of Constraint Programming, Cp 2015, Vol.9255, pp.351-366, (2015).9783319232195; 97833192321880302-9743http://hdl.handle.net/20.500.12416/4013Some optimisation problems require a random-looking solution with no apparent patterns, for reasons of fairness, anonymity, undetectability or unpredictability. Randomised search is not a good general approach because problem constraints and objective functions may lead to solutions that are far from random. We propose a constraint-based approach to finding pseudo-random solutions, inspired by the Kolmogorov complexity definition of randomness and by data compression methods. Our "entropy constraints" can be implemented in constraint programming systems using well-known global constraints. We apply them to a problem from experimental psychology and to a factory inspection problem.eninfo:eu-repo/semantics/closedAccessGenerationSequencesSearchRandomness as a constraintRandomness as a Constraint925535136610.1007/978-3-319-23219-5_25