 Have you been in a station when the delivery service was not able to process your order because it was overwhelmed by other orders? Well, it could be sold with the planning. And the Opto Planner is a really great tool for scheduling and planning with constraints. And in this video, I'm going to show you how to use Opto Planner order picking quick starts to get perfect results planning for picking up multiple orders items in the warehouse. So let's begin with the problem formulation. So here we have the warehouse, the trolley and the debit station. So what we need is to pass to the Opto Planner the configuration of the warehouse, the orders we have and the trolleys we have as well and their capacity and the amount of boxes. And then Opto Planner will assign products to trolleys and will create this step-by-step plan to fulfill the orders. And let's consider the example of it. So for example, first idea that comes to mind is just to pick up or take the two orders and merge it and just to pick up till you can, right? And here you could see that we pick up banana and ammo, combine it to box number one, then we pick up snack, then pick up orange pot here. The first constraint will appear because we cannot store products from different orders in one box, right? So this needs to be avoided. The next problem is that if we will even pick up it, right, like banana apple, again snack here, orange from the other order here and the grill here. Next problem that we have is that we didn't consider that we need two trolleys already. So we need to plan ahead the amount of trolleys and the list of products or step-by-step plan for products ahead. Consider we have two trolleys, all right, okay, we will create the plan like this. So the trolling number one will pick up banana and apple, then we'll go for the snacks, one, two, three steps, then we'll go for the orange as another four, five, six steps and for the grill which is in house. So seven, eight, nine, ten, eleven, twelve, thirteen, fourteen. So it's fourteen steps, it's quite a lot, you could see it's a mess. And well, we need to avoid it as well, let's create the, well, another constraint would be that each time we create the next step, we need to consider that the distance between the current step, current plan step and the previous step should be minimized. Also, you can see here this solution. For example here we can see that for the trolling number one we did two steps actually combining the orders from fruits shelf and go only for the nearest one, for the meat one, right? It's only two steps. After that we assign for the trolling number two to go for the drinks, one, two steps, then go for the snacks, three step and go for the grill, four step and four step back. That creates, that gives us only eight steps, so it's much more better than before. The next problem that we have is that you can see here that it's not quite, it's not planned for going back, so we don't return to the depot station. Well, in case we need to return it anyway, we can consider and replan it a bit to decrease the amount of trolleys or amount of steps. Now let's consider that we need to not only minimize the last step, but minimize the distance to the origin. What does it mean? It means that if we go, for example, we create a plan like this, so we can go for banana, for salmon, pepsi, snack, grill and vegetables, after that return back and go for the meat. This is acceptable for the first relay, but the problem is that actually we could do better. In case if we go for fruits, fish, drinks, snacks, house, vegetables and meat again, we will decrease the number of steps. So here instead of ten steps, we will have only eight of it. So we will pick up like one, two, three, one, two, three, four, five, six, seven, eight steps with entering of the depot station, because the depot is here and the old trolleys would be created from this place and will be returned back to this place. So and also let's consider in the previous example, we could see that unfortunately the different trolleys were containing the same order, but it would be much better if we have the whole trolleys that is assigned only for one order. So let's try it and see how the planner is going to solve order picking problem. Firstly we have factory lease and three orders and pre-configured warehouse. So start it and soon we will see all the planner solves our problem and first of all you can see that there is no any hard constraints broken and it means that the planner creates the only solutions where the general products capacity is less than trolleys capacity, right? And it does not account in solution where the products of different orders go to the same box as here. So you could sum the volume and check by yourself that it does not exaggerate the trolleys capacity with four buckets and also you could see that there is no different colors in one box because the planner will not mix different items for different orders in one box. Now also take a look for the distance. So here you could see that for the trolleys number one each step of the planner will minimize the distance between current location and location of the previous step. So you could see it here and also you could see it is looped. It plans to pick up products not only by way two but on the way back. It is the best solution that the planner can create but you could tweak it by yourself. Just you could go for the optplaner.org and download optplaner quick stars and try it by yourself. Thanks for watching.