{'fraction_non_alphanumeric': 0.016655562958027982, 'fraction_numerical': 0.0, 'mean_word_length': 5.364406779661017, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem

Efficiently managing large deposits and warehouses is not an easy task. The amount of variables and processes involved from the moment a consumer purchases a single product until its receipt is quite considerable. There are two major problems involving warehouses processes: the order picking problem (OPP) and the order batching problem (OBP). The OPP aims to minimize the distance traveled by a picker while collecting a set of products (orders). The OBP seeks to assign orders to batches with a capacity limit in order to minimize the sum of distances traveled during the retrieving of products from all batches. When these two problems are approached together, they become the Joint Order Batching and Picking Routing Problem (JOBPRP). This work proposes a novel formulation for JOBPRP and develops a grouping genetic algorithm with controlled gene transmission. To assess our proposals, we executed computational experiments over literature datasets. The mathematical model was used within a mixed-integer programming solver (Gurobi) and tested on the smaller instances to evaluate the quality of the solutions of our metaheuristic approach. Our computational results evidence high stability for all tested instances and much lower objective value than the previously reported in the literature, while maintaining a reasonable computational time.