climbers very chips optimal type beyond integers java problem optimization concurrently algorithm using simulated sampling bits metaheuristics salsa each hybridizable mutation creating algorithms crossover other providing integrating utilizing customizable representations permutations local example adaptive across search library same ways varying variety operators temperature stochastic supports where vector multistart implementations genetic enabling restart initial more representing bitvector many climber generally hill such extensive extensively additionally efficiently self instance several that optimize solution generated portfolio neighbors than implemented accelerate modified different which making including solutions adapt iterative constructive includes restarts most vectors hybrid support parameters problems implements instances classes searching provided javapermutationtools generating annealing simpler tune running random candidate common parallel provides schedules class permutation reals execution types process built multiple length threads also generic with schedule what form lengths well evolutionary forms