Everything may seem normal, but sometimes companies face several issues in the transport operation that make it difficult, delay and generate costs that can be solved with the appropriate technology applied.
The Dobslit solution is able to unite up to 200 nodes and access any map of Brazil
Quantum algorithm that attacks the traveling salesman problem to find the shortest possible route that passes through N given points
Difference in behavior between quantum and classical algorithm for increasing the number of points
Solution under development by Dobslit will be able to unite up to 200 nodes and access any map of Brazil
The solution will be able to resolve the issue for issues with up to 100,000 objects
Quantum algorithm that attacks the knapsack problem, that is, optimizing the value of a set of objects respecting a limit of what can be carried
Dobslit has already demonstrated that it is possible build an online solution that access the quantum algorithm
Solution under development by Dobslit will be able to resolve the issue for issues with up to 100,000 objects