Frédéric Senior Optimization Scientist

About Frédéric


Articles written by Frédéric

Announcement New release: Hexaly 13.0
Announcement

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…

Read more
Benchmark Capacitated Vehicle Routing Problem (CVRP) Hexaly, Gurobi, OR-Tools, jsprit, OptaPlanner
Benchmark Transportation Vehicle Routing

Hexaly, Gurobi, OR-Tools, jsprit, OptaPlanner on the Capacitated Vehicle Routing Problem (CVRP) June 6, 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…

Read more
Benchmark Traveling Salesman Problem (TSP) Hexaly vs Gurobi
Benchmark Transportation Vehicle Routing

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, Hexaly reaches an average optimality gap of 0.3% in 1 minute of running time on the TSPLIB research benchmark…

Read more
Announcement New release: Hexaly 12.5
Announcement

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…

Read more
Announcement New release: LocalSolver 12.0
Announcement

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…

Read more
Announcement New release: LocalSolver 11.5
Announcement

New release: LocalSolver 11.5 November 7, 2022

We are pleased to announce the release of LocalSolver 11.5. Discover below the main novelties coming with this new release. Vehicle Routing problems Vehicle Routing problems are solved even faster. The “gap” mentioned below is the relative gap in % between the solutions computed by LocalSolver 11.5 within 1 minute of running time on a standard…

Read more
Tutorial Modeling and Solving Non-Convex Quadratic Problems
Tutorial

Modeling and Solving Non-Convex Quadratic Problems July 11, 2022

A recent post on Erwin Kalvelagen’s blog, Yet Another Math Programming Consultant, shows results obtained by state-of-the-art solvers on some non-convex quadratic problems. LocalSolver can compute lower bounds and prove optimality using global, exact optimization techniques. This article presents the results of LocalSolver Optimizer with default parameter setting on the non-convex quadratic models presented in Erwin…

Read more
Announcement New release: LocalSolver 11.0
Announcement

New release: LocalSolver 11.0 March 21, 2022

We are pleased to announce the release of LocalSolver 11.0, which comes with many new features and performance improvements. Discover the main novelties coming with this new release. Vehicle Routing problems Vehicle Routing problems have never been solved faster: Production Scheduling problems Sequencing and Scheduling problems up to 10,000 tasks optimized in minutes: Simulation Optimization problems…

Read more
Benchmark Quadratic Assignment Problem (QAP) Hexaly vs Gurobi
Benchmark Transportation Network Design

Hexaly vs Gurobi on the Quadratic Assignment Problem (QAP) October 4, 2021

The Quadratic Assignment Problem (QAP) consists in 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 to be transported from one facility to another. The goal is to assign all facilities to locations while minimizing the…

Read more
Announcement LocalSolver Cloud
Announcement

LocalSolver Cloud August 9, 2021

With the release of LocalSolver 10.5, we are glad to announce the release of a new service, LocalSolver Cloud. It is now easier than ever to leverage the power of cloud computing and get the best results for your optimization problem in the shortest amount of time. This new feature requires no configuration and is provided…

Read more