Bulk Plan Multi-stop Shipment Complete Enumeration Algorithm

The complete enumeration algorithm enumerates all consolidation combinations and selects the best set of consolidations to cover all the order releases/order movements. To turn on complete enumeration, set the multi-stop logic configuration parameter MULTISTOP CONSOLIDATION ALGORITHM to Complete Enumeration.

To illustrate how this works, let's use five order release going from a distribution center (DC) to locations A, B, C, D and E. The complete enumeration logic will enumerate all feasible combinations of order releases (with their best sequences) and determine the total cost. In the table below, different shipment possibilities are represented by columns. For example, column ABC represents the shipment that has order releases A, B, and C. The enumeration algorithm will enumerate all the combinations that are feasible. The optimization engine takes in all the shipment combinations and selects the set of shipments that covers all the order releases with the lowest total cost. In the example below, shipments AE and BCD provide the lowest total cost (171 + 214 = 385).

Since this enumerates all the possible combinations, this algorithm can only handle a small set of order bundles – around 100 order bundles. The number of order bundles per shipment should also be small. There are two parameters that control the run time.

• MULTISTOP ENUMERATION MERGE MAX SHIPMENTS = 30. If the algorithm encounters more than this number of shipments, then it will revert to the concurrent savings algorithm.
• MULTISTOP ENUMERATION MERGE MAX MERGES PER SHIP = 3. The enumeration algorithm will not consider shipments that contain more than this number of order bundles.

For this algorithm type, if the property glog.optimization.mip.setcovering.writeToFile is set to true, the set covering MIP problem will be written to the OTM logging directory as "SetCover.lp".