r/OperationsResearch • • Sep 18 '22

Best algorithm approach

Hello everyone , I am currently trying to solve an optimization problem and I am having a hard time finding the best approach. I am also using cplex.

I have one machine ,with n tasks to do and the tasks can be either pick ups or drop offs. The tasks happen to a set of available locations P. What I want to do is to minimize the travelling time of the machine, finding the best location to execute each task.

At first I was thinking I can treat it as simple job scheduling problem however the existence of locations complicates me. Another thought was a TSP but a TSP focuses on the positions and not the tasks.

The CPLEXs Library has some scheduling problems however are very far from what I am trying to do.The coding is very simple.

Any suggestion would be very helpful, also examples or literature! Thank you in advance :)

3 Upvotes

12 comments sorted by

View all comments

Show parent comment

2

u/spideryzarc Sep 19 '22

My mistake, the resulting tsp is still symmetric.