Save costs with mathematical models

Do more with limited resources with our custom-made scheduling models

Nature of problems

Our models are best suited for problems that deal with sequencing of resources. Consider a cement mixer that needs to be used at five different geographical locations (A, B, C, D and E) for specific periods of time. In which sequence should the machine move across locations so that the total distance traveled by the machine is minimized?

One can use heuristics to get a good-enough solution but if we really want the solution with the minimum total distance, then we will have to find a way to identify the best from the 120 possible sequences. Such an exhaustive search fails even for moderately sized problems. To deal with 100 locations, we will have to evaluate about 10 to the power of 157 solutions, which is not possible. Solverscape models use techniques such as Integer Programming to optimally solve such large sequencing problems.