In Antes and Derigs (1995) another approach builds upon the classical insertion idea. Here every unrouted customer requests and receives from every route in the schedule a prize
for insertion, defined in a similar way as in the Solomon heuristics. Then the unrouted customers send a proposal to the route with the best offer, and each route accepts the best
proposal among those customers with the fewest number of alternatives. Note that more customers can be inserted in each iteration. If a certain threshold of routes is violated a certain
number of customers are removed and the process is initiated again. The results of Antes and Derigs (1995) are comparable to those presented in Potvin and Rousseau (1993). Generally
building several routes in parallel results in better solutions than building the routes one by one.