OPTIMIZATION OF THE HYDROMETRIC NETWORK OPERATION BY A HEURISTIC TRAVELING SALESMAN ALGORITHM 1

The problem of determining the optimal route to operate a network of hydrometric gauges within a given area is formulated and solved by an original heuristic traveling salesman algorithm. The algorithm used for solving the problem takes into account the variation of station service time, the eight‐hour maximum working day, existence of more than one home base, and the budget constraint. The traveling salesman algorithm is used to solve the optima! assignment problem within a one‐day time limit, locating a starting base, stations to visit, and the closest home base. The ending base for the previous day becomes the starting base for the next day, and the assignment procedure is repeated. The computation proceeds from day to day, until all the stations in the considered region are serviced. The solution obtained presents the optimal route to operate a network of hydrometric gauges. The optimization procedure has been applied to the Dauphin hydrometric field area in Manitoba.