You are here


Vehicle Routing Problem With Black Box Feasibility

Solutions for the 3L-CVRP are provided in They contain routing and loading information. Solutions for the MP-VRP are provided in They contain routing information only. The source code is provided in It is provided under LGPL and CRAPL. Note that the code needs CPLEX/CONCERT libraries and the Boost libraries to compile.

Positive Table Constraints Benchmarks

Benchmarks problems defined using only positive table constraints. The folder contains 14 different benchmarks.

Castor: a Constraint-Based SPARQL Engine with Active Filter Processing

Castor is a prototype SPARQL engine embedding a specialized lightweight CP solver. It implements most of the SPARQL 1.0 specification. Currently, queries are performed on read-only datasets created from RDF graphs in a pre-processing step.

MO-LNS Benchmarks

This page contains instances and optimal pareto fronts of multi-objective instances solved with Multi-Objective Large Neighborhood Search:

  • Bi-objective Knapsack
  • Bi-objective Quadratic Assignment Problem
  • Bi-objective Tank Allocation Problem (see prob51 of CSPLib a link)

Balanced Academic Curriculum Problem

The Balanced Academic Curriculum Problem (BACP) is recurrent in Universities. The goal is to schedule the courses that a student must follow in order to respect the prerequisite constraints between courses and to balance as much as possible the workload of each period. Each period also has a minimum and maximum number of courses.

Solving the Quorumcast Routing Problem by Constraint Programming

The quorumcast routing problem is a generalization of multicasting which arises in many distributed applications. It consists of finding a minimum cost tree that spans the source node r and any q out of m specified nodes on a given undirected weighted graph. This paper proposes a complete and an incomplete approach, both based on the same Constraint Programming (CP) model, but with two different specific search heuristics based on shortest paths. Experimental results show the efficiency of the two proposed

Nurse to Patient Assignment

Instances used in the paper “Bound Consistent Spread Constraint: Application to load balancing in nurse to patient assignments” (Pierre Schaus & Jean-Charles Régin) (under revision).

Tank Allocation Problem

Slab image

The tank allocation problem involves the assignment of different cargoes (volumes of chemical products to be shipped by the vessel) to the available tanks of the vessel. The loading plans of bulk vessels are generally generated manually by the vessel planners although it is difficult to generate high quality solutions. The constraints to satisfy are mainly segregation constraints: