In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
— Hyper-heuristics or “heuristics to chose heuristics” are an emergent search methodology that seeks to automate the process of selecting or combining simpler heuristics in o...
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
Eduardo Alberto Avello, Felipe F. Baesler, Reinald...