The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling

Abstract

The Coors warehouse scheduling problem involves finding a permutation of customer orders that minimizes the average time that customers' orders spend at the loading docks while at the same time minimizing the running average inventory, Search‐based solutions require fast objective functions. Thus, a fast low‐resolution simulation is used as an objective function. A slower high‐resolution simulation is used to validate solutions. We compare the performance of a constructive scheduling algorithm to a genetic algorithm and local search approach. The constructive algorithm is based on a heuristic built specifically for this application. We also tested a hybrid of the genetic algorithm and local search approaches by initializing the search using the domain‐specific heuristic. This hybrid genetic algorithm was able to find the best solutions when evaluated by the high‐resolution simulation. Finally, we consider the effect of using the high‐resolution simulation to filter a set of solutions found by the different approaches. Copyright © 1999 John Wiley & Sons, Ltd.

A human-centric perspective exploring the readiness towards smart warehousing: The case of a large retail distribution warehouse

“…Other key warehousing technologies that are widely operationalised include automated storage and retrieval system (AS/RS) (Roodbergen & Vis 2009), automatic sorting system and computer-aided picking systems (Kim et al, 2016). While the literature reports various technologies that facilitate operations within warehouse settings, in general only a portion LSCM focuses solely on warehouse management (Watson et al, 1999, Rubrico et al, 2008, Chan & Kumar 2009. Accordingly, table 1 presents some of the key focus from within the warehousing literature.…”

Interactive Anticipatory Scheduling for Two Military Applications

“…Following Parish (1994), the current implementation uses Syswerda's (relative) order crossover operator, which preserves the relative order of the elements in the parent solutions in the child solution. Syswerda's crossover operator has been successfully applied in a variety of scheduling applications [28,34,29].…”