Many methods have been proposed for heat exchanger network (HEN) synthesis. The algorithmic methods rely heavily on sophisticated mathematical programming techniques, whilst heuristic methods do not always produce the best designs, although, current versions of the pinch design method yield improved solutions by utilising the "driving force plot" and the "remaining problem analysis". Such designs are evolved by sequential choice of matches, however, with sequential matching, it is not always clear which of a number of available candidate matches should be chosen, although some will determine the eventual network cost. An alternative new heuristic method is proposed which does not rely on pinch decomposition. The composite curves are decomposed into a number of "blocks" (which may exceed the two blocks formed by pinch decomposition). Within each block, straight line segments approximate the composite curves giving "quasi-composites". Area calculations based on maximum heat exchange are performed between all hot and cold feasible matches in each block and these areas are compared with the ideal areas from the quasi-composites. A good set of design matches can then be simultaneously selected with any matching constraints taken into account by parallel examination of the whole set of possible matches in a block. Designs using this approach will be compared to those from other methods.