A genetic algorithm with an embedded Ikeda map applied to an order picking problem in a multi-aisle warehouse

摘要

An Ikeda map embedded genetic algorithm is introduced in this research in order to solve the order picking problem. The chaos based algorithm is compared against the canonical pseudo-random number based genetic algorithm over thirty test instances of varying complexity. From the results, the chaos based genetic algorithm is shown to have better overall performance, especially for larger sized problem instances. The statistical paired t-test comparison of the results further reinforces the fact that the chaos based genetic algorithm is significantly better performing.