Comparing Heuristic, Evolutionary and Local Search Approaches to Scheduling

Soraya Rana, Adele E. Howe, L. Darrell Whitley, and Keith Mathias, Colorado State University

The choice of search algorithm can play a vital role in the success of a scheduling application. In this paper, we investigate the contribution of search algorithms in solving a real-world warehouse scheduling problem. We compare performance of three types of scheduling algorithms: heuristic, genetic algorithms and local search. Additionally, we assess the in uence of heuristics on search performance and check for bias induced by using a fast objective function to evaluate intermediate search results.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.