Order batching problem

[Geoff Le Tchoko]

Hi,
I'm actually working on a project in jupyter Notebook using python to solve the order batching problem. But it doesn't work as i need so far.

Problem's definition:
In manual order picking systems, order pickers walk or drive through a distribution warehouse (ref. traversal.PNG) in order to collect items which are requested by (internal or external) customers. In order to perform these operations effciently, it is usually required that customer orders are combined into (more substantial) picking orders (Batch) of limited size. The Order Batching Problem deals with the question of how a given set of customer orders should be combined such that the total length of all tours is minimized which are necessary to collect all items.

I want to implement two methods:
- the heuristic one: Tabu search (ref. order batching problem.ipynb) and you need to include this file to compile.
list of items and distances : "TD.txt"
customers orders and quantities: "Auftrag.txt"

- the optimal one: with Gurobi (ref. OBP_TR.ipynb ) and you can get the modell here (ref. OBP Modell ).

Thanks
james