Color a Map with Constraint Programming


Fig. 25 Location United States of America

Map coloring is a very nice introductory problem to constraint programming. This article describes two aspects of creating a map coloring application: the problem itself, and the presentation of the solution.

Given a graph \(G=(V,E)\) with vertices \(V\) and edges \(E\) in between, what is the minimum number of colors needed such that two adjacent vertices, \(v1\) and \(v2\), have different colors? One obvious application of this problem is in the construction of maps with two adjacent regions that can easily be distinguished by their colors.

The CP Problem

First, we want to solve instances of this problem. From theory it is known that four colors suffice to solve the problem, and we have a set of 4 colors named selectedColors. The element variable stateColor(s), with range selectedColors, represents the color of each state. The constraint that two adjacent states have a different color, is modeled directly as:

1ElementVariable stateColor {
2    IndexDomain: (s);
3    Range: SelectedColors;
5Constraint AdjacentStatesHaveDifferentColors {
6    IndexDomain: (s1,s2)|s1 < s2 and s2 in AdjacentStates(s1);
7    Definition: stateColor(s1) <> stateColor(s2);

That’s it; the constraint programming problem is described by one element variable and one constraint.

The solution presentation

AIMMS offers an easy way to present the solution: just right-click on the variable and select data. The pivot table presented clearly contains the solution, but at a glance, does not enable one to see whether or not this solution is correct. For instance, Alaska and Hawaii are not presented in the solution because they are not adjacent to another state, and therefore are not part of the problem passed to the solver.

In order to get a solution that can be more easily inspected, we should actually draw the map.

Luckily, the AIMMS GIS Support example already contains a lot of GIS data about the states of the USA in the folder “US States GML Files”, which we will use here.

Next, you should create a network object without any nodes or arcs; we are interested in its background. Initially, to view the entire world, the visible area and bounds are set to: left: -180, right: 180, top 90, bottom -90. More appropriate bounds can be set later on. In addition, remove the check mark on equal X and Y scale, otherwise these bounds will continue to be adapted to the actual aspect ratio of the object on screen.

On the Background tab of the Network properties, select “From GIS source” for background, and specify the GIS data of each state. The trick here is to specify each state as a separate layer with its own GIS source, named stateSource(s), with type “GML” taken from file StateGMLFile(s). (GIS layers can overlap, but they do not in this example.) We can fill the layer with color according to the element variable of the CP problem.

Once this is done, adapt the visible area to your liking.

More information on GIS and network objects can be found in Help under Page manager > Page objects > Network > GIS.

You can also make the page responsive to screen size. #. In Edit mode, go to the View tab and select Resize edit mode. #. Click New horizontal split line and place it near the bottom or top of the page.

The model can be downloaded below:

To run this example, just press F6 to see the following solution:


Fig. 26 Solution State Coloring of the USA