Complex Cube Solving and Spacial Math Algorithms for Java
$1500-3000 USD
Completed
Posted about 7 years ago
$1500-3000 USD
Paid on delivery
We have a complex set of cube-solving algorithms that need to be designed and then libraries developed. See file attachment. Proposal to us should be in a response to this document indicating your rough approach, your experience doing this sort of thing, challenges to our json interfaces, anything that helps us understand you can handle this. DO NOT send me a generic - "we have a great team and we can do the work" sort of response, I will immediately delete these. This is a serious task for someone very good at algorithms and spacial mathematics. It also looks pretty fun actually.
Hello,
I would be happy to help you implement this project as I have a mathematic background and always enjoy solving algorithmic tasks.
On the task itself: finding an optimal distribution between several cartons is equivalent to the knapsack problem which is NP-complete. However since for each such task you have just a few items it can be quickly brute forced so it's not an issue. Within a single carton for a fixed set of items the task becomes suitable for a greedy algorithm. It can take into account all the conditions you mentioned (that doesn't change the complexity much) and would use the approach which is approximately what you mention in the doc (place the largest first to the origin on the carton etc).
I am sure this is doable in Java within your timeline of 30 days.
Thanks,
Sergei
$2,941 USD in 30 days
5.0 (56 reviews)
8.0
8.0
9 freelancers are bidding on average $2,830 USD for this job
Java EXPERT here. Before making my bid, let me tell you that I haven't done similar project before. BUT I am good with algorithms, I have designed and developed a compiler for as an FYP. So I think that I am best fit for your project. Thanks, Junaid
Hello Sir,
This certainly looks pretty interesting "logistic problem" with input and output as JSON. I just have one question before I discuss my approach.
Considering the problem involved, are you looking for a windows based solution (like a standard windows exe where you input the JSON , click a button and it gives you the output JSON with the logistic details)?
Thanks
Aanvik
Hello,
I went through the doc. I have worked with 3D perspective. Strong in co-ordinate geometry
Studied orientation in robotics as well. Know greedy algorithms for cost optimizations
Worked on gradient descent for supervised learning (just for info) and also have a great
team to divide and conquer :)
I think in java and have 7 years of experience in java with MS in software engineering. Will json library to handle json. JSON is not my concern.
Approach:
The container has a certain volume. We the provided data UOM/DIM
I will compute the volume of the object and realign the objects in the container.
and return the optimal co-ordinates of all the items.
I'm pretty confident that I can do this, even though I acknowledge its a complex
task will certainly take time. BTW I'm a strong chess player. :)
Let me know.
Regards,
Deepak Mishra
The optimal solution for this problem. Has time of O(n-factorial).
Which is pretty expensive as number of items reach more than 10 items.
We can do couple of optimization technique on this.
1. Memoization, to skip duplicate procedures.
2. Specific optimization that can be done based on given data. (for example choosing BFS or DFS base algorithm)
3. For best performance the program must be written in a low-level language so we have complete control over operations.
4. Dividing task in multiple threads so we can take full advantage from a multi-threaded computer
This proposal may not be clear to you. I did look at the problem from technical point of view.
With JNI i can port the program to java. Writing programs on low level languages like C and Assembly are very important to get best performance.
Contact me if you have any questions.