Apply Local Search to the cutting stock problem using Java
an example of the problem the program would have to solve (using local search) would be presented like this:
Stock lengths and costs are:
length: 10, 13, 15
their respective costs: 100, 130, 150
A customer can make a request for example:
lengths: 3, 4, 5, 6, 7, 8, 9, 10
in the respective quantities: 5, 2, 1, 2, 4, 2, 1, 3
I would like a program that gives me the best arrangement of metal pieces for the cheapest cost and the least stock used.
i thought I'd mention that I'm fully capable of doing the project my self, I just don't have the time and I'm not willing to pay more than £50 as it is worth that much. It is a very small part of a large project.
10 freelancers are bidding on average £113 for this job
i am java/javafx expert and have full experience for 12 years. java/javafx is my top skill and passision. i can provide most quality and high speed. if you want to success, please contact me.