Nicolas Optimization Scientist

About Nicolas


Articles written by Nicolas

Benchmark LocalSolver on huge instances of the Capacitated Vehicle Routing Problem (CVRP)
Benchmark Transportation Vehicle Routing

LocalSolver on huge instances of the Capacitated Vehicle Routing Problem (CVRP) June 13, 2022

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 comparing…

Read more
Benchmark Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) LocalSolver vs Gurobi
Benchmark Transportation Vehicle Routing

LocalSolver vs Gurobi on the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) April 4, 2022

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.…

Read more
Tutorial Broken records for the Movie Shoot Scheduling Problem
Tutorial Media Production Scheduling

Broken records for the Movie Shoot Scheduling Problem February 7, 2022

In this post, we describe and analyze the LocalSolver model of a simplified version of the Movie Shoot Scheduling Problem defined by Bomsdorf and Derigs in an OR Spectrum paper. This version is the subject of online competition on the Optimization Hub. A movie consists of a set of scenes. Each scene must be shot in a given location…

Read more
Benchmark Capacitated Vehicle Routing Problem (CVRP) LocalSolver vs Gurobi
Benchmark Transportation Vehicle Routing

LocalSolver vs Gurobi on the Capacitated Vehicle Routing Problem (CVRP) September 6, 2021

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 common depot. Each customer can only be served by one vehicle. Given a fleet of vehicles, the objective is to assign…

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

LocalSolver vs Gurobi on the Traveling Salesman Problem (TSP) July 26, 2021

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. We illustrate on this page how LocalSolver outperforms traditional general-purpose optimization solvers, like Gurobi 9.1, on this challenging problem. Input data The TSPLIB is the reference…

Read more
Benchmark K-Means Clustering Problem (MSSC) LocalSolver vs Gurobi
Benchmark Clustering MSSC

LocalSolver vs Gurobi on the K-Means Clustering Problem (MSSC) May 24, 2021

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). We illustrate on this page…

Read more