Environmental inspection routes and the constrained travelling system salesman problem

Two exact algorithms for the distance‐constrained vehicle routing problem

“…Many cases of the VRP treated in the literature [3-8, [10][11][12][13][14][15][16]26,27] include a combination of constraints (i) and (ii). If these constraints are relaxed, the VRP reduces to a traveling salesman problem (TSP [9] The V W appears to be much more difficult to solve than the TSP or the m-TSP To our knowledge, no exact algorithms have been devised to deal expressly with constraints (ii), although there exist practical applications of the VRP where distance constraints only are present, e.g., the case of a sales representative visiting customers but delivering and picking up no goods.…”

“…Many cases of the VRP treated in the literature [3-8, [10][11][12][13][14][15][16]26,27] include a combination of constraints (i) and (ii). If these constraints are relaxed, the VRP reduces to a traveling salesman problem (TSP [9] ) if m = 1 and to a multiple traveling salesman…”

Environmental Inspection Routes: An Operations Research Analysis

“…The computational method is based on recent heuristic analyses of the constrained traveling salesman problem. 2 Using the mileage data base together with estimated plant inspection times and estimated average traveling speeds, this segment generates a series of feasible low mileage tours that exhaustively cover the specified plants. This segment of the system is designed to run quickly and inexpensively so that it may be called daily, or as needed.…”