In this paper, an approximate IGLH solution approach is presented. Given pickup and delivery requirements together with relevant distance data, a matching network is constructed in which nodes correspond to sets of pickups and deliveries and links to routes. A minimum weight non-bipartite matching algorithm is solved over this network and the result is an IGLH solution. This solution is improved by again applying a minimum weight matching algorithm, this time to a matching network in which nodes correspond to routes and links to improved routes. The new IGLH solution procedure is tested on randomly generated data and on data provided by a large LTL carrier.
Computational tests show that near-optimal solutions are generated rapidly.