As indicated earlier, it soon came clear that the calculation of a reasonable heuristic in reasonable time would be the greatest challenge in the optimization problem. This section will outline some of the approaches I followed and later abandoned.
Some of the ideas that I describe here may seem naive, but at the time they where explored, they seemed as viable approaches that at least was worth some attention. I hope that this chapter will be - if nothing else - a help to anyone who might continue this work or work with similar problems. Perhaps some of the approaches could actually be turned into usable algorithms, given more thought and work.