Solving the Tractor and Semi-Trailer Routing Problem Based on a Heuristic Approach

Table 3

The satisfactory solution of the TSRP achieved by the heuristic algorithm.

Types of the routes	Form of route	Working time needed by routes (hours)
A tractor with two drivers. Two different customer depots are passed by.; The route repeats once a day.	H—1—13—H	17
A tractor with two drivers. Three different customer depots are passed by.; The route repeats once a day.	H—3—13—4—H; H—7—12—2—H; H—9—2—8—H; H—11—4—3—H; H—11—13—9—H; H—12—5—13—H	17.5
A tractor with two drivers. Four different customer depots are passed by.; The route repeats once a day.	H—5—10—7—12—H; H—8—9—2—10—H	17
A tractor with two drivers. Five different customer depots are passed by.; The route repeats once a day.	H—2—8—6—10—5—H; H—6—4—13—8—11—H; H—6—5—3—12—11—H; H—6—11—8—9—4—H; H—10—8—2—1—5—H	17.5
A tractor with two drivers. Six different customer depots are passed by.; The route repeats once a day.	H—6—5—4—8—9—11—H	17
A tractor with two drivers. Two different customer depots are passed by.; The route repeats twice a day.	H—8—6—H—13—6—H	17.5