Hexaly’s Post

Hexaly against Gurobi, OR-Tools, jsprit (GraphHopper), and OptaPlanner on the Capacitated Vehicle Routing Problem (CVRP): ➡️ Hexaly finds solutions close to the state of the art in 1 minute, even for instances with 1,000 customers. ➡️ Despite specializing in solving Vehicle Routing problems, OR-Tools delivers poor-quality solutions (> 5% gap), even for medium-sized instances; OptaPlanner and jsprit perform worse (>10% gap). ➡️ Gurobi fails to find decent solutions in 1 minute, even for small-sized instances; additional experiments show the results remain the same with 1 hour of computation. The “gaps” mentioned are the relative gaps in % between the solutions computed by Hexaly within 1 minute on a standard server (AMD Ryzen 7 7700 processor, 8 cores, 3.8 GHz, 32MB cache, 32GB RAM) and the best known solutions available by the research. 🔗 Check the benchmark here: https://lnkd.in/e27367ja #optimization #operationsresearch

Hexaly against Gurobi, OR-Tools, jsprit (GraphHopper), and OptaPlanner on the Capacitated Vehicle Routing Problem (CVRP): ➡️ Hexaly finds solutions close to the state of the art in 1 minute, even for instances with 1,000 customers. ➡️ Despite specializing in solving Vehicle Routing problems, OR-Tools delivers poor-quality solutions (> 5% gap), even for medium-sized instances; OptaPlanner and jsprit perform worse (>10% gap). ➡️ Gurobi fails to find decent solutions in 1 minute, even for small-sized instances; additional experiments show the results remain the same with 1 hour of computation. 🔗 Check the benchmark here: https://lnkd.in/dFfhBQ54 #optimization #operationsresearch

How does Hexaly perform against Gurobi, OR-Tools, OptaPlanner, and jsprit on the Capacitated Vehicle Routing Problem (CVRP)? ➡️ Hexaly reaches a 1.2% average gap to the best known solutions in the research in 1 minute on the CVRPLIB benchmark. ➡️ Despite specializing in solving Vehicle Routing problems, OR-Tools delivers poor-quality solutions (> 5% gap), even for medium-sized instances; OptaPlanner and jsprit perform worse (>10% gap). ➡️ Gurobi fails to find decent solutions in 1 minute of running time, even for small-sized instances; additional experiments show the results remain the same with 1 hour of computation. The “gaps” mentioned are the relative gaps in % between the solutions computed by Hexaly, Gurobi, OR-Tools, OptaPlanner, and jsprit on a server equipped with an AMD Ryzen 7 7700 processor (8 cores, 3.8GHz, 8MB cache) and 32GB RAM, and the best known solutions available by the research. 👇 Check out the full article through the link below. #operationsresearch #optimization #routing

How does Hexaly perform against Gurobi, OR-Tools, OptaPlanner, and jsprit on the Capacitated Vehicle Routing Problem (CVRP)? ➡️ Hexaly reaches a 1.2% average gap to the best known solutions in the research in 1 minute on the CVRPLIB benchmark. ➡️ Despite specializing in solving Vehicle Routing problems, OR-Tools delivers poor-quality solutions (> 5% gap), even for medium-sized instances; OptaPlanner and jsprit perform worse (>10% gap). ➡️ Gurobi fails to find decent solutions in 1 minute of running time, even for small-sized instances; additional experiments show the results remain the same with 1 hour of computation. The “gaps” mentioned are the relative gaps in % between the solutions computed by Hexaly, Gurobi, OR-Tools, OptaPlanner, and jsprit on a server equipped with an AMD Ryzen 7 7700 processor (8 cores, 3.8GHz, 8MB cache) and 32GB RAM, and the best known solutions available by the research. 👇 Check out the full article through the link below. #operationsresearch #optimization #routing

How does Hexaly perform against Gurobi, OR-Tools, OptaPlanner, and jsprit on the Capacitated Vehicle Routing Problem (CVRP)? ➡️ Hexaly reaches a 1.2% average gap to the best known solutions in the research in 1 minute on the CVRPLIB benchmark. ➡️ Despite specializing in solving Vehicle Routing problems, OR-Tools delivers poor-quality solutions (> 5% gap), even for medium-sized instances; OptaPlanner and jsprit perform worse (>10% gap). ➡️ Gurobi fails to find decent solutions in 1 minute of running time, even for small-sized instances; additional experiments show the results remain the same with 1 hour of computation. The “gaps” mentioned are the relative gaps in % between the solutions computed by Hexaly, Gurobi, OR-Tools, OptaPlanner, and jsprit on a server equipped with an AMD Ryzen 7 7700 processor (8 cores, 3.8GHz, 8MB cache) and 32GB RAM, and the best known solutions available by the research. 👇 Check out the full article through the link below. #operationsresearch #optimization #routing

A robust MVI implementation with Jetpack Compose https://lnkd.in/dVindwzu

Prompt engineering is essential for getting the most out of any #LLM! Learn practical prompt engineering techniques to use with Prompt Builder that will improve responses and better integrate #GenerativeAI into your applications: ➡️ sforce.co/4eDbe85

Useful techniques to get the most out of Prompt Builder:

#LeetCode Print Zero Even Odd Solved Medium Topics Companies You have a function printNumber that can be called with an integer parameter and prints it to the console. For example, calling printNumber(7) prints 7 to the console. You are given an instance of the class ZeroEvenOdd that has three functions: zero, even, and odd. The same instance of ZeroEvenOdd will be passed to three different threads: Thread A: calls zero() that should only output 0's. Thread B: calls even() that should only output even numbers. Thread C: calls odd() that should only output odd numbers. Modify the given class to output the series "010203040506..." where the length of the series must be 2n. Implement the ZeroEvenOdd class: ZeroEvenOdd(int n) Initializes the object with the number n that represents the numbers that should be printed. void zero(printNumber) Calls printNumber to output one zero. void even(printNumber) Calls printNumber to output one even number. void odd(printNumber) Calls printNumber to output one odd number.   Example 1: Input: n = 2 Output: "0102" Explanation: There are three threads being fired asynchronously. One of them calls zero(), the other calls even(), and the last one calls odd(). "0102" is the correct output. Example 2: Input: n = 5 Output: "0102030405"   Constraints: 1 <= n <= 1000

There's a new object creation workflow in FlexSim 2024 Update 1. It better integrates FlexSim's Object Template system and it's recommended for all users -- watch this video to see more.