DocumentCode
2167024
Title
Comparing heuristic search methods and genetic algorithms for warehouse scheduling
Author
Whitley, L.D. ; Howe, A.E. ; Rana, S. ; Watson, J.P. ; Barbulescu, L.
Author_Institution
Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA
Volume
3
fYear
1998
fDate
11-14 Oct 1998
Firstpage
2430
Abstract
We compare several techniques for scheduling shipment of customer orders for the Coors Brewing warehouse and production line. The goal is to minimize time at dock for trucks and railcars while also minimizing inventory. The techniques include a genetic algorithm, local search operators, heuristic rules, systematic search and hybrid approaches. Initial results show a hybrid genetic algorithm to be superior to the other methods. The evaluation function is a fast approximate form of a warehouse simulation. We also assess the sensitivity of the search algorithms to noise in an approximate evaluation function using a more detailed (and costly) simulation
Keywords
genetic algorithms; goods distribution; search problems; stock control; Coors Brewing warehouse; customer orders; genetic algorithms; heuristic search methods; inventory minimisation; production line; shipment; warehouse scheduling; Computer science; Genetic algorithms; Job shop scheduling; Measurement; Optimization methods; Processor scheduling; Production; Scheduling algorithm; Search methods; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on
Conference_Location
San Diego, CA
ISSN
1062-922X
Print_ISBN
0-7803-4778-1
Type
conf
DOI
10.1109/ICSMC.1998.725021
Filename
725021
Link To Document