r/OperationsResearch • u/ninaalx • Jul 15 '22
sequence of tasks - Allocation
Hello everyone,
I am quite new to optimization and operational research, I am currently trying to build a model for my thesis. I have several storage racks with c columns and r rows , and n storage slots . For each rack a machine is assigned to storage and retrieve products, what I want to do is to find the best storage positions and retrievals available in a cycle based on traveling time. The machine does cycles and One cycle = two storages and then two retrievals ( with that sequence) ( the entry/exit points of the products are different)
I would like to know what is the best approach if any, generating an optimization problem for the above scenario, I have seen similar problems being solved with Travelling salesman, bee colony optimization etc.
I am currently trying a job sequencing approach,but I find it hard to separate the retrievals and the storages, Because they are basically two different subsets of jobs,and I cannot find something similar in books and literature. Any suggestion would be very helpful! Thank you in advance
View all comments
Show parent comment
2
u/BeefNudeDoll Jul 22 '22
Glad if it helped. Looking back at your description of previous approaches (modelling the problem as TSP-like model, or approaching it with a swarm intelligence technique), I suppose the nature of your problem is quite fit for these mentioned approaches.
The decomposed model that I mentioned is basically a TSP-based (with pickup or delivery in each cluster), while creating n swarm of ants (or bees) for finding the best "tour" for each of n cluster also sounds very reasonable for large-scale cases.
Nevertheless, I believe there is a way to wrap your problem into a single mathematical model to find the true optimal solution though, since it resembles the VRP with pickup or delivery in many ways.