Senior Optimization Scientist
About Frédéric
Articles written by Frédéric
Hexaly vs Gurobi on the K-Means Clustering Problem (MSSC) October 16, 2024
The K-Means Clustering Problem is defined as follows: given a set of points along some dimensions, find a partition of these points into k clusters. The total sum of squared Euclidean distances between each cluster’s centroid and its elements is minimized. This problem is also known as the Minimum Sum-of-Squares Clustering (MSSC). On the K-Means Clustering Problem…
Hexaly vs Gurobi on the Quadratic Assignment Problem (QAP) September 25, 2024
The Quadratic Assignment Problem (QAP) consists of assigning facilities to locations. For each pair of locations, a distance is given. For each pair of facilities, a flow is given. This flow corresponds to the number of goods transported from one facility to another. The goal is to assign all facilities to locations while minimizing the sum of…
Hexaly on very large-scale instances of the Capacitated Vehicle Routing Problem (CVRP) August 28, 2024
The 12th DIMACS Implementation Challenge, a renowned mathematical optimization competition, focused on solving Vehicle Routing Problems (VRP). The goal of such an event, bringing together the best experts and researchers in the field, is to have a clear picture of the state of the art on a given class of problems, like VRP, by practically…
Hexaly vs Google OR-Tools on the Pickup and Delivery Problem with Time Windows (PDPTW) August 26, 2024
In the Pickup and Delivery Problem with Time Windows (PDPTW), vehicles must collect and deliver items according to customers’ demands. It must do so during opening hours. The vehicles start and end their routes at a depot. Each customer must be served by one and only one vehicle. The goal is to assign a sequence…
Hexaly, Gurobi, OR-Tools, OptaPlanner, jsprit on the Capacitated Vehicle Routing Problem (CVRP) August 5, 2024
In the Capacitated Vehicle Routing Problem (CVRP), a fleet of delivery vehicles with uniform capacity must service customers with known demand for a single commodity. The vehicles start and end their routes at a depot. Each customer can only be served by one vehicle. Given a fleet of vehicles, the objective is to assign a…
New release: Hexaly 13.0 July 8, 2024
We are pleased to announce the release of Hexaly 13.0, which includes many new features and performance enhancements. The “gaps” mentioned below 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…
Hexaly, Gurobi, OR-Tools on the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) June 28, 2024
In the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), a fleet of delivery vehicles with uniform capacity must serve customers with known demand for a single commodity. The vehicles start and end their routes at a joint depot. Each customer can only be served by one vehicle and must be visited within its time window.…
Hexaly vs Gurobi on the Traveling Salesman Problem (TSP) June 2, 2024
The Traveling Salesman Problem (TSP) is defined as follows: given a set of cities and distances for all pairs of cities, find a roundtrip of minimal total length visiting each city exactly once. On the Traveling Salesman Problem (TSP), Hexaly reaches a 0.3% average gap to the best known solutions in the research in 1 minute of…
New release: Hexaly 12.5 January 29, 2024
We are pleased to announce the release of Hexaly 12.5, which includes many new features and performance enhancements. The “gaps” mentioned below are the relative gaps in % between the solutions computed by Hexaly Optimizer in less than 1 minute on a standard server (AMD Ryzen 7 7700 processor, 8 cores, 3.8 GHz, 32MB cache, 32GB…
New release: LocalSolver 12.0 June 19, 2023
Vehicle Routing Vehicle Routing problems with 1,000 deliveries are now solved to near-optimality within 1 minute of running time. The “gap” mentioned below is the relative gap in % between the solutions computed by LocalSolver 12.0 within 1 minute of running time on a standard server (Intel Xeon E3-1230 processor, 4 cores, 3.6 GHz, 8MB…